-
97Informational interpretation of substructural propositional logicsJournal of Logic, Language and Information 2 (4): 285-308. 1993.This paper deals with various substructural propositional logics, in particular with substructural subsystems of Nelson's constructive propositional logics N– and N. Doen's groupoid semantics is extended to these constructive systems and is provided with an informational interpretation in terms of information pieces and operations on information pieces.
-
82Completeness and cut-elimination theorems for trilattice logicsAnnals of Pure and Applied Logic 162 (10): 816-835. 2011.A sequent calculus for Odintsov’s Hilbert-style axiomatization of a logic related to the trilattice SIXTEEN3 of generalized truth values is introduced. The completeness theorem w.r.t. a simple semantics for is proved using Maehara’s decomposition method that simultaneously derives the cut-elimination theorem for . A first-order extension of and its semantics are also introduced. The completeness and cut-elimination theorems for are proved using Schütte’s method.
-
34Translation of hypersequents into display sequentsLogic Journal of the IGPL 6 (5): 719-734. 1998.
-
84A rule-extension of the non-associative Lambek calculusStudia Logica 71 (3): 443-451. 2002.An extension L + of the non-associative Lambek calculus Lis defined. In L + the restriction to formula-conclusion sequents is given up, and additional left introduction rules for the directional implications are introduced. The system L + is sound and complete with respect to a modification of the ternary frame semantics for L.
-
56Strong Cut-Elimination for Constant Domain First-Order S5Logic Journal of the IGPL 3 (5): 797-810. 1995.We consider a labelled tableau presentation of constant domain first-order S5 and prove a strong cut-elimination theorem.
-
134Nested deontic modalities: Another view of parking on highways (review)Erkenntnis 49 (2): 185-199. 1998.A suggestion is made for representing iterated deontic modalities in stit theory, the “seeing-to-it-that” theory of agency. The formalization is such that normative sentences are represented as agentive sentences and therefore have history dependent truth conditions. In contrast to investigations in alethic modal logic, in the construction of systems of deontic logic little attention has been paid to the iteration... of the deontic modalities.
-
86An Axiomatic System and a Tableau Calculus for STIT Imagination LogicJournal of Philosophical Logic 47 (2): 259-279. 2018.We formulate a Hilbert-style axiomatic system and a tableau calculus for the STIT-based logic of imagination recently proposed in Wansing. Completeness of the axiom system is shown by the method of canonical models; completeness of the tableau system is also shown by using standard methods.
-
38Editorial introduction. Special issue on consequence relations and sequent systemsLogic Journal of the IGPL 6 (3): 377-381. 1998.
-
42Advances in Modal Logic, Volume 2 (edited book)Center for the Study of Language and Inf. 2001.Modal Logic, originally conceived as the logic of necessity and possibility, has developed into a powerful mathematical and computational discipline. It is the main source of formal languages aimed at analyzing complex notions such as common knowledge and formal provability. Modal and modal-like languages also provide us with families of restricted description languages for relational and topological structures; they are being used in many disciplines, ranging from artificial intelligence, compu…Read more
-
165Diamonds are a philosopher's best friendsJournal of Philosophical Logic 31 (6): 591-612. 2002.The knowability paradox is an instance of a remarkable reasoning pattern (actually, a pair of such patterns), in the course of which an occurrence of the possibility operator, the diamond, disappears. In the present paper, it is pointed out how the unwanted disappearance of the diamond may be escaped. The emphasis is not laid on a discussion of the contentious premise of the knowability paradox, namely that all truths are possibly known, but on how from this assumption the conclusion is derived …Read more
-
59
-
57Bemerkungen Zur Semantik Nicht-Normaler Möglicher WeltenZeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (6): 551-557. 1989.
-
36Recent Trends in Philosophical Logic (Proceedings of Trends in Logic XI) (edited book)Springer. 2014.This volume presents recent advances in philosophical logic with chapters focusing on non-classical logics, including paraconsistent logics, substructural logics, modal logics of agency and other modal logics. The authors cover themes such as the knowability paradox, tableaux and sequent calculi, natural deduction, definite descriptions, identity, truth, dialetheism and possible worlds semantics. The developments presented here focus on challenging problems in the specification of fundamental ph…Read more
-
100A fugue on the themes of awareness logic and correspondenceJournal of Applied Non-Classical Logics 6 (2): 127-136. 1996.ABSTRACT We consider certain objections against Fagin's and Halpern's logic of general awareness and interpret them as doubts whether there exists a correspondence theory for awareness logic with respect to sieve models. We present a non-compositional translation from epistemic formulas into first-order logic as the essential ingredient of such a correspondence theory and define a suitable notion of bisimulation. Moreover, in order to further underline the power of sieve models, we prove the Lew…Read more
-
125Logical Connectives for Constructive Modal LogicSynthese 150 (3): 459-482. 2006.Model-theoretic proofs of functional completenes along the lines of [McCullough 1971, Journal of Symbolic Logic 36, 15–20] are given for various constructive modal propositional logics with strong negation.
-
78Inconsistency-tolerant description logic. Part II: A tableau algorithm for CALC CJournal of Applied Logic 6 (3): 343-360. 2008.
-
165Displaying the modal logic of consistencyJournal of Symbolic Logic 64 (4): 1573-1590. 1999.It is shown that the constructive four-valued logic N4 can be faithfully embedded into the modal logic S4. This embedding is used to obtain complete, cut-free display sequent calculi for N4 and C4, the modal logic of consistency over N4. C4 is a natural monotonic base system for semantics-based non-monotonic reasoning.
-
75Combining linear-time temporal logic with constructiveness and paraconsistencyJournal of Applied Logic 8 (1): 33-61. 2010.
-
204Constructive negation, implication, and co-implicationJournal of Applied Non-Classical Logics 18 (2-3): 341-364. 2008.In this paper, a family of paraconsistent propositional logics with constructive negation, constructive implication, and constructive co-implication is introduced. Although some fragments of these logics are known from the literature and although these logics emerge quite naturally, it seems that none of them has been considered so far. A relational possible worlds semantics as well as sound and complete display sequent calculi for the logics under consideration are presented.
-
102The Power of Belnap: Sequent Systems for SIXTEEN ₃ (review)Journal of Philosophical Logic 39 (4). 2010.The trilattice SIXTEEN₃ is a natural generalization of the wellknown bilattice FOUR₂. Cut-free, sound and complete sequent calculi for truth entailment and falsity entailment in SIXTEEN₃, are presented
Areas of Specialization
| Epistemology |
| Logic and Philosophy of Logic |
Areas of Interest
| Philosophy of Language |