- Provability in Logic.F. H. Fischer - 1957 - Journal of Symbolic Logic 23 (1):37-38.details
|
|
The method of hypersequents in the proof theory of propositional non-classical logics.Arnon Avron - 1977 - In Wilfrid Hodges (ed.), Logic. New York: Penguin Books. pp. 1-32.details
|
|
Provability in logic.Stig Kanger - 1957 - Stockholm,: Almqvist & Wiksell.details
|
|
A Cut-free Gentzen Formulation Of The Modal Logic S5.T. Braüner - 2000 - Logic Journal of the IGPL 8 (5):629-643.details
|
|
Display logic.Nuel D. Belnap - 1982 - Journal of Philosophical Logic 11 (4):375-417.details
|
|
Hypersequent Calculi for S5: The Methods of Cut Elimination.Kaja Bednarska & Andrzej Indrzejczak - 2015 - Logic and Logical Philosophy 24 (3):277–311.details
|
|
A constructive analysis of RM.Arnon Avron - 1987 - Journal of Symbolic Logic 52 (4):939 - 951.details
|
|
Reasoning with logical bilattices.Ofer Arieli & Arnon Avron - 1996 - Journal of Logic, Language and Information 5 (1):25--63.details
|
|
How a computer should think.Nuel Belnap - 1977 - In Gilbert Ryle (ed.), Contemporary aspects of philosophy. Boston: Oriel Press.details
|
|
Many-valued modal logics.Melvin C. Fitting - unknowndetails
|
|
Many-valued modal logics II.Melvin Fitting - unknowndetails
|
|
A few more useful 8-valued logics for reasoning with tetralattice eight.Dmitry Zaitsev - 2009 - Studia Logica 92 (2):265 - 280.details
|
|
A Deep Inference System for the Modal Logic S5.Phiniki Stouppa - 2007 - Studia Logica 85 (2):199-214.details
|
|
Some Useful 16-Valued Logics: How a Computer Network Should Think.Yaroslav Shramko & Heinrich Wansing - 2005 - Journal of Philosophical Logic 34 (2):121-153.details
|
|
Many-valued modal logics: A simple approach: Many-valued modal logics: A simple approach.Graham Priest - 2008 - Review of Symbolic Logic 1 (2):190-203.details
|
|
A cut-free simple sequent calculus for modal logic S5.Francesca Poggiolesi - 2008 - Review of Symbolic Logic 1 (1):3-15.details
|
|
Gentzen Method in Modal Calculi, II.Masao Ohnishi & Kazuo Matsumoto - 1975 - Journal of Symbolic Logic 40 (3):467-468.details
|
|
The lattice of Belnapian modal logics: Special extensions and counterparts.Sergei P. Odintsov & Stanislav O. Speranski - 2016 - Logic and Logical Philosophy 25 (1):3-33.details
|
|
Modal logics with Belnapian truth values.Serge P. Odintsov & Heinrich Wansing - 2010 - Journal of Applied Non-Classical Logics 20 (3):279-304.details
|
|
Disentangling FDE -Based Paraconsistent Modal Logics.Sergei P. Odintsov & Heinrich Wansing - 2017 - Studia Logica 105 (6):1221-1254.details
|
|
Belnap–Dunn Modal Logics: Truth Constants Vs. Truth Values.Sergei P. Odintsov & Stanislav O. Speranski - 2020 - Review of Symbolic Logic 13 (2):416-435.details
|
|
Proof Analysis in Modal Logic.Sara Negri - 2005 - Journal of Philosophical Logic 34 (5-6):507-544.details
|
|
Modal Multilattice Logic.Norihiro Kamide & Yaroslav Shramko - 2017 - Logica Universalis 11 (3):317-343.details
|
|
Kripke Completeness of Bi-intuitionistic Multilattice Logic and its Connexive Variant.Norihiro Kamide, Yaroslav Shramko & Heinrich Wansing - 2017 - Studia Logica 105 (6):1193-1219.details
|
|
Linear time in hypersequent framework.Andrzej Indrzejczak - 2016 - Bulletin of Symbolic Logic 22 (1):121-144.details
|
|
Cut-free double sequent calculus for S5.A. Indrzejczak - 1998 - Logic Journal of the IGPL 6 (3):505-516.details
|
|
Cut Elimination Theorem for Non-Commutative Hypersequent Calculus.Andrzej Indrzejczak - 2017 - Bulletin of the Section of Logic 46 (1/2).details
|
|
Two proofs of the algebraic completeness theorem for multilattice logic.Oleg Grigoriev & Yaroslav Petrukhin - 2019 - Journal of Applied Non-Classical Logics 29 (4):358-381.details
|
|
Proof Methods for Modal and Intuitionistic Logics.Melvin Fitting - 1985 - Journal of Symbolic Logic 50 (3):855-856.details
|
|
Intuitive semantics for first-degree entailments and 'coupled trees'.J. Michael Dunn - 1976 - Philosophical Studies 29 (3):149-168.details
|
|
An Introduction to Non-Classical Logic: From If to Is.Graham Priest - 2008 - New York: Cambridge University Press.details
|
|
The trilaticce of constructive truth values.Yaroslav Shramko, J. Michael Dunn & Tatsutoshi Takenaka - 2001 - Journal of Logic and Computation 11 (1):761--788.details
|
|
Multivalued logics: a uniform approach to reasoning in AI.Matthew Ginsberg - 1988 - Computer Intelligence 4 (1):256--316.details
|
|
A useful four-valued logic.N. D. Belnap - 1977 - In J. M. Dunn & G. Epstein (eds.), Modern Uses of Multiple-Valued Logic. D. Reidel.details
|
|
Propositional dynamic logic with belnapian truth values.Igor Sedlár - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 503-519.details
|
|
Proofnets for S5: sequents and circuits for modal logic.Greg Restall - 2007 - In C. Dimitracopoulos, L. Newelski & D. Normann (eds.), Logic Colloquium 2005. Cambridge: Cambridge University Press. pp. 151-172.details
|
|
A modified subformula property for the modal logics K5 and K5D.Mitio Takano - 2001 - Bulletin of the Section of Logic 30 (2):115-123.details
|
|
Paraconsistent modal logic.Lou Goble - 2006 - Logique Et Analyse 193:3-29.details
|
|