Dynamic logic of propositional assignments
... the computational complexity of model checking with DL-PA is EXPTIME-complete. In contrast, the complexity of model checking a transition system with PDL is PTIME-complete. As we shall show, the complexity of DL-PA satisfiability checking remains EXPTIME-complete, which is also the complexity of PDL ...
... the computational complexity of model checking with DL-PA is EXPTIME-complete. In contrast, the complexity of model checking a transition system with PDL is PTIME-complete. As we shall show, the complexity of DL-PA satisfiability checking remains EXPTIME-complete, which is also the complexity of PDL ...
Fichte`s Legacy in Logic
... logic of judgment deals only with general representations (i.e., not with intuitions), any judgment that is recognized in logic requires the synthesis [Synthesis] or combination [Verbindung] of at least two concepts. I shall refer to this as Kant’s synthetic construal of judgment. The traces of the ...
... logic of judgment deals only with general representations (i.e., not with intuitions), any judgment that is recognized in logic requires the synthesis [Synthesis] or combination [Verbindung] of at least two concepts. I shall refer to this as Kant’s synthetic construal of judgment. The traces of the ...
Sketch-as-proof - Norbert Preining
... the axiomatic theory (cf. 2.4) and finally we will present some consequences of the axioms for projective geometry (cf. 2.5). For a good textbook on projective geometry see [3]. ...
... the axiomatic theory (cf. 2.4) and finally we will present some consequences of the axioms for projective geometry (cf. 2.5). For a good textbook on projective geometry see [3]. ...
A Partially Truth Functional Approach to
... paradigm cases have the form “If A then B” where A and B are statements that can “stand alone” (unlike “I were rich” in “If I were rich then I would own a yacht”). Such constructions will here be denoted “A > B.” Interpreting A > B as the material conditional implies that it is either true or false ...
... paradigm cases have the form “If A then B” where A and B are statements that can “stand alone” (unlike “I were rich” in “If I were rich then I would own a yacht”). Such constructions will here be denoted “A > B.” Interpreting A > B as the material conditional implies that it is either true or false ...
article in press - School of Computer Science
... property of intuitionistic modal logic have been proved in [33–35] using an embedding of intuitionistic modal logics with n modalities in classical modal logics with n + 1 modalities. However, their results can only be used to prove decidability of those intuitionistic modal logics, for which the co ...
... property of intuitionistic modal logic have been proved in [33–35] using an embedding of intuitionistic modal logics with n modalities in classical modal logics with n + 1 modalities. However, their results can only be used to prove decidability of those intuitionistic modal logics, for which the co ...
The unintended interpretations of intuitionistic logic
... where x is not free in A(0) in the rule above. The system HA is strong enough to prove essentially all number theoretic results we find in any text on number theory. The main exceptions involve theorems related to incompleteness proofs of P A and statements that are true in P A only because of their ...
... where x is not free in A(0) in the rule above. The system HA is strong enough to prove essentially all number theoretic results we find in any text on number theory. The main exceptions involve theorems related to incompleteness proofs of P A and statements that are true in P A only because of their ...
Completeness and Decidability of a Fragment of Duration Calculus
... Duration Calculus (DC) was introduced by Zhou, Hoare and Ravn in 1991 as a logic to specify the requirements for real-time systems. DC has been used successfully in many case studies, see e.g. [ZZ94,YWZP94,HZ94,DW94,BHCZ94,XH95], [Dan98,ED99]. In [DW94], we have developed a method for designing a re ...
... Duration Calculus (DC) was introduced by Zhou, Hoare and Ravn in 1991 as a logic to specify the requirements for real-time systems. DC has been used successfully in many case studies, see e.g. [ZZ94,YWZP94,HZ94,DW94,BHCZ94,XH95], [Dan98,ED99]. In [DW94], we have developed a method for designing a re ...
Soundness and Completeness - Cognitive Science Department
... rules of S is sound. • If the inference rules deal with subproofs, such a proof can actually become rather technical, even if the soundness of each inference rules is intuitive clear (see e.g. proof of soundness of F in “Language, Proof, and Logic”). • The good news is that Alpha does not deal with ...
... rules of S is sound. • If the inference rules deal with subproofs, such a proof can actually become rather technical, even if the soundness of each inference rules is intuitive clear (see e.g. proof of soundness of F in “Language, Proof, and Logic”). • The good news is that Alpha does not deal with ...
Maximal Introspection of Agents
... The reason for agent 2 to believe that agent 1 has a false belief could e.g. be that agent 2 sees that agent 1 cannot see the dotted box (the black box is blocking the view of agent 1), and agent 2 therefore expects agent 1 to have the false belief that there are only two boxes present. The problem ...
... The reason for agent 2 to believe that agent 1 has a false belief could e.g. be that agent 2 sees that agent 1 cannot see the dotted box (the black box is blocking the view of agent 1), and agent 2 therefore expects agent 1 to have the false belief that there are only two boxes present. The problem ...
Combining Paraconsistent Logic with Argumentation
... no matter what, while if the rule is defeasible, its consequent must be accepted if there are no good reasons not to accept it. Arguments can be attacked on their (ordinary) premises and on their applications of defeasible inference rules. Some attacks succeed as defeats, which is partly determined ...
... no matter what, while if the rule is defeasible, its consequent must be accepted if there are no good reasons not to accept it. Arguments can be attacked on their (ordinary) premises and on their applications of defeasible inference rules. Some attacks succeed as defeats, which is partly determined ...
Logic 1 Lecture Notes Part I: Propositional Logic
... Some authors of logical texts (e.g., Hodges) use Greek letters ‘ϕ’, ‘ψ’, etc. as metavariables for formulas. For example, in Hodges, you might find statements like A conjunction formula ϕ ∧ ψ implies ϕ; In our course, we shall write instead, A conjunction formula A ∧ B implies A Note that this is a ...
... Some authors of logical texts (e.g., Hodges) use Greek letters ‘ϕ’, ‘ψ’, etc. as metavariables for formulas. For example, in Hodges, you might find statements like A conjunction formula ϕ ∧ ψ implies ϕ; In our course, we shall write instead, A conjunction formula A ∧ B implies A Note that this is a ...