-
46Semantics-based Nonmonotonic InferenceNotre Dame Journal of Formal Logic 36 (1): 44-54. 1995.In this paper we discuss Gabbay's idea of basing nonmonotonic deduction on semantic consequence in intuitionistic logic extended by a consistency operator and Turner's suggestion of replacing the intuitionistic base system by Kleene's three-valued logic. It is shown that a certain counterintuitive feature of these approaches can be avoided by using Nelson's constructive logic N instead of intuitionistic logic or Kleene's system. Moreover, in N a more general notion of consistency can be defined …Read more
-
103A Non-Inferentialist, Anti-Realistic Conception of Logical Truth and FalsityTopoi 31 (1): 93-100. 2012.Anti-realistic conceptions of truth and falsity are usually epistemic or inferentialist. Truth is regarded as knowability, or provability, or warranted assertability, and the falsity of a statement or formula is identified with the truth of its negation. In this paper, a non-inferentialist but nevertheless anti-realistic conception of logical truth and falsity is developed. According to this conception, a formula (or a declarative sentence) A is logically true if and only if no matter what is to…Read more
-
47Nested 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.
-
28Hypersequent and Display Calculi – a Unified PerspectiveStudia Logica 102 (6): 1245-1294. 2014.This paper presents an overview of the methods of hypersequents and display sequents in the proof theory of non-classical logics. In contrast with existing surveys dedicated to hypersequent calculi or to display calculi, our aim is to provide a unified perspective on these two formalisms highlighting their differences and similarities and discussing applications and recent results connecting and comparing them.
-
6Reasoning About Belief RevisionIn Erik J. Olson Sebastian Enqvist (ed.), Belief Revision Meets Philosophy of Science, Springer. pp. 303--328. 2011.
-
10Editorial introduction. Special issue on consequence relations and sequent systemsLogic Journal of the IGPL 6 (3): 377-381. 1998.
-
5We study a propositional bimodal logic consisting of two S4 modalities £ and [a], together with the interaction axiom scheme a £ϕ → £ aϕ. In the intended semantics, the plain £ is given the McKinsey-Tarski interpretation as the interior operator of a topology, while the labelled [a] is given the standard Kripke semantics using a reflexive and transitive binary relation a. The interaction axiom expresses the property that the Ra relation is lower semi-continuous with respect to the topology. The c…Read more
-
18Completeness 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.
-
34Synchronized Linear-Time Temporal LogicStudia Logica 99 (1-3): 365-388. 2011.A new combined temporal logic called synchronized linear-time temporal logic (SLTL) is introduced as a Gentzen-type sequent calculus. SLTL can represent the n -Cartesian product of the set of natural numbers. The cut-elimination and completeness theorems for SLTL are proved. Moreover, a display sequent calculus δ SLTL is defined.
-
27A 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.
-
76Logical 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.
-
46An 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.
-
83Diamonds 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
-
9Translation of hypersequents into display sequentsLogic Journal of the IGPL 6 (5): 719-734. 1998.
-
12
-
31Bemerkungen Zur Semantik Nicht-Normaler Möglicher WeltenZeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (6): 551-557. 1989.
-
10Strong 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.
-
13Recent 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
-
25A fugue on the themes of awareness logic and correspondenceJournal of Applied Non-Classical Logics 6 (2): 127-136. 1996.No abstract
-
50Functional completeness for subsystems of intuitionistic propositional logicJournal of Philosophical Logic 22 (3). 1993.
Areas of Specialization
Epistemology |
Logic and Philosophy of Logic |
Areas of Interest
Philosophy of Language |