Modal Logic

Cut-Free proof systems for Geach logics, The IfCoLog Journal of Logics and their Applications. 2(2), 17 - 64, 2015.

Modal interpolation via nested sequents, with Roman Kuznets, Annals of Pure and Applied Logic, 166:274-305, 2015.

Nested Sequents for Intuitionistic Logic, Notre Dame Journal of Formal Logic, 55(1):41-61, 2014.

Prefixed tableaus and nested sequents. Annals of Pure and Applied Logic, 163:291-313, 2012.

Proving Completeness for Nested Sequent Calculi, in Jean-Yves Beziau and Marcel Esteban Coniglio, editors, Logic Without Frontiers, Festschrift for Walter Alexandre Carnielli on the occasion of his 60th birthday, pp 145-154, College Publications, 2011.

Reasoning About Games, Studia Logica. 99:143-169, 2011.

Intensional Logic, Stanford Encyclopedia of Philosophy. Encyclopedia is on-line at http://plato.stanford.edu/, Edward N. Zalta editor, 2006. Revised 2011.

FOIL Axiomatized, Studia Logica, 84:1--22, 2006. Electronic version at http://dx.doi.org/10.1007/s11225-006-9000-2. There is a correction, available here.

First-order intensional logic, Annals of Pure and Applied Logic, 127: 171--193, 2004.

Intensional Logic --- Beyond First Order, in Trends in Logic, 50 Years of Studia Logica, Vincent F. Hendricks and Jacek Malinowski editors, pp 87--108. Kluwer, 2003.

Bisimulations and Boolean Vectors, in Advances in Modal Logic 4, Philippe Balbiani, Nobu-Yuki Suzuki, and Michael Zakharyashev editors, pp 97--125, King's College Publications, 2003.

First order alethic modal logic, A Companion to Philosophical Logic, Dale Jacquette Editor, 410--421, Blackwell, 2002.

Modal Logics Between Propositional and First Order, Journal of Logic and Computation, 12:1017-1026, 2002.

Interpolation for First-Order S5, Journal of Symbolic Logic, 67: 621-634, 2002.

Term-Modal Logics, with Lars Thalmann and Andrei Voronkov, Studia Logica, 69:133--169, 2001.

Modality and Databases, Automated Reasoning with Analytic Tableaux and Related Methods, Springer Lecture Notes in Artificial Intelligence 1847, Roy Dyckhoff (ed), pp 19--39, 2000. Avaliable from Springer at http://dx.doi.org/10.1007/10722086_2

Term-Modal Logics, with Lars Thalmann and Andrei Voronkov, Automated Reasoning with Analytic Tableaux and Related Methods, Springer Lecture Notes in Artificial Intelligence 1847, Roy Dyckhoff (ed), pp 220--236, 2000. Available electronically from Springer at http://dx.doi.org/10.1007/10722086_19q

Databases and Higher Types, Computational Logic --- CL2000, Springer Lecture Notes in Artificial Intelligence 1861, John Lloyd et. al. (ed), pp 41--52, 2000. [© Springer-Verlag, URL: http://www.springer.de/comp/lncs/index.html]

Higher-Order Modal Logic---A Sketch, Automated Deduction in Classical and Non-Classical Logics, Springer Lecture Notes in Artificial Intelligence 1761, pp 23--38, 1998. [© Springer-Verlag, URL: http://www.springer.de/comp/lncs/index.html]

A simple propositional S5 tableau system, Annals of Pure and Applied Logic, 96:107--115, 1999.

Bertrand Russell, Herbrand's Theorem, and the assignment statement,
Artificial Intelligence and Symbolic Computation, Springer Lecture Notes in Artificial Intelligence 1476, pp 14--28, 1998.

Barcan both ways, Journal of Applied Non-Classical Logics, 9: 329--344, 1999.

Herbrand's theorem for a modal logic. Logic and Foundations of Mathematics, A. Cantini, E. Casari, and P. Minari, editors, Kluwer Academic Publishers, pp 219-225, 1999.

On quantified modal logic, Fundamenta Informaticae, 39:1-5-121,1999.

LeanTaP Revisited. Journal of Logic and Computation, 8:33--47, 1998

A modal Herbrand theorem. Fundamenta Informaticae , 28:101--122, 1996.

A program to compute Gödel-Löb fixpoints. Bulletin EATCS, 58:118--130, 1996.

Tableaus for many-valued modal logic. Studia Logica , 55:63--87, 1995.

Many-valued modal logics, II. Fundamenta Informaticae , 17:55--73, 1992.

coauthored with Wiktor Marek, and Miroslav Truszczynski. The pure logic of necessitation. Journal of Logic and Computation , 2:349--373, 1992.

Many-valued non-monotonic modal logics. In Anil Nerode and Mikhail Taitslin, editors, Logical Foundations of Computer Science --- Tver 92 , pages 139--150. Springer Lecture Notes in Computer Science, 620, 1992.

Many-valued modal logics. Fundamenta Informaticae , 15:235--254, 1991.

Modal logics -- a summary of the well-behaved. Atti Degli Incontri di Logica Matematica , 6:1--14, 1992.

Modal logic should say more than it does. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic, Essays in Honor of Alan Robinson , pages 113--135. MIT Press, Cambridge, MA, 1991.

Destructive modal resolution. Journal of Logic and Computation , 1:83--97, 1990.

First-order modal tableaux. Journal of Automated Reasoning , 4:191--213, 1988.

Linear reasoning in modal logic. Journal of Symbolic Logic , 49:1363--1378, 1984.

A symmetric approach to axiomatizing quantifiers and modalities. Synthese , 60:5--19, 1984.

Subformula results in some propositional modal logics. Studia Logica , 37:387--391, 1978.

A tableau system for propositional S5. Notre Dame Journal of Formal Logic , 18:292--294, 1977.

A modal logic epsilon-calculus. Notre Dame Journal of Formal Logic , 16:1--16, 1975.

Model existence theorems for modal and intuitionistic logics. Journal of Symbolic Logic , 38:613--627, 1973.

A modal logic analog of Smullyan's fundamental theorem. Zeitschrift für mathematische Logik und Gründlagen der Mathematik , 19:1--16, 1973.

Non-classical logics and the independence results of set theory. Theoria , 38:133--142, 1972.

Epsilon-calculus based axiom systems for some propositional modal
logics. Notre Dame Journal of Formal Logic , 13:381--384, 1972.

Tableau methods of proof for modal logics. Notre Dame Journal of Formal Logic , 13:237--247, 1972.

An epsilon-calculus system for first-order S4. In Wilfred Hodges, editor, Conference in Mathematical Logic, London '70 , pages 103--110, 1972.
Springer Lecture Notes in Mathematics, No. 255.

An embedding of classical logic in S4. Journal of Symbolic Logic , 35:529--534, 1970.

Logics with several modal operators. Theoria , 35:259--266, 1969.

[Go home]