nameability identity equality and completeness phds in
play

Nameability, Identity, Equality and Completeness PhDs in Logic 2017 - PowerPoint PPT Presentation

Dec 11, 2023 •570 likes •2.08k views

Nameability, Identity, Equality and Completeness PhDs in Logic 2017 Bochum Mara Manzano Departamento Filosofa y Lgica y Filosofa de la Ciencia Universidad de Salamanca Espaa USAL May 2017 M. Manzano (USAL) NIEC May 2017 1 / 25

  1. Identity and equality in classical logic First-order and Higher-order Logics First-order logic: Identity is a logical primitive concept We can’t define it, we need axioms and rules to treat equality Reflexivity axiom Equals substitution Second-order logic: Identity can be defined using Leibniz’s principle x = y ↔ Df ∀ X ( Xx → Xy ) the property of being the least reflexive relation x = y ↔ Df ∀ Y ( ∀ zYzz → Yxy ) M. Manzano (USAL) NIEC May 2017 7 / 25

  2. Identity and equality in classical logic First-order and Higher-order Logics First-order logic: Identity is a logical primitive concept We can’t define it, we need axioms and rules to treat equality Reflexivity axiom Equals substitution Second-order logic: Identity can be defined using Leibniz’s principle x = y ↔ Df ∀ X ( Xx → Xy ) the property of being the least reflexive relation x = y ↔ Df ∀ Y ( ∀ zYzz → Yxy ) Both can be used to define identity for individuals as the relation defined by them is ‘genuine’ identity in any standard second order structure , M. Manzano (USAL) NIEC May 2017 7 / 25

  3. Identity and equality in classical logic First-order and Higher-order Logics First-order logic: Identity is a logical primitive concept We can’t define it, we need axioms and rules to treat equality Reflexivity axiom Equals substitution Second-order logic: Identity can be defined using Leibniz’s principle x = y ↔ Df ∀ X ( Xx → Xy ) the property of being the least reflexive relation x = y ↔ Df ∀ Y ( ∀ zYzz → Yxy ) Both can be used to define identity for individuals as the relation defined by them is ‘genuine’ identity in any standard second order structure , However, in SOL with general structures the possibility of defining identity is lost and we return to the situation encountered in FOL . M. Manzano (USAL) NIEC May 2017 7 / 25

  4. Identity and equality in classical logic First-order and Higher-order Logics First-order logic: Identity is a logical primitive concept We can’t define it, we need axioms and rules to treat equality Reflexivity axiom Equals substitution Second-order logic: Identity can be defined using Leibniz’s principle x = y ↔ Df ∀ X ( Xx → Xy ) the property of being the least reflexive relation x = y ↔ Df ∀ Y ( ∀ zYzz → Yxy ) Both can be used to define identity for individuals as the relation defined by them is ‘genuine’ identity in any standard second order structure , However, in SOL with general structures the possibility of defining identity is lost and we return to the situation encountered in FOL . All identicals are equal, but some equals are more equal than others M. Manzano (USAL) NIEC May 2017 7 / 25

  5. Identity and equality All identicals are equal, but some equals are more equal than others M. Manzano (USAL) NIEC May 2017 8 / 25

  6. Identity and equality in modal logic First-order modal logic In Modal Logic M. Manzano (USAL) NIEC May 2017 9 / 25

  7. Identity and equality in modal logic First-order modal logic In Modal Logic from an “ontological” point of view M. Manzano (USAL) NIEC May 2017 9 / 25

  8. Identity and equality in modal logic First-order modal logic In Modal Logic from an “ontological” point of view equality symbol interpreted as pure global identity M. Manzano (USAL) NIEC May 2017 9 / 25

  9. Identity and equality in modal logic First-order modal logic In Modal Logic from an “ontological” point of view equality symbol interpreted as pure global identity M , w � g ( x = y ) iff g ( x ) = g ( y ) M. Manzano (USAL) NIEC May 2017 9 / 25

  10. Identity and equality in modal logic First-order modal logic In Modal Logic from an “ontological” point of view equality symbol interpreted as pure global identity M , w � g ( x = y ) iff g ( x ) = g ( y ) recall that variables are rigid terms M. Manzano (USAL) NIEC May 2017 9 / 25

  11. Identity and equality in modal logic First-order modal logic In Modal Logic from an “ontological” point of view equality symbol interpreted as pure global identity M , w � g ( x = y ) iff g ( x ) = g ( y ) recall that variables are rigid terms What about equals substitution? M. Manzano (USAL) NIEC May 2017 9 / 25

  12. Identity and equality in modal logic First-order modal logic In Modal Logic from an “ontological” point of view equality symbol interpreted as pure global identity M , w � g ( x = y ) iff g ( x ) = g ( y ) recall that variables are rigid terms What about equals substitution? x = y → � ( x = y ) necessity of identity ( NI ) M. Manzano (USAL) NIEC May 2017 9 / 25

  13. Identity and equality in modal logic First-order modal logic In Modal Logic from an “ontological” point of view equality symbol interpreted as pure global identity M , w � g ( x = y ) iff g ( x ) = g ( y ) recall that variables are rigid terms What about equals substitution? x = y → � ( x = y ) necessity of identity ( NI ) substitutivity of identicals ( SI ) x = y → ( ϕ ( x ) → ϕ ( y )) M. Manzano (USAL) NIEC May 2017 9 / 25

  14. Identity and equality in modal logic First-order modal logic In Modal Logic from an “ontological” point of view equality symbol interpreted as pure global identity M , w � g ( x = y ) iff g ( x ) = g ( y ) recall that variables are rigid terms What about equals substitution? x = y → � ( x = y ) necessity of identity ( NI ) substitutivity of identicals ( SI ) x = y → ( ϕ ( x ) → ϕ ( y )) are both sound? M. Manzano (USAL) NIEC May 2017 9 / 25

  15. Identity and equality in modal logic First-order modal logic In Modal Logic from an “ontological” point of view equality symbol interpreted as pure global identity M , w � g ( x = y ) iff g ( x ) = g ( y ) recall that variables are rigid terms What about equals substitution? x = y → � ( x = y ) necessity of identity ( NI ) substitutivity of identicals ( SI ) x = y → ( ϕ ( x ) → ϕ ( y )) are both sound? These rules turn out to be problematic when terms other than variables are used M. Manzano (USAL) NIEC May 2017 9 / 25

  16. Identity and equality in modal logic First-order modal logic In Modal Logic from an “ontological” point of view equality symbol interpreted as pure global identity M , w � g ( x = y ) iff g ( x ) = g ( y ) recall that variables are rigid terms What about equals substitution? x = y → � ( x = y ) necessity of identity ( NI ) substitutivity of identicals ( SI ) x = y → ( ϕ ( x ) → ϕ ( y )) are both sound? These rules turn out to be problematic when terms other than variables are used that is, when we have intensional terms M. Manzano (USAL) NIEC May 2017 9 / 25

  17. Identity and equality in modal logic First-order modal logic In Modal Logic from an “ontological” point of view equality symbol interpreted as pure global identity M , w � g ( x = y ) iff g ( x ) = g ( y ) recall that variables are rigid terms What about equals substitution? x = y → � ( x = y ) necessity of identity ( NI ) substitutivity of identicals ( SI ) x = y → ( ϕ ( x ) → ϕ ( y )) are both sound? These rules turn out to be problematic when terms other than variables are used that is, when we have intensional terms these rules only apply for rigids M. Manzano (USAL) NIEC May 2017 9 / 25

  18. Identity and equality in modal logic Fitting and Meldensohn, (1998) Term Equality: Melvin Fitting introduces a new relation between intensional terms M. Manzano (USAL) NIEC May 2017 10 / 25

  19. Identity and equality in modal logic Fitting and Meldensohn, (1998) Term Equality: Melvin Fitting introduces a new relation between intensional terms τ 1 � τ 2 ↔ Df � λ x , y . y = x � ( τ 2 , τ 1 ) M. Manzano (USAL) NIEC May 2017 10 / 25

  20. Identity and equality in modal logic Fitting and Meldensohn, (1998) Term Equality: Melvin Fitting introduces a new relation between intensional terms τ 1 � τ 2 ↔ Df � λ x , y . y = x � ( τ 2 , τ 1 ) M , w � g ( τ 1 � τ 2 ) iff ( τ 1 ) � ( w ) = ( τ 2 ) � ( w ) ‘x = y asserts that the objects that are the values of x and y are the same’ M. Manzano (USAL) NIEC May 2017 10 / 25

  21. Identity and equality in modal logic Fitting and Meldensohn, (1998) Term Equality: Melvin Fitting introduces a new relation between intensional terms τ 1 � τ 2 ↔ Df � λ x , y . y = x � ( τ 2 , τ 1 ) M , w � g ( τ 1 � τ 2 ) iff ( τ 1 ) � ( w ) = ( τ 2 ) � ( w ) ‘x = y asserts that the objects that are the values of x and y are the same’ and the relation defined by it can be taken as the identity relation M. Manzano (USAL) NIEC May 2017 10 / 25

  22. Identity and equality in modal logic Fitting and Meldensohn, (1998) Term Equality: Melvin Fitting introduces a new relation between intensional terms τ 1 � τ 2 ↔ Df � λ x , y . y = x � ( τ 2 , τ 1 ) M , w � g ( τ 1 � τ 2 ) iff ( τ 1 ) � ( w ) = ( τ 2 ) � ( w ) ‘x = y asserts that the objects that are the values of x and y are the same’ and the relation defined by it can be taken as the identity relation ‘ τ 1 � τ 2 asserts that the terms τ 1 and τ 2 designate the same object, which is quite a different thing.’ M. Manzano (USAL) NIEC May 2017 10 / 25

  23. Identity and equality in modal logic Fitting and Meldensohn, (1998) Term Equality: Melvin Fitting introduces a new relation between intensional terms τ 1 � τ 2 ↔ Df � λ x , y . y = x � ( τ 2 , τ 1 ) M , w � g ( τ 1 � τ 2 ) iff ( τ 1 ) � ( w ) = ( τ 2 ) � ( w ) ‘x = y asserts that the objects that are the values of x and y are the same’ and the relation defined by it can be taken as the identity relation ‘ τ 1 � τ 2 asserts that the terms τ 1 and τ 2 designate the same object, which is quite a different thing.’ the formula τ 1 � τ 2 → � ( τ 1 � τ 2 ) , is not valid. M. Manzano (USAL) NIEC May 2017 10 / 25

  24. Identity and equality in modal logic Fitting and Meldensohn, (1998) Term Equality: Melvin Fitting introduces a new relation between intensional terms τ 1 � τ 2 ↔ Df � λ x , y . y = x � ( τ 2 , τ 1 ) M , w � g ( τ 1 � τ 2 ) iff ( τ 1 ) � ( w ) = ( τ 2 ) � ( w ) ‘x = y asserts that the objects that are the values of x and y are the same’ and the relation defined by it can be taken as the identity relation ‘ τ 1 � τ 2 asserts that the terms τ 1 and τ 2 designate the same object, which is quite a different thing.’ the formula τ 1 � τ 2 → � ( τ 1 � τ 2 ) , is not valid. ‘In fact, � ( τ 1 � τ 2 ) express a notion considerable stronger than that of simple equality –it has the characteristics of synonymy ’ M. Manzano (USAL) NIEC May 2017 10 / 25

  25. Nominals and the satisfaction operator in hybrid logic Pure Extensions, Proof Rules and Hybrid Axiomatics (Blackburn and ten Cate) In Kripke semantics we have a universe of worlds M. Manzano (USAL) NIEC May 2017 11 / 25

  26. Nominals and the satisfaction operator in hybrid logic Pure Extensions, Proof Rules and Hybrid Axiomatics (Blackburn and ten Cate) In Kripke semantics we have a universe of worlds Can we express in the language identity of worlds? 1 M. Manzano (USAL) NIEC May 2017 11 / 25

  27. Nominals and the satisfaction operator in hybrid logic Pure Extensions, Proof Rules and Hybrid Axiomatics (Blackburn and ten Cate) In Kripke semantics we have a universe of worlds Can we express in the language identity of worlds? 1 what about the accessibility relation between worlds, can be referred 2 to? M. Manzano (USAL) NIEC May 2017 11 / 25

  28. Nominals and the satisfaction operator in hybrid logic Pure Extensions, Proof Rules and Hybrid Axiomatics (Blackburn and ten Cate) In Kripke semantics we have a universe of worlds Can we express in the language identity of worlds? 1 what about the accessibility relation between worlds, can be referred 2 to? NO M. Manzano (USAL) NIEC May 2017 11 / 25

  29. Nominals and the satisfaction operator in hybrid logic Pure Extensions, Proof Rules and Hybrid Axiomatics (Blackburn and ten Cate) In Kripke semantics we have a universe of worlds Can we express in the language identity of worlds? 1 what about the accessibility relation between worlds, can be referred 2 to? NO This lack of expressivity of orthodox modal logic is an obvious weak M. Manzano (USAL) NIEC May 2017 11 / 25

  30. Nominals and the satisfaction operator in hybrid logic Pure Extensions, Proof Rules and Hybrid Axiomatics (Blackburn and ten Cate) In Kripke semantics we have a universe of worlds Can we express in the language identity of worlds? 1 what about the accessibility relation between worlds, can be referred 2 to? NO This lack of expressivity of orthodox modal logic is an obvious weak � and ♦ are, in essence, quantifiers over worlds in disguise. M. Manzano (USAL) NIEC May 2017 11 / 25

  31. Nominals and the satisfaction operator in hybrid logic Pure Extensions, Proof Rules and Hybrid Axiomatics (Blackburn and ten Cate) In Kripke semantics we have a universe of worlds Can we express in the language identity of worlds? 1 what about the accessibility relation between worlds, can be referred 2 to? NO This lack of expressivity of orthodox modal logic is an obvious weak � and ♦ are, in essence, quantifiers over worlds in disguise. The basic hybrid language is the modal solution to this deficiency. M. Manzano (USAL) NIEC May 2017 11 / 25

  32. Nominals and the satisfaction operator in hybrid logic Pure Extensions, Proof Rules and Hybrid Axiomatics (Blackburn and ten Cate) In Kripke semantics we have a universe of worlds Can we express in the language identity of worlds? 1 what about the accessibility relation between worlds, can be referred 2 to? NO This lack of expressivity of orthodox modal logic is an obvious weak � and ♦ are, in essence, quantifiers over worlds in disguise. The basic hybrid language is the modal solution to this deficiency. ‘What is a hybrid language? A variant of orthodox modal logic in which the notion of world has been internalized.’ M. Manzano (USAL) NIEC May 2017 11 / 25

  33. Nominals and the satisfaction operator in hybrid logic Pure Extensions, Proof Rules and Hybrid Axiomatics (Blackburn and ten Cate) In Kripke semantics we have a universe of worlds Can we express in the language identity of worlds? 1 what about the accessibility relation between worlds, can be referred 2 to? NO This lack of expressivity of orthodox modal logic is an obvious weak � and ♦ are, in essence, quantifiers over worlds in disguise. The basic hybrid language is the modal solution to this deficiency. ‘What is a hybrid language? A variant of orthodox modal logic in which the notion of world has been internalized.’ The two innovations of basic hybrid logic are: M. Manzano (USAL) NIEC May 2017 11 / 25

  34. Nominals and the satisfaction operator in hybrid logic Pure Extensions, Proof Rules and Hybrid Axiomatics (Blackburn and ten Cate) In Kripke semantics we have a universe of worlds Can we express in the language identity of worlds? 1 what about the accessibility relation between worlds, can be referred 2 to? NO This lack of expressivity of orthodox modal logic is an obvious weak � and ♦ are, in essence, quantifiers over worlds in disguise. The basic hybrid language is the modal solution to this deficiency. ‘What is a hybrid language? A variant of orthodox modal logic in which the notion of world has been internalized.’ The two innovations of basic hybrid logic are: the nominals and M. Manzano (USAL) NIEC May 2017 11 / 25

  35. Nominals and the satisfaction operator in hybrid logic Pure Extensions, Proof Rules and Hybrid Axiomatics (Blackburn and ten Cate) In Kripke semantics we have a universe of worlds Can we express in the language identity of worlds? 1 what about the accessibility relation between worlds, can be referred 2 to? NO This lack of expressivity of orthodox modal logic is an obvious weak � and ♦ are, in essence, quantifiers over worlds in disguise. The basic hybrid language is the modal solution to this deficiency. ‘What is a hybrid language? A variant of orthodox modal logic in which the notion of world has been internalized.’ The two innovations of basic hybrid logic are: the nominals and the satisfaction operators . M. Manzano (USAL) NIEC May 2017 11 / 25

  36. Nominals and the satisfaction operator in hybrid logic Nominals are special propositional symbols i ∈ NOM M. Manzano (USAL) NIEC May 2017 12 / 25

  37. Nominals and the satisfaction operator in hybrid logic Nominals are special propositional symbols i ∈ NOM nominals are true at a unique world in any model M. Manzano (USAL) NIEC May 2017 12 / 25

  38. Nominals and the satisfaction operator in hybrid logic Nominals are special propositional symbols i ∈ NOM nominals are true at a unique world in any model Satisfaction operator is a rigidifier operator M. Manzano (USAL) NIEC May 2017 12 / 25

  39. Nominals and the satisfaction operator in hybrid logic Nominals are special propositional symbols i ∈ NOM nominals are true at a unique world in any model Satisfaction operator is a rigidifier operator @ i ϕ is either true at all worlds, or false at all worlds M. Manzano (USAL) NIEC May 2017 12 / 25

  40. Nominals and the satisfaction operator in hybrid logic Nominals are special propositional symbols i ∈ NOM nominals are true at a unique world in any model Satisfaction operator is a rigidifier operator @ i ϕ is either true at all worlds, or false at all worlds Hybrid logic offers mechanism for naming worlds, asserting equalities between worlds and describing accessibility relation. M. Manzano (USAL) NIEC May 2017 12 / 25

  41. Nominals and the satisfaction operator in hybrid logic Nominals are special propositional symbols i ∈ NOM nominals are true at a unique world in any model Satisfaction operator is a rigidifier operator @ i ϕ is either true at all worlds, or false at all worlds Hybrid logic offers mechanism for naming worlds, asserting equalities between worlds and describing accessibility relation. Formulas of form @ i j , together with @ i ♦ j are extremely important M. Manzano (USAL) NIEC May 2017 12 / 25

  42. Nominals and the satisfaction operator in hybrid logic Nominals are special propositional symbols i ∈ NOM nominals are true at a unique world in any model Satisfaction operator is a rigidifier operator @ i ϕ is either true at all worlds, or false at all worlds Hybrid logic offers mechanism for naming worlds, asserting equalities between worlds and describing accessibility relation. Formulas of form @ i j , together with @ i ♦ j are extremely important @ i j asserts that i and j name the same point. M. Manzano (USAL) NIEC May 2017 12 / 25

  43. Nominals and the satisfaction operator in hybrid logic Nominals are special propositional symbols i ∈ NOM nominals are true at a unique world in any model Satisfaction operator is a rigidifier operator @ i ϕ is either true at all worlds, or false at all worlds Hybrid logic offers mechanism for naming worlds, asserting equalities between worlds and describing accessibility relation. Formulas of form @ i j , together with @ i ♦ j are extremely important @ i j asserts that i and j name the same point. @ i j is a modal way of expressing what i = j would express in classical logic. M. Manzano (USAL) NIEC May 2017 12 / 25

  44. Nominals and the satisfaction operator in hybrid logic Nominals are special propositional symbols i ∈ NOM nominals are true at a unique world in any model Satisfaction operator is a rigidifier operator @ i ϕ is either true at all worlds, or false at all worlds Hybrid logic offers mechanism for naming worlds, asserting equalities between worlds and describing accessibility relation. Formulas of form @ i j , together with @ i ♦ j are extremely important @ i j asserts that i and j name the same point. @ i j is a modal way of expressing what i = j would express in classical logic. The reflexivity, symmetry and transitivity of equality are validities: @ i i @ i j → @ j i @ i j ∧ @ j k → @ i k M. Manzano (USAL) NIEC May 2017 12 / 25

  45. Nominals and the satisfaction operator in hybrid logic Nominals are special propositional symbols i ∈ NOM nominals are true at a unique world in any model Satisfaction operator is a rigidifier operator @ i ϕ is either true at all worlds, or false at all worlds Hybrid logic offers mechanism for naming worlds, asserting equalities between worlds and describing accessibility relation. Formulas of form @ i j , together with @ i ♦ j are extremely important @ i j asserts that i and j name the same point. @ i j is a modal way of expressing what i = j would express in classical logic. The reflexivity, symmetry and transitivity of equality are validities: @ i i @ i j → @ j i @ i j ∧ @ j k → @ i k @ i ♦ j express the accessibility relation and allows to define relevant properties this relation might have, some are undefinable in orthodox modal logic M. Manzano (USAL) NIEC May 2017 12 / 25

  46. Nominals and the satisfaction operator in hybrid logic Nominals are special propositional symbols i ∈ NOM nominals are true at a unique world in any model Satisfaction operator is a rigidifier operator @ i ϕ is either true at all worlds, or false at all worlds Hybrid logic offers mechanism for naming worlds, asserting equalities between worlds and describing accessibility relation. Formulas of form @ i j , together with @ i ♦ j are extremely important @ i j asserts that i and j name the same point. @ i j is a modal way of expressing what i = j would express in classical logic. The reflexivity, symmetry and transitivity of equality are validities: @ i i @ i j → @ j i @ i j ∧ @ j k → @ i k @ i ♦ j express the accessibility relation and allows to define relevant properties this relation might have, some are undefinable in orthodox modal logic like irreflexivity or trichotomy: @ i ¬ ♦ i @ i j ∨ @ i ♦ j ∨ @ j ♦ i M. Manzano (USAL) NIEC May 2017 12 / 25

  47. Zen Philosophy The book of perfect emptiness Tang de Ying asked Ge: M. Manzano (USAL) NIEC May 2017 13 / 25

  48. Zen Philosophy The book of perfect emptiness Tang de Ying asked Ge: “Did things exist at the dawn of time?” M. Manzano (USAL) NIEC May 2017 13 / 25

  49. Zen Philosophy The book of perfect emptiness Tang de Ying asked Ge: “Did things exist at the dawn of time?” Xia Ge answered: M. Manzano (USAL) NIEC May 2017 13 / 25

  50. Zen Philosophy The book of perfect emptiness Tang de Ying asked Ge: “Did things exist at the dawn of time?” Xia Ge answered: “If things had not existed at the dawn of time, how could they possibly exist today? M. Manzano (USAL) NIEC May 2017 13 / 25

  51. Zen Philosophy The book of perfect emptiness Tang de Ying asked Ge: “Did things exist at the dawn of time?” Xia Ge answered: “If things had not existed at the dawn of time, how could they possibly exist today? By the same token, men in the future could believe that things did not exist today. M. Manzano (USAL) NIEC May 2017 13 / 25

  52. Zen Philosophy The book of perfect emptiness The argument can be reformulated in this way M. Manzano (USAL) NIEC May 2017 14 / 25

  53. Zen Philosophy The book of perfect emptiness The argument can be reformulated in this way α : = If things exist at a given point in time, then at any given 1 previous moment in time things must have existed. α : = q → Hq M. Manzano (USAL) NIEC May 2017 14 / 25

  54. Zen Philosophy The book of perfect emptiness The argument can be reformulated in this way α : = If things exist at a given point in time, then at any given 1 previous moment in time things must have existed. α : = q → Hq β : = Things exist today. 2 β : = @ t q M. Manzano (USAL) NIEC May 2017 14 / 25

  55. Zen Philosophy The book of perfect emptiness The argument can be reformulated in this way α : = If things exist at a given point in time, then at any given 1 previous moment in time things must have existed. α : = q → Hq β : = Things exist today. 2 β : = @ t q γ : = The dawn of time is previous to all else. 3 γ : = @ d H ⊥ M. Manzano (USAL) NIEC May 2017 14 / 25

  56. Zen Philosophy The book of perfect emptiness The argument can be reformulated in this way α : = If things exist at a given point in time, then at any given 1 previous moment in time things must have existed. α : = q → Hq β : = Things exist today. 2 β : = @ t q γ : = The dawn of time is previous to all else. 3 γ : = @ d H ⊥ δ : = Things existed at the dawn of time. 4 δ : = @ d q M. Manzano (USAL) NIEC May 2017 14 / 25

  57. Zen Philosophy The book of perfect emptiness The argument can be reformulated in this way α : = If things exist at a given point in time, then at any given 1 previous moment in time things must have existed. α : = q → Hq β : = Things exist today. 2 β : = @ t q γ : = The dawn of time is previous to all else. 3 γ : = @ d H ⊥ δ : = Things existed at the dawn of time. 4 δ : = @ d q To prove { α , β , γ } � δ we can use the trichotomy axiom 5 @ d t ∨ @ d Pt ∨ @ t Pd M. Manzano (USAL) NIEC May 2017 14 / 25

  58. Equational Hybrid Propositional Type Theory A Combined Logic Equational hybrid propositional type theory EHPT T is a combination of logics where identity plays a relevant role: Propositional type theory, PTT M. Manzano (USAL) NIEC May 2017 15 / 25

  59. Equational Hybrid Propositional Type Theory A Combined Logic Equational hybrid propositional type theory EHPT T is a combination of logics where identity plays a relevant role: Propositional type theory, PTT where all connectives and quantifiers are defined with λ and ≡ M. Manzano (USAL) NIEC May 2017 15 / 25

  60. Equational Hybrid Propositional Type Theory A Combined Logic Equational hybrid propositional type theory EHPT T is a combination of logics where identity plays a relevant role: Propositional type theory, PTT where all connectives and quantifiers are defined with λ and ≡ Equational logic, EL M. Manzano (USAL) NIEC May 2017 15 / 25

  61. Equational Hybrid Propositional Type Theory A Combined Logic Equational hybrid propositional type theory EHPT T is a combination of logics where identity plays a relevant role: Propositional type theory, PTT where all connectives and quantifiers are defined with λ and ≡ Equational logic, EL where all formulas are equations M. Manzano (USAL) NIEC May 2017 15 / 25

  62. Equational Hybrid Propositional Type Theory A Combined Logic Equational hybrid propositional type theory EHPT T is a combination of logics where identity plays a relevant role: Propositional type theory, PTT where all connectives and quantifiers are defined with λ and ≡ Equational logic, EL where all formulas are equations Hybrid logic, HL M. Manzano (USAL) NIEC May 2017 15 / 25

  63. Equational Hybrid Propositional Type Theory A Combined Logic Equational hybrid propositional type theory EHPT T is a combination of logics where identity plays a relevant role: Propositional type theory, PTT where all connectives and quantifiers are defined with λ and ≡ Equational logic, EL where all formulas are equations Hybrid logic, HL where intensional contexts are relevant M. Manzano (USAL) NIEC May 2017 15 / 25

  64. Equational Hybrid Propositional Type Theory A Combined Logic Equational hybrid propositional type theory EHPT T is a combination of logics where identity plays a relevant role: Propositional type theory, PTT where all connectives and quantifiers are defined with λ and ≡ Equational logic, EL where all formulas are equations Hybrid logic, HL where intensional contexts are relevant identity between worlds is expressible M. Manzano (USAL) NIEC May 2017 15 / 25

  65. Equational Hybrid Propositional Type Theory A Combined Logic Equational hybrid propositional type theory EHPT T is a combination of logics where identity plays a relevant role: Propositional type theory, PTT where all connectives and quantifiers are defined with λ and ≡ Equational logic, EL where all formulas are equations Hybrid logic, HL where intensional contexts are relevant identity between worlds is expressible The challenge is to deal with these heterogeneous components in an integrated system M. Manzano (USAL) NIEC May 2017 15 / 25

  66. Equational Hybrid Propositional Type Theory The Language Equational hybrid propositional type theory EHPT T algebraic and propositional types TYPES = AT ∪ PT M. Manzano (USAL) NIEC May 2017 16 / 25

  67. Equational Hybrid Propositional Type Theory The Language Equational hybrid propositional type theory EHPT T algebraic and propositional types TYPES = AT ∪ PT propositional variables and nominals are atoms M. Manzano (USAL) NIEC May 2017 16 / 25

  68. Equational Hybrid Propositional Type Theory The Language Equational hybrid propositional type theory EHPT T algebraic and propositional types TYPES = AT ∪ PT propositional variables and nominals are atoms individual variables and constants, function symbols, etc. to form individual terms M. Manzano (USAL) NIEC May 2017 16 / 25

  69. Equational Hybrid Propositional Type Theory The Language Equational hybrid propositional type theory EHPT T algebraic and propositional types TYPES = AT ∪ PT propositional variables and nominals are atoms individual variables and constants, function symbols, etc. to form individual terms other meaningful expressions using: M. Manzano (USAL) NIEC May 2017 16 / 25

  70. Equational Hybrid Propositional Type Theory The Language Equational hybrid propositional type theory EHPT T algebraic and propositional types TYPES = AT ∪ PT propositional variables and nominals are atoms individual variables and constants, function symbols, etc. to form individual terms other meaningful expressions using: lambda operator λ , M. Manzano (USAL) NIEC May 2017 16 / 25

  71. Equational Hybrid Propositional Type Theory The Language Equational hybrid propositional type theory EHPT T algebraic and propositional types TYPES = AT ∪ PT propositional variables and nominals are atoms individual variables and constants, function symbols, etc. to form individual terms other meaningful expressions using: lambda operator λ , equality symbol (with ≡ ) between expressions of several types PT ∪ AT − { 0 } M. Manzano (USAL) NIEC May 2017 16 / 25

  72. Equational Hybrid Propositional Type Theory The Language Equational hybrid propositional type theory EHPT T algebraic and propositional types TYPES = AT ∪ PT propositional variables and nominals are atoms individual variables and constants, function symbols, etc. to form individual terms other meaningful expressions using: lambda operator λ , equality symbol (with ≡ ) between expressions of several types PT ∪ AT − { 0 } modal operators ♦ and @ i M. Manzano (USAL) NIEC May 2017 16 / 25

  73. Equational Hybrid Propositional Type Theory The Language Equational hybrid propositional type theory EHPT T algebraic and propositional types TYPES = AT ∪ PT propositional variables and nominals are atoms individual variables and constants, function symbols, etc. to form individual terms other meaningful expressions using: lambda operator λ , equality symbol (with ≡ ) between expressions of several types PT ∪ AT − { 0 } modal operators ♦ and @ i As defined operators using λ and ≡ we have: M. Manzano (USAL) NIEC May 2017 16 / 25

  74. Equational Hybrid Propositional Type Theory The Language Equational hybrid propositional type theory EHPT T algebraic and propositional types TYPES = AT ∪ PT propositional variables and nominals are atoms individual variables and constants, function symbols, etc. to form individual terms other meaningful expressions using: lambda operator λ , equality symbol (with ≡ ) between expressions of several types PT ∪ AT − { 0 } modal operators ♦ and @ i As defined operators using λ and ≡ we have: usual propositional connectives and propositional quantifiers M. Manzano (USAL) NIEC May 2017 16 / 25

  75. Equational Hybrid Propositional Type Theory The Language Equational hybrid propositional type theory EHPT T algebraic and propositional types TYPES = AT ∪ PT propositional variables and nominals are atoms individual variables and constants, function symbols, etc. to form individual terms other meaningful expressions using: lambda operator λ , equality symbol (with ≡ ) between expressions of several types PT ∪ AT − { 0 } modal operators ♦ and @ i As defined operators using λ and ≡ we have: usual propositional connectives and propositional quantifiers algebraic equations τ ≈ σ : = Df λ v 1 , . . . , v n τ ≡ λ v 1 , . . . , v n σ M. Manzano (USAL) NIEC May 2017 16 / 25

  76. Equational Hybrid Propositional Type Theory The Semantics The structures M = � W , R , A , PT , I � used to interpret the language include several domains: M. Manzano (USAL) NIEC May 2017 17 / 25

  77. Equational Hybrid Propositional Type Theory The Semantics The structures M = � W , R , A , PT , I � used to interpret the language include several domains: a set of worlds, W , M. Manzano (USAL) NIEC May 2017 17 / 25

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Leon Henkin on Completeness Henkins renowned proofs of PhDs in Logic 2017 completeness The

Leon Henkin on Completeness Henkins renowned proofs of PhDs in Logic 2017 completeness The

Henkin on Completeness Manzano, M Leon Henkin on Completeness Henkins renowned proofs of PhDs in Logic 2017 completeness The Bochum completeness of FOL in Henkins course Manzano, M References USAL May 2017 Henkin on

1.08k views • 104 slides
Equality One of the most important relations is equality ( identity ). Elements x and y are equal,

Equality One of the most important relations is equality ( identity ). Elements x and y are equal,

Equality One of the most important relations is equality ( identity ). Elements x and y are equal, written x = y , if they are the same element. Equality can be expressed as a predicate, e.g., we can choose that P ( x , y ) represents proposition

826 views • 38 slides
Identity types as equality predicates Reconciling hyperdoctrines with MLTT HoTT 2019 Carnegie

Identity types as equality predicates Reconciling hyperdoctrines with MLTT HoTT 2019 Carnegie

Pierre Cagne joint work with Paul-Andr Mellis Universit Paris Diderot Paris 7 Identity types as equality predicates Reconciling hyperdoctrines with MLTT HoTT 2019 Carnegie Mellon University August 12, 2019 1. Lawveres

1.04k views • 99 slides
What ECLAC proposes: the trilogy of equality Equality is the goal, structural change is the

What ECLAC proposes: the trilogy of equality Equality is the goal, structural change is the

What ECLAC proposes: the trilogy of equality Equality is the goal, structural change is the path, and the art of politics and policymaking is the instrument Equality with a rights-based approach Time for Equality (Brasilia, 2010 ): equality

1.03k views • 57 slides
LGBT GBTQ+ Upd Q+ Update te = Equality < Inequality Identity LGBT GBTQ+ Upd Q+

LGBT GBTQ+ Upd Q+ Update te = Equality < Inequality Identity LGBT GBTQ+ Upd Q+

LGBT GBTQ+ Upd Q+ Update te = Equality < Inequality Identity LGBT GBTQ+ Upd Q+ Update te = Equality < Inequality + Identity LGBT GBTQ+ Q+ ???? ???? Lesbian

325 views • 28 slides
NP-Completeness : Concepts Why Studying NP-Completeness ? Pursuing your

NP-Completeness : Concepts Why Studying NP-Completeness ? Pursuing your

NP-Completeness : Concepts Why Studying NP-Completeness ? Pursuing your Ph.D. Keeping your job Before studying NP-completeness : I cant find an efficient algorithm, I guess Im just too dumb. 1 After studying

770 views • 34 slides
NP-completeness Evgenij Thorstensen V18 Evgenij Thorstensen NP-completeness V18 1 / 24 Recap

NP-completeness Evgenij Thorstensen V18 Evgenij Thorstensen NP-completeness V18 1 / 24 Recap

NP-completeness Evgenij Thorstensen V18 Evgenij Thorstensen NP-completeness V18 1 / 24 Recap completeness Recall A P B if there is a polynomial-time many-one reduction from A to B. Problems/strings in A can be transformed correctly into

580 views • 25 slides
Completeness of Resolution Theorem (Completeness) If a set of clauses S has no models then S *

Completeness of Resolution Theorem (Completeness) If a set of clauses S has no models then S *

5ai Completeness of Resolution Theorem (Completeness) If a set of clauses S has no models then S * [] (i.e. there is a resolution refutation of [] from S .) AUTOMATED REASONING Proof Structure for Resolution Completeness SLIDES 5: Assume

668 views • 7 slides
CPSC 320: NP-Completeness CPSC 320 2013W2 CPSC 320: NP-Completeness Up to now: We have been

CPSC 320: NP-Completeness CPSC 320 2013W2 CPSC 320: NP-Completeness Up to now: We have been

CPSC 320: NP-Completeness CPSC 320 2013W2 CPSC 320: NP-Completeness Up to now: We have been learning recipes to design efficient algorithms. Every problem we looked at can be solved in O(n), or O(n log n), or O(n 2 ), or maybe O(n 3

739 views • 29 slides
11. Equality constrained minimization equality constrained minimization eliminating

11. Equality constrained minimization equality constrained minimization eliminating

Convex Optimization Boyd & Vandenberghe 11. Equality constrained minimization equality constrained minimization eliminating equality constraints Newtons method with equality constraints infeasible start Newton method

445 views • 19 slides
Polynomial Identity Testing Lemma Bipartite Matching References Anil Maheshwari

Polynomial Identity Testing Lemma Bipartite Matching References Anil Maheshwari

Polynomial Identity Testing Problems Schwartz-Zippel Polynomial Identity Testing Lemma Bipartite Matching References Anil Maheshwari anil@scs.carleton.ca School of Computer Science Carleton University Canada String Equality Testing

600 views • 18 slides
Identity Theft Identity Theft Identity theft occurs when your personal information is stolen

Identity Theft Identity Theft Identity theft occurs when your personal information is stolen

Identity Theft Identity Theft Identity theft occurs when your personal information is stolen and used without your knowledge to commit fraud or other crimes Identity theft can cost you time and money. Tips for Preventing Identity Theft

322 views • 10 slides
Section 4.2: Equivalence Relations What is equality? What is equivalence? Equality is

Section 4.2: Equivalence Relations What is equality? What is equivalence? Equality is

Section 4.2: Equivalence Relations What is equality? What is equivalence? Equality is more basic, fundamental concept. Every element in a set is equal only to itself. The basic equality relation {(x,x) | x S} We tend to assume

893 views • 61 slides
Equality: Are Some Equality: Are Some More Equal than than More Equal Others? Others? All

Equality: Are Some Equality: Are Some More Equal than than More Equal Others? Others? All

Equality: Are Some Equality: Are Some More Equal than than More Equal Others? Others? All animals are equal, but some animals are more equal than others. Orwell, G. (2004). Animal farm. New York: Signet. United States Bill of Rights

177 views • 13 slides
Public Sector Equality Duty for CCGs Tim Gunning and Joanna Owen About the Equality and Human

Public Sector Equality Duty for CCGs Tim Gunning and Joanna Owen About the Equality and Human

Public Sector Equality Duty for CCGs Tim Gunning and Joanna Owen About the Equality and Human Rights Commission (EHRC) Set up in October 2007. Merged the three previous equality commissions: the Commission for Racial Equality (CRE),

580 views • 34 slides
NL -completeness, NL = coNL Evgenij Thorstensen V18 Evgenij Thorstensen NL -completeness, NL =

NL -completeness, NL = coNL Evgenij Thorstensen V18 Evgenij Thorstensen NL -completeness, NL =

NL -completeness, NL = coNL Evgenij Thorstensen V18 Evgenij Thorstensen NL -completeness, NL = coNL V18 1 / 18 Logspace, recap Defined on machines that have an read-only input tape. In log space we can store a fixed number of pointers into

574 views • 21 slides
Equational theory / department of mathematics and computer science 4/11 A signature is a

Equational theory / department of mathematics and computer science 4/11 A signature is a

/ department of mathematics and computer science 3/11 PA3 PA2 PA1 axioms: equational theory. Defjnitions Equational theory / department of mathematics and computer science 4/11 A signature is a collection of symbols with an arity . Process

292 views • 3 slides
Lecture 3: Algebraic Effects II Gordon Plotkin Laboratory for the Foundations of Computer

Lecture 3: Algebraic Effects II Gordon Plotkin Laboratory for the Foundations of Computer

Algebra with parameterised operations Algebra with parameters and parametric arguments Algebraic operations and generic effects (cntnd.) Lecture 3: Algebraic Effects II Gordon Plotkin Laboratory for the Foundations of Computer Science, School

442 views • 33 slides
Some of my Favourite Open Problems in the Equational Logic of Processes Luca Aceto ICE-TCS,

Some of my Favourite Open Problems in the Equational Logic of Processes Luca Aceto ICE-TCS,

Introduction The General Setting A menagerie of open problems Call to arms Some of my Favourite Open Problems in the Equational Logic of Processes Luca Aceto ICE-TCS, School of Computer Science, Reykjavik University Open Problems in

713 views • 35 slides
E ffjc i e n t e n c o d i n g s o f fj r s t - o r d e r H o r n p

E ffjc i e n t e n c o d i n g s o f fj r s t - o r d e r H o r n p

E ffjc i e n t e n c o d i n g s o f fj r s t - o r d e r H o r n p r o b l e ms i n e q u a t i o n a l l o g i c K o e n C l a e s s e n N i c k S ma l l b o n e E q

474 views • 31 slides
Quantitative Algebraic Reasoning (an Overview) Giorgio Bacci Aalborg University, Denmark

Quantitative Algebraic Reasoning (an Overview) Giorgio Bacci Aalborg University, Denmark

Quantitative Algebraic Reasoning (an Overview) Giorgio Bacci Aalborg University, Denmark (invited talk, EXPRESS/SOS 2020 ) based on joint work with R. Mardare, P . Panangaden, G. Plotkin Why Algebraic Reasoning? Algebraic reasoning is

674 views • 43 slides
Institutions - Part 1 Institution Recap Closure Systems -Institutions Liam OReilly

Institutions - Part 1 Institution Recap Closure Systems -Institutions Liam OReilly

Institutions - Part 1 Liam OReilly Why Do We Need Institutions? Institutions Definition of Institutions Examples - EL Example - The CASL Institutions - Part 1 Institution Recap Closure Systems -Institutions Liam OReilly

749 views • 37 slides
Category Theory in Foundations of Computer Science Andrzej Tarlecki Institute of Informatics

Category Theory in Foundations of Computer Science Andrzej Tarlecki Institute of Informatics

(Universal Algebra and) Category Theory in Foundations of Computer Science Andrzej Tarlecki Institute of Informatics Faculty of Mathematics, Informatics and Mechanics University of Warsaw office: 4750 http://www.mimuw.edu.pl/~tarlecki

432 views • 41 slides
States and exceptions are dual effects Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse,

States and exceptions are dual effects Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse,

States and exceptions are dual effects Jean-Guillaume Dumas, Dominique Duval, Laurent Fousse, Jean-Claude Reynaud LJK, University of Grenoble August 29, 2010 Workshop on Categorical Logic in Brno (this is a long version of the talk presented

536 views • 49 slides

More recommend