uniform interpolation
play

Uniform Interpolation Part 1: Intuitionistic Logic George Metcalfe - PowerPoint PPT Presentation

Oct 13, 2023 •316 likes •1.71k views

Uniform Interpolation Part 1: Intuitionistic Logic George Metcalfe Mathematical Institute University of Bern BLAST 2018, University of Denver, 6-10 August 2018 George Metcalfe (University of Bern) Uniform Interpolation August 2018 1 / 30

  1. An Axiom System for Intuitionistic Logic Let us fix a language with connectives ∧ , ∨ , → , ⊥ , ⊤ and write T ⊢ IL α if a formula α is derivable from a set of formulas T using the axiom schema 1. α → ( β → α ) 2. ( α → ( β → γ )) → (( α → β ) → ( α → γ )) 3. ( α ∧ β ) → α 4. ( α ∧ β ) → β 5. α → ( β → ( α ∧ β )) 6. α → ( α ∨ β ) 7. β → ( α ∨ β ) 8. ( α → γ ) → (( β → γ ) → (( α ∨ β ) → γ )) 9. ⊥ → α 10. α → ⊤ together with the modus ponens rule: from α and α → β , infer β . George Metcalfe (University of Bern) Uniform Interpolation August 2018 9 / 30

  2. Heyting Algebras A Heyting algebra is an algebraic structure � A , ∧ , ∨ , → , ⊥ , ⊤� such that George Metcalfe (University of Bern) Uniform Interpolation August 2018 10 / 30

  3. Heyting Algebras A Heyting algebra is an algebraic structure � A , ∧ , ∨ , → , ⊥ , ⊤� such that (i) � A , ∧ , ∨ , ⊥ , ⊤� is a bounded lattice; George Metcalfe (University of Bern) Uniform Interpolation August 2018 10 / 30

  4. Heyting Algebras A Heyting algebra is an algebraic structure � A , ∧ , ∨ , → , ⊥ , ⊤� such that (i) � A , ∧ , ∨ , ⊥ , ⊤� is a bounded lattice; (ii) a ≤ b → c ⇐ ⇒ a ∧ b ≤ c for all a , b , c ∈ A . George Metcalfe (University of Bern) Uniform Interpolation August 2018 10 / 30

  5. Heyting Algebras A Heyting algebra is an algebraic structure � A , ∧ , ∨ , → , ⊥ , ⊤� such that (i) � A , ∧ , ∨ , ⊥ , ⊤� is a bounded lattice; (ii) a ≤ b → c ⇐ ⇒ a ∧ b ≤ c for all a , b , c ∈ A . The class HA of Heyting algebras forms a variety . George Metcalfe (University of Bern) Uniform Interpolation August 2018 10 / 30

  6. Heyting Algebras A Heyting algebra is an algebraic structure � A , ∧ , ∨ , → , ⊥ , ⊤� such that (i) � A , ∧ , ∨ , ⊥ , ⊤� is a bounded lattice; (ii) a ≤ b → c ⇐ ⇒ a ∧ b ≤ c for all a , b , c ∈ A . The class HA of Heyting algebras forms a variety . Examples: 1. any Boolean algebra; George Metcalfe (University of Bern) Uniform Interpolation August 2018 10 / 30

  7. Heyting Algebras A Heyting algebra is an algebraic structure � A , ∧ , ∨ , → , ⊥ , ⊤� such that (i) � A , ∧ , ∨ , ⊥ , ⊤� is a bounded lattice; (ii) a ≤ b → c ⇐ ⇒ a ∧ b ≤ c for all a , b , c ∈ A . The class HA of Heyting algebras forms a variety . Examples: 1. any Boolean algebra; 2. letting U be the set of upsets of a poset � X , ≤� , �U , ∩ , ∪ , → , ∅ , X � where Y → Z = { a ∈ X | a ≤ b ∈ Y ⇒ b ∈ Z } ; George Metcalfe (University of Bern) Uniform Interpolation August 2018 10 / 30

  8. Heyting Algebras A Heyting algebra is an algebraic structure � A , ∧ , ∨ , → , ⊥ , ⊤� such that (i) � A , ∧ , ∨ , ⊥ , ⊤� is a bounded lattice; (ii) a ≤ b → c ⇐ ⇒ a ∧ b ≤ c for all a , b , c ∈ A . The class HA of Heyting algebras forms a variety . Examples: 1. any Boolean algebra; 2. letting U be the set of upsets of a poset � X , ≤� , �U , ∩ , ∪ , → , ∅ , X � where Y → Z = { a ∈ X | a ≤ b ∈ Y ⇒ b ∈ Z } ; 3. letting O be the set of open subsets of R with the usual topology, �O , ∩ , ∪ , → , ∅ , R � where Y → Z = int ( Y c ∪ Z ) . George Metcalfe (University of Bern) Uniform Interpolation August 2018 10 / 30

  9. Equational Consequence For any set of equations Σ ∪ { α ≈ β } over the language of Heyting algebras with variables in x , we write Σ | = HA α ≈ β George Metcalfe (University of Bern) Uniform Interpolation August 2018 11 / 30

  10. Equational Consequence For any set of equations Σ ∪ { α ≈ β } over the language of Heyting algebras with variables in x , we write Σ | = HA α ≈ β if for any homomorphism e from the term algebra over x to some A ∈ HA , e ( γ ) = e ( δ ) for all γ ≈ δ ∈ Σ = ⇒ e ( α ) = e ( β ) . George Metcalfe (University of Bern) Uniform Interpolation August 2018 11 / 30

  11. Equivalence Theorem HA is an equivalent algebraic semantics for IL George Metcalfe (University of Bern) Uniform Interpolation August 2018 12 / 30

  12. Equivalence Theorem HA is an equivalent algebraic semantics for IL with transformers τ ( α ) = α ≈ ⊤ and ρ ( α ≈ β ) = ( α → β ) ∧ ( β → α ) . George Metcalfe (University of Bern) Uniform Interpolation August 2018 12 / 30

  13. Equivalence Theorem HA is an equivalent algebraic semantics for IL with transformers τ ( α ) = α ≈ ⊤ and ρ ( α ≈ β ) = ( α → β ) ∧ ( β → α ) . (a) For any set of formulas T ∪ { α } , T ⊢ IL α ⇐ ⇒ τ [ T ] | = HA τ ( α ) . George Metcalfe (University of Bern) Uniform Interpolation August 2018 12 / 30

  14. Equivalence Theorem HA is an equivalent algebraic semantics for IL with transformers τ ( α ) = α ≈ ⊤ and ρ ( α ≈ β ) = ( α → β ) ∧ ( β → α ) . (a) For any set of formulas T ∪ { α } , T ⊢ IL α ⇐ ⇒ τ [ T ] | = HA τ ( α ) . (b) For any set of equations Σ ∪ { α ≈ β } , Σ | = HA α ≈ β ⇐ ⇒ ρ [ T ] ⊢ IL ρ ( α ≈ β ) . George Metcalfe (University of Bern) Uniform Interpolation August 2018 12 / 30

  15. Equivalence Theorem HA is an equivalent algebraic semantics for IL with transformers τ ( α ) = α ≈ ⊤ and ρ ( α ≈ β ) = ( α → β ) ∧ ( β → α ) . (a) For any set of formulas T ∪ { α } , T ⊢ IL α ⇐ ⇒ τ [ T ] | = HA τ ( α ) . (b) For any set of equations Σ ∪ { α ≈ β } , Σ | = HA α ≈ β ⇐ ⇒ ρ [ T ] ⊢ IL ρ ( α ≈ β ) . (c) α ⊢ IL ρ ( τ ( α )) and ρ ( τ ( α )) ⊢ IL α . George Metcalfe (University of Bern) Uniform Interpolation August 2018 12 / 30

  16. Equivalence Theorem HA is an equivalent algebraic semantics for IL with transformers τ ( α ) = α ≈ ⊤ and ρ ( α ≈ β ) = ( α → β ) ∧ ( β → α ) . (a) For any set of formulas T ∪ { α } , T ⊢ IL α ⇐ ⇒ τ [ T ] | = HA τ ( α ) . (b) For any set of equations Σ ∪ { α ≈ β } , Σ | = HA α ≈ β ⇐ ⇒ ρ [ T ] ⊢ IL ρ ( α ≈ β ) . (c) α ⊢ IL ρ ( τ ( α )) and ρ ( τ ( α )) ⊢ IL α . (d) α ≈ β | = HA τ ( ρ ( α ≈ β )) and τ ( ρ ( α ≈ β )) | = HA α ≈ β . George Metcalfe (University of Bern) Uniform Interpolation August 2018 12 / 30

  17. Sequents A sequent is an ordered pair consisting of a finite multiset of formulas Γ and a formula α , written Γ ⇒ α. George Metcalfe (University of Bern) Uniform Interpolation August 2018 13 / 30

  18. Sequents A sequent is an ordered pair consisting of a finite multiset of formulas Γ and a formula α , written Γ ⇒ α. We typically write Γ , Π for the multiset sum of Γ and Π , and omit brackets. George Metcalfe (University of Bern) Uniform Interpolation August 2018 13 / 30

  19. Sequents A sequent is an ordered pair consisting of a finite multiset of formulas Γ and a formula α , written Γ ⇒ α. We typically write Γ , Π for the multiset sum of Γ and Π , and omit brackets. A sequent calculus GL consists of a set of rules with instances S 1 . . . S n where S , S 1 , . . . , S n are sequents S George Metcalfe (University of Bern) Uniform Interpolation August 2018 13 / 30

  20. Sequents A sequent is an ordered pair consisting of a finite multiset of formulas Γ and a formula α , written Γ ⇒ α. We typically write Γ , Π for the multiset sum of Γ and Π , and omit brackets. A sequent calculus GL consists of a set of rules with instances S 1 . . . S n where S , S 1 , . . . , S n are sequents S A GL -derivation of a sequent S is a finite tree of sequents with root S built using the rules of GL; if such a derivation exists, we write ⊢ GL S . George Metcalfe (University of Bern) Uniform Interpolation August 2018 13 / 30

  21. A Sequent Calculus GIL for Intuitionistic Logic Identity Axioms ( id ) Γ , α ⇒ α George Metcalfe (University of Bern) Uniform Interpolation August 2018 14 / 30

  22. A Sequent Calculus GIL for Intuitionistic Logic Identity Axioms ( id ) Γ , α ⇒ α Left Operation Rules Right Operation Rules ( ⊥⇒ ) ( ⇒⊤ ) Γ , ⊥ ⇒ δ Γ ⇒ ⊤ George Metcalfe (University of Bern) Uniform Interpolation August 2018 14 / 30

  23. A Sequent Calculus GIL for Intuitionistic Logic Identity Axioms ( id ) Γ , α ⇒ α Left Operation Rules Right Operation Rules ( ⊥⇒ ) ( ⇒⊤ ) Γ , ⊥ ⇒ δ Γ ⇒ ⊤ Γ , α, β ⇒ δ Γ ⇒ α Γ ⇒ β ( ∧⇒ ) ( ⇒∧ ) Γ , α ∧ β ⇒ δ Γ ⇒ α ∧ β George Metcalfe (University of Bern) Uniform Interpolation August 2018 14 / 30

  24. A Sequent Calculus GIL for Intuitionistic Logic Identity Axioms ( id ) Γ , α ⇒ α Left Operation Rules Right Operation Rules ( ⊥⇒ ) ( ⇒⊤ ) Γ , ⊥ ⇒ δ Γ ⇒ ⊤ Γ , α, β ⇒ δ Γ ⇒ α Γ ⇒ β ( ∧⇒ ) ( ⇒∧ ) Γ , α ∧ β ⇒ δ Γ ⇒ α ∧ β Γ , α ⇒ δ Γ , β ⇒ δ Γ ⇒ β Γ ⇒ α ( ∨⇒ ) ( ⇒∨ ) l ( ⇒∨ ) r Γ , α ∨ β ⇒ δ Γ ⇒ α ∨ β Γ ⇒ α ∨ β George Metcalfe (University of Bern) Uniform Interpolation August 2018 14 / 30

  25. A Sequent Calculus GIL for Intuitionistic Logic Identity Axioms ( id ) Γ , α ⇒ α Left Operation Rules Right Operation Rules ( ⊥⇒ ) ( ⇒⊤ ) Γ , ⊥ ⇒ δ Γ ⇒ ⊤ Γ , α, β ⇒ δ Γ ⇒ α Γ ⇒ β ( ∧⇒ ) ( ⇒∧ ) Γ , α ∧ β ⇒ δ Γ ⇒ α ∧ β Γ , α ⇒ δ Γ , β ⇒ δ Γ ⇒ β Γ ⇒ α ( ∨⇒ ) ( ⇒∨ ) l ( ⇒∨ ) r Γ , α ∨ β ⇒ δ Γ ⇒ α ∨ β Γ ⇒ α ∨ β Γ , α → β ⇒ α Γ , β ⇒ δ Γ , α ⇒ β ( →⇒ ) ( ⇒→ ) Γ , α → β ⇒ δ Γ ⇒ α → β George Metcalfe (University of Bern) Uniform Interpolation August 2018 14 / 30

  26. A Sequent Calculus GIL for Intuitionistic Logic Identity Axioms Cut Rule Γ ⇒ α Π , α ⇒ δ ( id ) (cut) Γ , α ⇒ α Γ , Π ⇒ δ Left Operation Rules Right Operation Rules ( ⊥⇒ ) ( ⇒⊤ ) Γ , ⊥ ⇒ δ Γ ⇒ ⊤ Γ , α, β ⇒ δ Γ ⇒ α Γ ⇒ β ( ∧⇒ ) ( ⇒∧ ) Γ , α ∧ β ⇒ δ Γ ⇒ α ∧ β Γ , α ⇒ δ Γ , β ⇒ δ Γ ⇒ β Γ ⇒ α ( ∨⇒ ) ( ⇒∨ ) l ( ⇒∨ ) r Γ , α ∨ β ⇒ δ Γ ⇒ α ∨ β Γ ⇒ α ∨ β Γ , α → β ⇒ α Γ , β ⇒ δ Γ , α ⇒ β ( →⇒ ) ( ⇒→ ) Γ , α → β ⇒ δ Γ ⇒ α → β George Metcalfe (University of Bern) Uniform Interpolation August 2018 14 / 30

  27. An Example Derivation ( ⇒→ ) ⇒ (( α → β ) ∧ ( α ∨ γ )) → ( β ∨ γ ) George Metcalfe (University of Bern) Uniform Interpolation August 2018 15 / 30

  28. An Example Derivation ( ∧⇒ ) ( α → β ) ∧ ( α ∨ γ ) ⇒ β ∨ γ ( ⇒→ ) ⇒ (( α → β ) ∧ ( α ∨ γ )) → ( β ∨ γ ) George Metcalfe (University of Bern) Uniform Interpolation August 2018 15 / 30

  29. An Example Derivation ( ∨⇒ ) α → β, α ∨ γ ⇒ β ∨ γ ( ∧⇒ ) ( α → β ) ∧ ( α ∨ γ ) ⇒ β ∨ γ ( ⇒→ ) ⇒ (( α → β ) ∧ ( α ∨ γ )) → ( β ∨ γ ) George Metcalfe (University of Bern) Uniform Interpolation August 2018 15 / 30

  30. An Example Derivation ( →⇒ ) α → β, α ⇒ β ∨ γ ( ∨⇒ ) α → β, α ∨ γ ⇒ β ∨ γ ( ∧⇒ ) ( α → β ) ∧ ( α ∨ γ ) ⇒ β ∨ γ ( ⇒→ ) ⇒ (( α → β ) ∧ ( α ∨ γ )) → ( β ∨ γ ) George Metcalfe (University of Bern) Uniform Interpolation August 2018 15 / 30

  31. An Example Derivation ( id ) α → β, α ⇒ α ( →⇒ ) α → β, α ⇒ β ∨ γ ( ∨⇒ ) α → β, α ∨ γ ⇒ β ∨ γ ( ∧⇒ ) ( α → β ) ∧ ( α ∨ γ ) ⇒ β ∨ γ ( ⇒→ ) ⇒ (( α → β ) ∧ ( α ∨ γ )) → ( β ∨ γ ) George Metcalfe (University of Bern) Uniform Interpolation August 2018 15 / 30

  32. An Example Derivation ( id ) ( ⇒∨ ) l α → β, α ⇒ α β, α ⇒ β ∨ γ ( →⇒ ) α → β, α ⇒ β ∨ γ ( ∨⇒ ) α → β, α ∨ γ ⇒ β ∨ γ ( ∧⇒ ) ( α → β ) ∧ ( α ∨ γ ) ⇒ β ∨ γ ( ⇒→ ) ⇒ (( α → β ) ∧ ( α ∨ γ )) → ( β ∨ γ ) George Metcalfe (University of Bern) Uniform Interpolation August 2018 15 / 30

  33. An Example Derivation ( id ) β, α ⇒ β ( id ) ( ⇒∨ ) l α → β, α ⇒ α β, α ⇒ β ∨ γ ( →⇒ ) α → β, α ⇒ β ∨ γ ( ∨⇒ ) α → β, α ∨ γ ⇒ β ∨ γ ( ∧⇒ ) ( α → β ) ∧ ( α ∨ γ ) ⇒ β ∨ γ ( ⇒→ ) ⇒ (( α → β ) ∧ ( α ∨ γ )) → ( β ∨ γ ) George Metcalfe (University of Bern) Uniform Interpolation August 2018 15 / 30

  34. An Example Derivation ( id ) β, α ⇒ β ( id ) ( ⇒∨ ) l α → β, α ⇒ α β, α ⇒ β ∨ γ ( →⇒ ) ( ⇒∨ ) r α → β, α ⇒ β ∨ γ α → β, γ ⇒ β ∨ γ ( ∨⇒ ) α → β, α ∨ γ ⇒ β ∨ γ ( ∧⇒ ) ( α → β ) ∧ ( α ∨ γ ) ⇒ β ∨ γ ( ⇒→ ) ⇒ (( α → β ) ∧ ( α ∨ γ )) → ( β ∨ γ ) George Metcalfe (University of Bern) Uniform Interpolation August 2018 15 / 30

  35. An Example Derivation ( id ) β, α ⇒ β ( id ) ( ⇒∨ ) l ( id ) α → β, α ⇒ α β, α ⇒ β ∨ γ α → β, γ ⇒ γ ( →⇒ ) ( ⇒∨ ) r α → β, α ⇒ β ∨ γ α → β, γ ⇒ β ∨ γ ( ∨⇒ ) α → β, α ∨ γ ⇒ β ∨ γ ( ∧⇒ ) ( α → β ) ∧ ( α ∨ γ ) ⇒ β ∨ γ ( ⇒→ ) ⇒ (( α → β ) ∧ ( α ∨ γ )) → ( β ∨ γ ) George Metcalfe (University of Bern) Uniform Interpolation August 2018 15 / 30

  36. Soundness and Completeness Theorem For any formulas α 1 , . . . , α n , β : ⊢ GIL α 1 , . . . , α n ⇒ β ⇐ ⇒ { α 1 , . . . , α n } ⊢ IL β. George Metcalfe (University of Bern) Uniform Interpolation August 2018 16 / 30

  37. Soundness and Completeness Theorem For any formulas α 1 , . . . , α n , β : ⊢ GIL α 1 , . . . , α n ⇒ β ⇐ ⇒ { α 1 , . . . , α n } ⊢ IL β. Proof. ( ⇒ ) It suffices to check that the rules of GIL preserve derivability in IL, e.g., Γ ∪ { α } ⊢ IL δ and Γ ∪ { β } ⊢ IL δ = ⇒ Γ ∪ { α ∨ β } ⊢ IL δ. George Metcalfe (University of Bern) Uniform Interpolation August 2018 16 / 30

  38. Soundness and Completeness Theorem For any formulas α 1 , . . . , α n , β : ⊢ GIL α 1 , . . . , α n ⇒ β ⇐ ⇒ { α 1 , . . . , α n } ⊢ IL β. Proof. ( ⇒ ) It suffices to check that the rules of GIL preserve derivability in IL, e.g., Γ ∪ { α } ⊢ IL δ and Γ ∪ { β } ⊢ IL δ = ⇒ Γ ∪ { α ∨ β } ⊢ IL δ. ( ⇐ ) It suffices to check that the axioms of IL are GIL-derivable and that (using the cut rule!) modus ponens preserves GIL-derivability. George Metcalfe (University of Bern) Uniform Interpolation August 2018 16 / 30

  39. Cut Elimination Theorem (Gentzen 1935) Any GIL -derivable sequent is cut-free GIL -derivable. George Metcalfe (University of Bern) Uniform Interpolation August 2018 17 / 30

  40. Cut Elimination Theorem (Gentzen 1935) Any GIL -derivable sequent is cut-free GIL -derivable. Proof idea. We push uppermost cuts upwards in GIL-derivations until they reach axioms and disappear, e.g.. . . George Metcalfe (University of Bern) Uniform Interpolation August 2018 17 / 30

  41. Cut Elimination Theorem (Gentzen 1935) Any GIL -derivable sequent is cut-free GIL -derivable. Proof idea. We push uppermost cuts upwards in GIL-derivations until they reach axioms and disappear, e.g.. . . . . . Π , δ ⇒ δ ( id ) Γ ⇒ δ (cut) Γ , Π ⇒ δ George Metcalfe (University of Bern) Uniform Interpolation August 2018 17 / 30

  42. Cut Elimination Theorem (Gentzen 1935) Any GIL -derivable sequent is cut-free GIL -derivable. Proof idea. We push uppermost cuts upwards in GIL-derivations until they reach axioms and disappear, e.g.. . . . . . . . Π , δ ⇒ δ ( id ) ⇒ = . Γ ⇒ δ (cut) Γ , Π ⇒ δ Γ , Π ⇒ δ George Metcalfe (University of Bern) Uniform Interpolation August 2018 17 / 30

  43. Cut Elimination Theorem (Gentzen 1935) Any GIL -derivable sequent is cut-free GIL -derivable. Proof idea. We push uppermost cuts upwards in GIL-derivations until they reach axioms and disappear, e.g.. . . . . . . . Π , δ ⇒ δ ( id ) ⇒ = . Γ ⇒ δ (cut) Γ , Π ⇒ δ Γ , Π ⇒ δ . . . . . . . . . Π , α ⇒ δ Π , β ⇒ δ Γ ⇒ α Γ ⇒ α ∨ β ( ⇒∨ ) l ( ∨⇒ ) Π , α ∨ β ⇒ δ (cut) Γ , Π ⇒ δ George Metcalfe (University of Bern) Uniform Interpolation August 2018 17 / 30

  44. Cut Elimination Theorem (Gentzen 1935) Any GIL -derivable sequent is cut-free GIL -derivable. Proof idea. We push uppermost cuts upwards in GIL-derivations until they reach axioms and disappear, e.g.. . . . . . . . Π , δ ⇒ δ ( id ) ⇒ = . Γ ⇒ δ (cut) Γ , Π ⇒ δ Γ , Π ⇒ δ . . . . . . . . . . . . . . . Π , α ⇒ δ Π , β ⇒ δ = ⇒ Γ ⇒ α Γ ⇒ α ∨ β ( ⇒∨ ) l ( ∨⇒ ) Γ ⇒ α Π , α ⇒ δ Π , α ∨ β ⇒ δ (cut) (cut) Γ , Π ⇒ δ Γ , Π ⇒ δ George Metcalfe (University of Bern) Uniform Interpolation August 2018 17 / 30

  45. Cut Elimination Theorem (Gentzen 1935) Any GIL -derivable sequent is cut-free GIL -derivable. Proof idea. We push uppermost cuts upwards in GIL-derivations until they reach axioms and disappear, e.g.. . . . . . . . Π , δ ⇒ δ ( id ) ⇒ = . Γ ⇒ δ (cut) Γ , Π ⇒ δ Γ , Π ⇒ δ . . . . . . . . . . . . . . . Π , α ⇒ δ Π , β ⇒ δ = ⇒ Γ ⇒ α Γ ⇒ α ∨ β ( ⇒∨ ) l ( ∨⇒ ) Γ ⇒ α Π , α ⇒ δ Π , α ∨ β ⇒ δ (cut) (cut) Γ , Π ⇒ δ Γ , Π ⇒ δ Corollary (Gentzen 1935) Intuitionistic propositional logic is decidable. George Metcalfe (University of Bern) Uniform Interpolation August 2018 17 / 30

  46. Craig Interpolation for Intuitionistic Logic Theorem (Schütte 1962) If α ( x , y ) and β ( y , z ) are formulas such that α ⊢ IL β , then there exists a formula γ ( y ) such that α ⊢ IL γ and γ ⊢ IL β . George Metcalfe (University of Bern) Uniform Interpolation August 2018 18 / 30

  47. Craig Interpolation for Intuitionistic Logic Theorem (Schütte 1962) If α ( x , y ) and β ( y , z ) are formulas such that α ⊢ IL β , then there exists a formula γ ( y ) such that α ⊢ IL γ and γ ⊢ IL β . Proof Idea. We prove that for any sequent Σ( x , y ) , Π( y , z ) ⇒ δ ( y , z ) , George Metcalfe (University of Bern) Uniform Interpolation August 2018 18 / 30

  48. Craig Interpolation for Intuitionistic Logic Theorem (Schütte 1962) If α ( x , y ) and β ( y , z ) are formulas such that α ⊢ IL β , then there exists a formula γ ( y ) such that α ⊢ IL γ and γ ⊢ IL β . Proof Idea. We prove that for any sequent Σ( x , y ) , Π( y , z ) ⇒ δ ( y , z ) , there exists a formula γ ( y ) such that ⊢ GIL Σ , Π ⇒ δ = ⇒ ⊢ GIL Σ ⇒ γ and ⊢ GIL Π , γ ⇒ δ, George Metcalfe (University of Bern) Uniform Interpolation August 2018 18 / 30

  49. Craig Interpolation for Intuitionistic Logic Theorem (Schütte 1962) If α ( x , y ) and β ( y , z ) are formulas such that α ⊢ IL β , then there exists a formula γ ( y ) such that α ⊢ IL γ and γ ⊢ IL β . Proof Idea. We prove that for any sequent Σ( x , y ) , Π( y , z ) ⇒ δ ( y , z ) , there exists a formula γ ( y ) such that ⊢ GIL Σ , Π ⇒ δ = ⇒ ⊢ GIL Σ ⇒ γ and ⊢ GIL Π , γ ⇒ δ, by induction on the height of a cut-free GIL-derivation of Σ , Π ⇒ δ . George Metcalfe (University of Bern) Uniform Interpolation August 2018 18 / 30

  50. Craig Interpolation for Intuitionistic Logic Theorem (Schütte 1962) If α ( x , y ) and β ( y , z ) are formulas such that α ⊢ IL β , then there exists a formula γ ( y ) such that α ⊢ IL γ and γ ⊢ IL β . Proof Idea. We prove that for any sequent Σ( x , y ) , Π( y , z ) ⇒ δ ( y , z ) , there exists a formula γ ( y ) such that ⊢ GIL Σ , Π ⇒ δ = ⇒ ⊢ GIL Σ ⇒ γ and ⊢ GIL Π , γ ⇒ δ, by induction on the height of a cut-free GIL-derivation of Σ , Π ⇒ δ . Base case. E.g., if δ ∈ Σ , let γ = δ ; George Metcalfe (University of Bern) Uniform Interpolation August 2018 18 / 30

  51. Craig Interpolation for Intuitionistic Logic Theorem (Schütte 1962) If α ( x , y ) and β ( y , z ) are formulas such that α ⊢ IL β , then there exists a formula γ ( y ) such that α ⊢ IL γ and γ ⊢ IL β . Proof Idea. We prove that for any sequent Σ( x , y ) , Π( y , z ) ⇒ δ ( y , z ) , there exists a formula γ ( y ) such that ⊢ GIL Σ , Π ⇒ δ = ⇒ ⊢ GIL Σ ⇒ γ and ⊢ GIL Π , γ ⇒ δ, by induction on the height of a cut-free GIL-derivation of Σ , Π ⇒ δ . Base case. E.g., if δ ∈ Σ , let γ = δ ; if δ ∈ Π , let γ = ⊤ . George Metcalfe (University of Bern) Uniform Interpolation August 2018 18 / 30

  52. Craig Interpolation for Intuitionistic Logic Inductive step. E.g., if Σ is Σ ′ , α → β and the derivation ends with . . . . . . Σ ′ , α → β, Π ⇒ α Σ ′ , β, Π ⇒ δ ( →⇒ ) Σ ′ , α → β, Π ⇒ δ George Metcalfe (University of Bern) Uniform Interpolation August 2018 19 / 30

  53. Craig Interpolation for Intuitionistic Logic Inductive step. E.g., if Σ is Σ ′ , α → β and the derivation ends with . . . . . . Σ ′ , α → β, Π ⇒ α Σ ′ , β, Π ⇒ δ ( →⇒ ) Σ ′ , α → β, Π ⇒ δ then by the induction hypothesis twice, there exist formulas γ 1 ( y ) , γ 2 ( y ) such that the following sequents are GIL-derivable: George Metcalfe (University of Bern) Uniform Interpolation August 2018 19 / 30

  54. Craig Interpolation for Intuitionistic Logic Inductive step. E.g., if Σ is Σ ′ , α → β and the derivation ends with . . . . . . Σ ′ , α → β, Π ⇒ α Σ ′ , β, Π ⇒ δ ( →⇒ ) Σ ′ , α → β, Π ⇒ δ then by the induction hypothesis twice, there exist formulas γ 1 ( y ) , γ 2 ( y ) such that the following sequents are GIL-derivable: Σ ′ , α → β, γ 1 ⇒ α ; Π ⇒ γ 1 ; George Metcalfe (University of Bern) Uniform Interpolation August 2018 19 / 30

  55. Craig Interpolation for Intuitionistic Logic Inductive step. E.g., if Σ is Σ ′ , α → β and the derivation ends with . . . . . . Σ ′ , α → β, Π ⇒ α Σ ′ , β, Π ⇒ δ ( →⇒ ) Σ ′ , α → β, Π ⇒ δ then by the induction hypothesis twice, there exist formulas γ 1 ( y ) , γ 2 ( y ) such that the following sequents are GIL-derivable: Σ ′ , α → β, γ 1 ⇒ α ; Σ ′ , β ⇒ γ 2 ; Π ⇒ γ 1 ; and Π , γ 2 ⇒ δ. George Metcalfe (University of Bern) Uniform Interpolation August 2018 19 / 30

  56. Craig Interpolation for Intuitionistic Logic Inductive step. E.g., if Σ is Σ ′ , α → β and the derivation ends with . . . . . . Σ ′ , α → β, Π ⇒ α Σ ′ , β, Π ⇒ δ ( →⇒ ) Σ ′ , α → β, Π ⇒ δ then by the induction hypothesis twice, there exist formulas γ 1 ( y ) , γ 2 ( y ) such that the following sequents are GIL-derivable: Σ ′ , α → β, γ 1 ⇒ α ; Σ ′ , β ⇒ γ 2 ; Π ⇒ γ 1 ; and Π , γ 2 ⇒ δ. We obtain an interpolant γ 1 → γ 2 with derivations ending with George Metcalfe (University of Bern) Uniform Interpolation August 2018 19 / 30

  57. Craig Interpolation for Intuitionistic Logic Inductive step. E.g., if Σ is Σ ′ , α → β and the derivation ends with . . . . . . Σ ′ , α → β, Π ⇒ α Σ ′ , β, Π ⇒ δ ( →⇒ ) Σ ′ , α → β, Π ⇒ δ then by the induction hypothesis twice, there exist formulas γ 1 ( y ) , γ 2 ( y ) such that the following sequents are GIL-derivable: Σ ′ , α → β, γ 1 ⇒ α ; Σ ′ , β ⇒ γ 2 ; Π ⇒ γ 1 ; and Π , γ 2 ⇒ δ. We obtain an interpolant γ 1 → γ 2 with derivations ending with . . . . . . Σ ′ , α → β, γ 1 ⇒ α Σ ′ , β, γ 1 ⇒ γ 2 ( →⇒ ) Σ ′ , α → β, γ 1 ⇒ γ 2 ( ⇒→ ) Σ ′ , α → β ⇒ γ 1 → γ 2 George Metcalfe (University of Bern) Uniform Interpolation August 2018 19 / 30

  58. Craig Interpolation for Intuitionistic Logic Inductive step. E.g., if Σ is Σ ′ , α → β and the derivation ends with . . . . . . Σ ′ , α → β, Π ⇒ α Σ ′ , β, Π ⇒ δ ( →⇒ ) Σ ′ , α → β, Π ⇒ δ then by the induction hypothesis twice, there exist formulas γ 1 ( y ) , γ 2 ( y ) such that the following sequents are GIL-derivable: Σ ′ , α → β, γ 1 ⇒ α ; Σ ′ , β ⇒ γ 2 ; Π ⇒ γ 1 ; and Π , γ 2 ⇒ δ. We obtain an interpolant γ 1 → γ 2 with derivations ending with . . . . . . . . Σ ′ , α → β, γ 1 ⇒ α Σ ′ , β, γ 1 ⇒ γ 2 . . . . ( →⇒ ) Σ ′ , α → β, γ 1 ⇒ γ 2 Π , γ 1 → γ 2 ⇒ γ 1 Π , γ 2 ⇒ δ ( ⇒→ ) ( →⇒ ) Σ ′ , α → β ⇒ γ 1 → γ 2 Π , γ 1 → γ 2 ⇒ δ George Metcalfe (University of Bern) Uniform Interpolation August 2018 19 / 30

  59. An Algebraic Consequence Corollary (Day 1972) HA admits the amalgamation property ; George Metcalfe (University of Bern) Uniform Interpolation August 2018 20 / 30

  60. An Algebraic Consequence B 1 A 1 2 B 2 Corollary (Day 1972) HA admits the amalgamation property ; that is, for any A , B 1 , B 2 ∈ HA , and embeddings σ 1 : A → B 1 , σ 2 : A → B 2 , George Metcalfe (University of Bern) Uniform Interpolation August 2018 20 / 30

  61. An Algebraic Consequence B 1 C A 1 2 B 2 Corollary (Day 1972) HA admits the amalgamation property ; that is, for any A , B 1 , B 2 ∈ HA , and embeddings σ 1 : A → B 1 , σ 2 : A → B 2 , there exist C ∈ HA George Metcalfe (University of Bern) Uniform Interpolation August 2018 20 / 30

  62. An Algebraic Consequence B 1 C A 1 ! 1 2 ! 2 B 2 Corollary (Day 1972) HA admits the amalgamation property ; that is, for any A , B 1 , B 2 ∈ HA , and embeddings σ 1 : A → B 1 , σ 2 : A → B 2 , there exist C ∈ HA and embeddings τ 1 : B 1 → C and τ 2 : B 2 → C George Metcalfe (University of Bern) Uniform Interpolation August 2018 20 / 30

  63. An Algebraic Consequence B 1 C A 1 ! 1 2 ! 2 B 2 Corollary (Day 1972) HA admits the amalgamation property ; that is, for any A , B 1 , B 2 ∈ HA , and embeddings σ 1 : A → B 1 , σ 2 : A → B 2 , there exist C ∈ HA and embeddings τ 1 : B 1 → C and τ 2 : B 2 → C such that τ 1 σ 1 = τ 2 σ 2 . George Metcalfe (University of Bern) Uniform Interpolation August 2018 20 / 30

  64. Uniform Interpolation in Intuitionistic Logic Theorem (Pitts 1992) For any formula α ( x , y ) of intuitionistic propositional logic, there exist formulas α L ( y ) and α R ( y ) A.M. Pitts. On an interpretation of second-order quantification in first-order intuitionistic propositional logic. Journal of Symbolic Logic 57 (1992), 33–52. George Metcalfe (University of Bern) Uniform Interpolation August 2018 21 / 30

  65. Uniform Interpolation in Intuitionistic Logic Theorem (Pitts 1992) For any formula α ( x , y ) of intuitionistic propositional logic, there exist formulas α L ( y ) and α R ( y ) such that for any formula β ( y , z ) , α R ( y ) ⊢ IL β ( y , z ) α ( x , y ) ⊢ IL β ( y , z ) ⇐ ⇒ A.M. Pitts. On an interpretation of second-order quantification in first-order intuitionistic propositional logic. Journal of Symbolic Logic 57 (1992), 33–52. George Metcalfe (University of Bern) Uniform Interpolation August 2018 21 / 30

  66. Uniform Interpolation in Intuitionistic Logic Theorem (Pitts 1992) For any formula α ( x , y ) of intuitionistic propositional logic, there exist formulas α L ( y ) and α R ( y ) such that for any formula β ( y , z ) , α R ( y ) ⊢ IL β ( y , z ) α ( x , y ) ⊢ IL β ( y , z ) ⇐ ⇒ β ( y , z ) ⊢ IL α L ( y ) . β ( y , z ) ⊢ IL α ( x , y ) ⇐ ⇒ A.M. Pitts. On an interpretation of second-order quantification in first-order intuitionistic propositional logic. Journal of Symbolic Logic 57 (1992), 33–52. George Metcalfe (University of Bern) Uniform Interpolation August 2018 21 / 30

  67. A Terminating Sequent Calculus We obtain a terminating sequent calculus GIL ∗ for intuitionistic logic George Metcalfe (University of Bern) Uniform Interpolation August 2018 22 / 30

  68. A Terminating Sequent Calculus We obtain a terminating sequent calculus GIL ∗ for intuitionistic logic by removing the cut rule from GIL and replacing the implication left rule Γ , α → β ⇒ α Γ , β ⇒ δ ( →⇒ ) Γ , α → β ⇒ δ George Metcalfe (University of Bern) Uniform Interpolation August 2018 22 / 30

  69. A Terminating Sequent Calculus We obtain a terminating sequent calculus GIL ∗ for intuitionistic logic by removing the cut rule from GIL and replacing the implication left rule Γ , α → β ⇒ α Γ , β ⇒ δ ( →⇒ ) Γ , α → β ⇒ δ with the decomposition rules Γ ⇒ δ Γ , ⊥ → β ⇒ δ George Metcalfe (University of Bern) Uniform Interpolation August 2018 22 / 30

  70. A Terminating Sequent Calculus We obtain a terminating sequent calculus GIL ∗ for intuitionistic logic by removing the cut rule from GIL and replacing the implication left rule Γ , α → β ⇒ α Γ , β ⇒ δ ( →⇒ ) Γ , α → β ⇒ δ with the decomposition rules Γ , x , β ⇒ δ Γ ⇒ δ Γ , ⊥ → β ⇒ δ Γ , x , x → β ⇒ δ George Metcalfe (University of Bern) Uniform Interpolation August 2018 22 / 30

  71. A Terminating Sequent Calculus We obtain a terminating sequent calculus GIL ∗ for intuitionistic logic by removing the cut rule from GIL and replacing the implication left rule Γ , α → β ⇒ α Γ , β ⇒ δ ( →⇒ ) Γ , α → β ⇒ δ with the decomposition rules Γ , α 1 → ( α 2 → β ) ⇒ δ Γ , x , β ⇒ δ Γ ⇒ δ Γ , ⊥ → β ⇒ δ Γ , x , x → β ⇒ δ Γ , ( α 1 ∧ α 2 ) → β ⇒ δ George Metcalfe (University of Bern) Uniform Interpolation August 2018 22 / 30

  72. A Terminating Sequent Calculus We obtain a terminating sequent calculus GIL ∗ for intuitionistic logic by removing the cut rule from GIL and replacing the implication left rule Γ , α → β ⇒ α Γ , β ⇒ δ ( →⇒ ) Γ , α → β ⇒ δ with the decomposition rules Γ , α 1 → ( α 2 → β ) ⇒ δ Γ , x , β ⇒ δ Γ ⇒ δ Γ , ⊥ → β ⇒ δ Γ , x , x → β ⇒ δ Γ , ( α 1 ∧ α 2 ) → β ⇒ δ Γ , β ⇒ δ Γ , ⊤ → β ⇒ δ George Metcalfe (University of Bern) Uniform Interpolation August 2018 22 / 30

  73. A Terminating Sequent Calculus We obtain a terminating sequent calculus GIL ∗ for intuitionistic logic by removing the cut rule from GIL and replacing the implication left rule Γ , α → β ⇒ α Γ , β ⇒ δ ( →⇒ ) Γ , α → β ⇒ δ with the decomposition rules Γ , α 1 → ( α 2 → β ) ⇒ δ Γ , x , β ⇒ δ Γ ⇒ δ Γ , ⊥ → β ⇒ δ Γ , x , x → β ⇒ δ Γ , ( α 1 ∧ α 2 ) → β ⇒ δ Γ , β ⇒ δ Γ , α 1 → β, α 2 → β ⇒ δ Γ , ⊤ → β ⇒ δ Γ , ( α 1 ∨ α 2 ) → β ⇒ δ George Metcalfe (University of Bern) Uniform Interpolation August 2018 22 / 30

  74. A Terminating Sequent Calculus We obtain a terminating sequent calculus GIL ∗ for intuitionistic logic by removing the cut rule from GIL and replacing the implication left rule Γ , α → β ⇒ α Γ , β ⇒ δ ( →⇒ ) Γ , α → β ⇒ δ with the decomposition rules Γ , α 1 → ( α 2 → β ) ⇒ δ Γ , x , β ⇒ δ Γ ⇒ δ Γ , ⊥ → β ⇒ δ Γ , x , x → β ⇒ δ Γ , ( α 1 ∧ α 2 ) → β ⇒ δ Γ , β ⇒ δ Γ , α 1 → β, α 2 → β ⇒ δ Γ , α 2 → β ⇒ α 1 → α 2 Γ , β ⇒ δ Γ , ⊤ → β ⇒ δ Γ , ( α 1 ∨ α 2 ) → β ⇒ δ Γ , ( α 1 → α 2 ) → β ⇒ δ George Metcalfe (University of Bern) Uniform Interpolation August 2018 22 / 30

  75. A Terminating Sequent Calculus We obtain a terminating sequent calculus GIL ∗ for intuitionistic logic by removing the cut rule from GIL and replacing the implication left rule Γ , α → β ⇒ α Γ , β ⇒ δ ( →⇒ ) Γ , α → β ⇒ δ with the decomposition rules Γ , α 1 → ( α 2 → β ) ⇒ δ Γ , x , β ⇒ δ Γ ⇒ δ Γ , ⊥ → β ⇒ δ Γ , x , x → β ⇒ δ Γ , ( α 1 ∧ α 2 ) → β ⇒ δ Γ , β ⇒ δ Γ , α 1 → β, α 2 → β ⇒ δ Γ , α 2 → β ⇒ α 1 → α 2 Γ , β ⇒ δ Γ , ⊤ → β ⇒ δ Γ , ( α 1 ∨ α 2 ) → β ⇒ δ Γ , ( α 1 → α 2 ) → β ⇒ δ Theorem (Dyckhoff 1992) A sequent is derivable in GIL ∗ if and only if it is derivable in GIL . George Metcalfe (University of Bern) Uniform Interpolation August 2018 22 / 30

  76. Weighing Formulas The weight wt ( α ) of a formula α is defined inductively by George Metcalfe (University of Bern) Uniform Interpolation August 2018 23 / 30

Recommend

On (Uniform) Interpolation in Non-Classical Logics Sam van Gool Dipartimento di Matematica

On (Uniform) Interpolation in Non-Classical Logics Sam van Gool Dipartimento di Matematica

On (Uniform) Interpolation in Non-Classical Logics Sam van Gool Dipartimento di Matematica Federigo Enriques Universit degli Studi di Milano SGSLPS Workshop on Many-Valued Logics 22 May 2015, Bern 1 / 22 Interpolation in classical FO

1.33k views • 97 slides
Resolution-Based Uniform Interpolation and Forgetting for Expressive Description Logics Patrick

Resolution-Based Uniform Interpolation and Forgetting for Expressive Description Logics Patrick

Resolution-Based Uniform Interpolation and Forgetting for Expressive Description Logics Resolution-Based Uniform Interpolation and Forgetting for Expressive Description Logics Patrick Koopmann December 12, 2017 1/60 Resolution-Based Uniform

1.07k views • 74 slides
Uniform Interpolation Part 3: Case Studies George Metcalfe Mathematical Institute University of

Uniform Interpolation Part 3: Case Studies George Metcalfe Mathematical Institute University of

Uniform Interpolation Part 3: Case Studies George Metcalfe Mathematical Institute University of Bern BLAST 2018, University of Denver, 6-10 August 2018 George Metcalfe (University of Bern) Uniform Interpolation August 2018 1 / 27 This Talk

1.61k views • 115 slides
Uniform Interpolation Part II: An Algebraic Framework George Metcalfe Mathematical Institute

Uniform Interpolation Part II: An Algebraic Framework George Metcalfe Mathematical Institute

Uniform Interpolation Part II: An Algebraic Framework George Metcalfe Mathematical Institute University of Bern BLAST 2018, University of Denver, 6-10 August 2018 George Metcalfe (University of Bern) Uniform Interpolation August 2018 1 / 30

1.11k views • 94 slides
Uniform Interpolation and Proof Systems Rosalie Iemhoff Utrecht University Workshop on

Uniform Interpolation and Proof Systems Rosalie Iemhoff Utrecht University Workshop on

Uniform Interpolation and Proof Systems Rosalie Iemhoff Utrecht University Workshop on Admissible Rules and Unification II Les Diablerets, February 2, 2015 1 / 12 Proof systems An old question: When does a logic have a decent proof system? 2

624 views • 50 slides
Part II: Interpolation and Approximation theory Contents: Review of Lagrange interpolation

Part II: Interpolation and Approximation theory Contents: Review of Lagrange interpolation

Part II: Interpolation and Approximation theory Contents: Review of Lagrange interpolation polynomials 1 Newton interpolation 2 Optimal interpolation points; Chebyshev polynomials 3 Cubic spline interpolation 4 Error analysis 5 Numerical

1.14k views • 47 slides
3. Interpolation Closing the Gaps of Discretization . . . 3. Interpolation Numerical Programming

3. Interpolation Closing the Gaps of Discretization . . . 3. Interpolation Numerical Programming

Preliminary Remark Interpolation with Polynomials Polynomial Splines Trigonometric Interpolation Examples for Applications 3. Interpolation Closing the Gaps of Discretization . . . 3. Interpolation Numerical Programming I (for CSE),

616 views • 48 slides
Marcinkiewicz interpolation Updated May 18, 2020 Plan 2 Outline: Interpolation of quasinorms

Marcinkiewicz interpolation Updated May 18, 2020 Plan 2 Outline: Interpolation of quasinorms

Marcinkiewicz interpolation Updated May 18, 2020 Plan 2 Outline: Interpolation of quasinorms Diagonal Marcinkiewicz interpolation theorem General version Applications: Schur test, Hardy-Littlewood-Sobolev Interpolation for quasinorms 3

642 views • 24 slides
3. Interpolation: Closing the Gaps of Discretization . . . 3. Interpolation: Closing the Gaps of

3. Interpolation: Closing the Gaps of Discretization . . . 3. Interpolation: Closing the Gaps of

Preliminary Remark Interpolation with Polynomials Polynomial Splines Trigonometric Interpolation Examples for Applications 3. Interpolation: Closing the Gaps of Discretization . . . 3. Interpolation: Closing the Gaps of Discretization . . .

494 views • 48 slides
First-Order Interpolation Laura Kov acs Interpolation: Craig Interpolation Use of

First-Order Interpolation Laura Kov acs Interpolation: Craig Interpolation Use of

First-Order Interpolation Laura Kov acs Interpolation: Craig Interpolation Use of interpolation in software verification thanks to K. McMillan Interpolation: Craig Interpolation Use of interpolation in software verification

1.18k views • 114 slides
Plan 2 Outline: Basic definitions and facts Relation between L p , interpolation of norms

Plan 2 Outline: Basic definitions and facts Relation between L p , interpolation of norms

Function spaces L p Updated April 22, 2020 Plan 2 Outline: Basic definitions and facts Relation between L p , interpolation of norms Uniform convexity of L p with 1 p 8 Projections on closed convex sets Peculiarities of L p -spaces with

724 views • 28 slides
Stability and Lebesgue constants in Good interpolation points RBF interpolation Results

Stability and Lebesgue constants in Good interpolation points RBF interpolation Results

Stability and Lebesgue constants in RBF interpolation De Marchi Motivations Stability and Lebesgue constants in Good interpolation points RBF interpolation Results Numerical examples Stability of kernel-based interpolation Stefano De

1.19k views • 78 slides
Curriculum on The Cadet Corps Uniform Class A Uniform Class A Uniform Agenda C1. Class A

Curriculum on The Cadet Corps Uniform Class A Uniform Class A Uniform Agenda C1. Class A

Curriculum on The Cadet Corps Uniform Class A Uniform Class A Uniform Agenda C1. Class A Uniform CLASS A UNIFORM C1. Wear the Class A Uniform to standard. Class A Uniform Known as Black Service Uniform or Class A Worn mainly

502 views • 14 slides
Interpolation Dr. Mihail October 26, 2015 (Dr. Mihail) Interpolation October 26, 2015 1 / 11

Interpolation Dr. Mihail October 26, 2015 (Dr. Mihail) Interpolation October 26, 2015 1 / 11

Interpolation Dr. Mihail October 26, 2015 (Dr. Mihail) Interpolation October 26, 2015 1 / 11 Definitions 1 Interpolation: method of constructing new data points from sampling or experimentation. (Dr. Mihail) Interpolation October 26, 2015

303 views • 12 slides
WEAK INTERPOLATION PROPERTY over THE MINIMAL LOGIC Larisa Maksimova Sobolev Institute of

WEAK INTERPOLATION PROPERTY over THE MINIMAL LOGIC Larisa Maksimova Sobolev Institute of

Abstract Weak interpolation and joint consistency Propositional J-logics Reduction of WIP Weak interpolation and weak amalgamation Weak interpolation and weak amalgamation Logics with WIP over Gl Description of logics with WIP over Gl and J

621 views • 41 slides
INTERPOLATION IN LIGHT FIELDS WITH OVERLAPPING PATCHES D. C. Schedl 1 and O. Bimber 1 1 Institute

INTERPOLATION IN LIGHT FIELDS WITH OVERLAPPING PATCHES D. C. Schedl 1 and O. Bimber 1 1 Institute

OPTIMIZED SAMPLING FOR VIEW INTERPOLATION IN LIGHT FIELDS WITH OVERLAPPING PATCHES D. C. Schedl 1 and O. Bimber 1 1 Institute of Computer Graphics, david.schedl@jku.at and oliver.bimber@jku.at MOTIVATION uniform sparse [ours] coded sparse

780 views • 31 slides
Taylors Series and Interpolation CIS 541 - Interpolation Taylor Series interpolates at a

Taylors Series and Interpolation CIS 541 - Interpolation Taylor Series interpolates at a

Taylors Series and Interpolation CIS 541 - Interpolation Taylor Series interpolates at a specific Roger Crawfis point: The function Its first derivative It may not interpolate at other points. We want an

644 views • 13 slides
On interpolation in theorem proving Maria Paola Bonacina Visiting: Computer Science Laboratory,

On interpolation in theorem proving Maria Paola Bonacina Visiting: Computer Science Laboratory,

Outline Introduction to interpolation Interpolation for propositional resolution Interpolation and equality On interpolation in theorem proving Maria Paola Bonacina Visiting: Computer Science Laboratory, SRI International, Menlo Park, CA, USA

1.65k views • 64 slides
Quantifier elimination, amalgamation, deductive interpolation and Craig interpolation in

Quantifier elimination, amalgamation, deductive interpolation and Craig interpolation in

Quantifier elimination, amalgamation, deductive interpolation and Craig interpolation in many-valued logic Franco Montagna, first part in collaboration with Tommaso Cortonesi and Enrico Marchioni Definition . A logic L has the deductive

380 views • 19 slides
Curriculum on The Cadet Corps Uniform Wear It WIth honor Class C Uniform Class C Uniform

Curriculum on The Cadet Corps Uniform Wear It WIth honor Class C Uniform Class C Uniform

Curriculum on The Cadet Corps Uniform Wear It WIth honor Class C Uniform Class C Uniform Agenda B1. Class C Uniform CLASS C UNIFORM B1. Wear the Class C Uniform to standard. Class C Uniform Fully described in CR 1-8, Chp. 8 Headgear

185 views • 14 slides
Winter Uniform If out of uniform students must present a note of explanation to their Year Level

Winter Uniform If out of uniform students must present a note of explanation to their Year Level

Student Presentation Policy February 01, 2018 Summer Uniform If out of uniform students must present a note of explanation to their Year Level Coordinator who will issue a uniform pass. Summer Uniform (Terms 1&4) - Academic The summer

421 views • 3 slides
Interpolation CS3220 - Summer 2008 Jonathan Kaldor Interpolation Weve looked at the

Interpolation CS3220 - Summer 2008 Jonathan Kaldor Interpolation Weve looked at the

Interpolation CS3220 - Summer 2008 Jonathan Kaldor Interpolation Weve looked at the problem of model fitting using least squares: given some sample points, determine linear parameters for a model that best fits the data Note:

813 views • 63 slides
OVERVIEW 1 What is the Uniform Guidance? Rules that set uniform standards for the award and

OVERVIEW 1 What is the Uniform Guidance? Rules that set uniform standards for the award and

Uniform Guidance Procurement Requirements for NC Local Governments Norma Houston NC State Treasurers Conference June 26, 2018 OVERVIEW 1 What is the Uniform Guidance? Rules that set uniform standards for the award and expenditure of

731 views • 28 slides
Paper Summaries Any takers? Interpolation Papers for interpolation Projects Logistics

Paper Summaries Any takers? Interpolation Papers for interpolation Projects Logistics

Paper Summaries Any takers? Interpolation Papers for interpolation Projects Logistics Proposals due Wednesday. E-mail. Who didnt get any? Jobs, Jobs, Jobs Plan for today and I dont mean Steve!

361 views • 12 slides

More recommend