Calculus of Classical Proofs from Programming Viewpoint(New Aspects in Non-Classical Logics and Their Kripke Semantics) (original) (raw)
Related papers
Journal of Asian Scientific Research, 2018
On Proof Terms and Embeddings of Classical Substructural Logics
Studia Logica
Towards a Theory of Proofs of Classical Logic Habilitation à diriger des recherches
2013
Proof-Theoretic Methods in Nonclassical Logic --an Introduction
Mathematical Society of Japan Memoirs, 1998
TR-2005002: The Basic Intuitionistic Logic of Proofs
2005
Permutability of proofs in intuitionistic sequent calculi
Theoretical Computer Science, 1999
Proof Theory for Intuitionistic Strong L\"ob Logic
arXiv (Cornell University), 2020
A uniform proof procedure for classical and non-classical logics
Lecture Notes in Computer Science, 1996
On Proof Realization of Intuitionistic Logic
1997
The basic intuitionistic logic of proofs
2007
On Proofs and Types in Second Order Logic
2015
A connection based proof method for intuitionistic logic
Lecture Notes in Computer Science, 1995
Proof analysis in intermediate logics
2012
The λ Calculus and the Unity of Structural Proof Theory
Theory of Computing Systems / Mathematical Systems Theory, 2009
Theorem Proving in Higher Order Logics
Lecture Notes in Computer Science, 2007
Proof Theoretic Harmony in the Substructural Era (draft)
On Synonymy in Proof-theoretic Semantics: The Case of \(\mathtt{2Int}\)
Bulletin of the Section of Logic
An introduction to proof theory
1998
Relational proof system for linear and other substructural logics
Logic Journal of IGPL, 1997
Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic
Studia Logica, 1998
On the geometry of intuitionistic S4 proofs
Homology, Homotopy and Applications, 2003
Revisiting the proof theory of Classical S4
arXiv: Logic in Computer Science, 2012
On some propositional proof systems for various logics
Sciences of Europe, 2017
Intuitionistic and classical natural deduction systems with the catch and the throw rules
Theoretical Computer Science, 1997
Canonical Proof nets for Classical Logic
2012
Lecture Notes in Computer Science, 2008
A Formalisation of Weak Normalisation (With Respect to Permutations) of Sequent Calculus Proofs
1999
A Note on Synonymy in Proof-Theoretic Semantics
Outstanding contributions to logic, 2024
Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving
Lecture Notes in Computer Science, 2001
On transforming intuitionistic matrix proofs into standard-sequent proofs
Lecture Notes in Computer Science, 1995
Boolean Models and Methods in Mathematics, Computer Science and Engineering ed. by Crama and Hammer, Chapter 3., 2010
T-string-unification: unifying prefixes in non-classical proof methods
1996
A proof-theoretic study of the correspondence of classical logic and modal logic
Journal of Symbolic Logic, vol.68(4), pp.1403-1414, 2003
Journal of Logic, Language and Information, 1996