Optimal acceptors and optimal proof systems
... there exist a proof system possessing the “shortest” proofs of the positive instances of the problem? Although the first result in this direction was obtained by Levin [Lev73] in 1970s, these important questions are still open for most interesting languages, for example, the language of propositiona ...
... there exist a proof system possessing the “shortest” proofs of the positive instances of the problem? Although the first result in this direction was obtained by Levin [Lev73] in 1970s, these important questions are still open for most interesting languages, for example, the language of propositiona ...
A KE Tableau for a Logic of Formal Inconsistency - IME-USP
... F ◦ X can be in DS, but only if ◦X is a subformula of some other formula in DS. If ◦X is not a subformula of some other formula in DS, neither T ◦ X nor F ◦ X are in DS; 4. if a signed formula S X is in DS, then for any sign S, for any formula X, for all subformulas Y of X and for all n ≥ 0, the sig ...
... F ◦ X can be in DS, but only if ◦X is a subformula of some other formula in DS. If ◦X is not a subformula of some other formula in DS, neither T ◦ X nor F ◦ X are in DS; 4. if a signed formula S X is in DS, then for any sign S, for any formula X, for all subformulas Y of X and for all n ≥ 0, the sig ...
Independence logic and tuple existence atoms
... M |=X ∃xφ iff for all s ∈ X , ∃m ∈ Dom(M) s.t. M |=s[m/x] φ; M |=X ∀xφ iff for all s ∈ X , ∀m ∈ Dom(M), M |=s[m/x] φ. ...
... M |=X ∃xφ iff for all s ∈ X , ∃m ∈ Dom(M) s.t. M |=s[m/x] φ; M |=X ∀xφ iff for all s ∈ X , ∀m ∈ Dom(M), M |=s[m/x] φ. ...
Strong Normalisation for a Gentzen-like Cut
... • A term, M , freshly introduces a name iff M introduces this name, but none of its proper subterms. In other words, the name must not be free in a proper subterm, just in the top-most term constructor. Similarly for co-names. We can now formally introduce sequents, or typing judgements. They are of ...
... • A term, M , freshly introduces a name iff M introduces this name, but none of its proper subterms. In other words, the name must not be free in a proper subterm, just in the top-most term constructor. Similarly for co-names. We can now formally introduce sequents, or typing judgements. They are of ...
A Pebble Weighted Automata and Weighted Logics
... automata and word transducers appear as instances of that framework, which found its way into numerous application areas such as natural language processing and speech recognition or digital image compression (see [Droste et al. 2009, Part IV]). A logical characterization of weighted automata, howev ...
... automata and word transducers appear as instances of that framework, which found its way into numerous application areas such as natural language processing and speech recognition or digital image compression (see [Droste et al. 2009, Part IV]). A logical characterization of weighted automata, howev ...
Tableau techniques for ALC
... Theorem. (Soundness) If a FOL sentence ϕ has a tableau proof then ϕ is valid. Theorem. (Completeness) If a sentence ϕ of FOL is valid, then ϕ has a tableau proof. Because FOL is not decidable, tableau proofs may not always terminate. The source of this difficulty is the γ rule. Trivial example: Suppos ...
... Theorem. (Soundness) If a FOL sentence ϕ has a tableau proof then ϕ is valid. Theorem. (Completeness) If a sentence ϕ of FOL is valid, then ϕ has a tableau proof. Because FOL is not decidable, tableau proofs may not always terminate. The source of this difficulty is the γ rule. Trivial example: Suppos ...
Lecture notes for Chapter 1
... Idea: Assume that the hypothesis of this implication is true (n is odd). Then use rules of inference and known theorems of math to show that q must also be true (n2 is odd). Spring 2003 ...
... Idea: Assume that the hypothesis of this implication is true (n is odd). Then use rules of inference and known theorems of math to show that q must also be true (n2 is odd). Spring 2003 ...
Structural Proof Theory
... for that, but some of the basic ideas and their connection to natural deduction and normalization procedures are explained in Appendix B. At present, there are many projects in the territory between logic, mathematics, and computer science that aim at fully formalizing mathematical proofs. These pro ...
... for that, but some of the basic ideas and their connection to natural deduction and normalization procedures are explained in Appendix B. At present, there are many projects in the territory between logic, mathematics, and computer science that aim at fully formalizing mathematical proofs. These pro ...
minimum models: reasoning and automation
... system serves the purpose of pointing out where the main difficulty resides when building a proof system for minimum model reasoning that is sound, complete and effective, for unrestricted state descriptions and general theories. The report discusses these difficulties in detail and then goes to des ...
... system serves the purpose of pointing out where the main difficulty resides when building a proof system for minimum model reasoning that is sound, complete and effective, for unrestricted state descriptions and general theories. The report discusses these difficulties in detail and then goes to des ...
Discrete Mathematics
... Not If Li proves ¬P and Lj proves P , then write from Li Lj have Lk : "Q" .. False If Li proves False, then write from Li have Lk : "P" .. ...
... Not If Li proves ¬P and Lj proves P , then write from Li Lj have Lk : "Q" .. False If Li proves False, then write from Li have Lk : "P" .. ...
Barwise: Infinitary Logic and Admissible Sets
... that isomorphic structures are potentially isomorphic. In the other direction, potentially isomorphic structures are very similar to each other, but are not necessarily isomorphic. For example, any two infinite structures with the empty vocabulary are potentially isomorphic. While two potentially is ...
... that isomorphic structures are potentially isomorphic. In the other direction, potentially isomorphic structures are very similar to each other, but are not necessarily isomorphic. For example, any two infinite structures with the empty vocabulary are potentially isomorphic. While two potentially is ...
Hilbert`s Program Then and Now
... logical grounding of our knowledge the axiomatic method deserves the first rank” [Hilbert, 1900b, 1093]. Hilbert thus was after a direct consistency proof of analysis, i.e., one not based on reduction to another theory. He proposed the problem of finding such a proof as the second of his 23 mathemat ...
... logical grounding of our knowledge the axiomatic method deserves the first rank” [Hilbert, 1900b, 1093]. Hilbert thus was after a direct consistency proof of analysis, i.e., one not based on reduction to another theory. He proposed the problem of finding such a proof as the second of his 23 mathemat ...
A Qualitative Theory of Dynamic Interactive Belief Revision
... introduce an operation of product update of such models, based on the antilexicographic order on the product of the state model with the action model. The simplest and most natural way to define a connected pre-order on a Cartesian product from connected pre-orders on each of the components is to us ...
... introduce an operation of product update of such models, based on the antilexicographic order on the product of the state model with the action model. The simplest and most natural way to define a connected pre-order on a Cartesian product from connected pre-orders on each of the components is to us ...
Conditional XPath
... F Otree is interpreted on node labeled, sibling ordered trees as indicated above with variables ranging over the set of nodes. We use the standard notation M |= φ(a1 , . . . , ak ) to denote that φ(x1 , . . . , xk ) is true at M under any assignment g which maps xi to ai . Definition 2. Let φ(x1 , ...
... F Otree is interpreted on node labeled, sibling ordered trees as indicated above with variables ranging over the set of nodes. We use the standard notation M |= φ(a1 , . . . , ak ) to denote that φ(x1 , . . . , xk ) is true at M under any assignment g which maps xi to ai . Definition 2. Let φ(x1 , ...