•  58
    Bemerkungen Zur Semantik Nicht‐Normaler Möglicher Welten
    Mathematical Logic Quarterly 35 (6): 551-557. 1989.
  •  89
    Predicate logics on display
    Studia Logica 62 (1): 49-75. 1999.
    The paper provides a uniform Gentzen-style proof-theoretic framework for various subsystems of classical predicate logic. In particular, predicate logics obtained by adopting van Behthem''s modal perspective on first-order logic are considered. The Gentzen systems for these logics augment Belnap''s display logic by introduction rules for the existential and the universal quantifier. These rules for x and x are analogous to the display introduction rules for the modal operators and and do not the…Read more
  •  84
    Hypersequent and Display Calculi – a Unified Perspective
    with Agata Ciabattoni and Revantha Ramanayake
    Studia 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.
  •  163
    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
  •  38
    Reasoning About Belief Revision
    with Caroline Semmling
    In Erik J. Olson Sebastian Enqvist (ed.), Belief Revision meets Philosophy of Science, Springer. pp. 303--328. 2011.
  •  97
    Informational interpretation of substructural propositional logics
    Journal 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.
  •  82
    Completeness and cut-elimination theorems for trilattice logics
    with Norihiro Kamide
    Annals 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.
  •  86
    Connexive logic
    Stanford Encyclopedia of Philosophy. 2008.
  •  56
    Strong Cut-Elimination for Constant Domain First-Order S5
    Logic 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.
  •  16
    Editorial
    with Roy Dyckhoff
    Studia Logica 69 (2): 195-196. 2001.
  •  84
    A rule-extension of the non-associative Lambek calculus
    Studia 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.
  •  134
    Nested 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.
  •  86
    An Axiomatic System and a Tableau Calculus for STIT Imagination Logic
    with Grigory K. Olkhovikov
    Journal 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.
  •  42
    Advances in Modal Logic, Volume 2 (edited book)
    with Michael Zakharyaschev, Krister Segerberg, and Maarten de Rijke
    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
  • Advances in Modal Logic, Vol. 1
    with Marcus Kracht, Maarten de Rijke, and Michael Zakharyaschev
    Studia Logica 65 (3): 440-442. 2000.
  •  165
    Diamonds are a philosopher's best friends
    Journal 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
  •  79
  •  59
    Essay Review
    History and Philosophy of Logic 20 (2): 115-120. 1999.
  •  57
    Bemerkungen Zur Semantik Nicht-Normaler Möglicher Welten
    Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (6): 551-557. 1989.
  •  40
    Reviews (review)
    Logic Journal of the IGPL 4 (2): 305-308. 1996.
  •  36
    Recent Trends in Philosophical Logic (Proceedings of Trends in Logic XI) (edited book)
    with Roberto Ciuni and Caroline Willkommen
    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
  •  46
    A new axiomatization of K t
    Bulletin of the Section of Logic 25 60-62. 1996.
  •  100
    A fugue on the themes of awareness logic and correspondence
    with Elias Thijsse
    Journal 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
  •  125
    Logical Connectives for Constructive Modal Logic
    Synthese 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.