- Abduction as Deductive Saturation: a Proof-Theoretic Inquiry.Mario Piazza, Gabriele Pulcini & Andrea Sabatini - 2023 - Journal of Philosophical Logic 52 (6):1575-1602.details
|
|
Non-distributive Relatives of ETL and NFL.Daniil Kozhemiachenko - 2020 - Studia Logica 109 (1):137-165.details
|
|
Elementare ma complessa: la prospettiva della complessità computazionale attraverso il caso studio della geometria di Tarski.Pierluigi Graziani - 2012 - In Vincenzo Fano, Enrico Giannetto, Giulia Giannini & Pierluigi Graziani (eds.), Complessità e Riduzionismo. ISONOMIA - Epistemologica Series Editor. pp. 66-81.details
|
|
(2 other versions)reputation among logicians as being essentially trivial. I hope to convince the reader that it presents some of the most challenging and intriguing problems in modern logic. Although the problem of the complexity of propositional proofs is very natural, it has been investigated systematically only since the late 1960s. [REVIEW]Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.details
|
|
(2 other versions)The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.details
|
|
Cut and pay.Marcelo Finger & Dov Gabbay - 2006 - Journal of Logic, Language and Information 15 (3):195-218.details
|
|
Non-contingency in a Paraconsistent Setting.Daniil Kozhemiachenko & Liubov Vashentseva - forthcoming - Logic Journal of the IGPL.details
|
|
Tableaux and Interpolation for Propositional Justification Logics.Meghdad Ghari - 2024 - Notre Dame Journal of Formal Logic 65 (1):81-112.details
|
|
Normality, Non-contamination and Logical Depth in Classical Natural Deduction.Marcello D’Agostino, Dov Gabbay & Sanjay Modgil - 2020 - Studia Logica 108 (2):291-357.details
|
|
Rasiowa–Sikorski Deduction Systems with the Rule of Cut: A Case Study.Dorota Leszczyńska-Jasion, Mateusz Ignaszak & Szymon Chlebowski - 2019 - Studia Logica 107 (2):313-349.details
|
|
An empirical analysis of modal theorem provers.Ullrich Hustadt & Renate A. Schmidt - 1999 - Journal of Applied Non-Classical Logics 9 (4):479-522.details
|
|
Automatic proof generation in an axiomatic system for $\mathsf{CPL}$ by means of the method of Socratic proofs.Aleksandra Grzelak & Dorota Leszczyńska-Jasion - 2018 - Logic Journal of the IGPL 26 (1):109-148.details
|
|
An efficient relational deductive system for propositional non-classical logics.Andrea Formisano & Marianna Nicolosi-Asmundo - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):367-408.details
|
|
Towards automated first-order abduction: the cut-based approach.Marcelo Finger - 2012 - Logic Journal of the IGPL 20 (2):370-387.details
|
|
Cut-Based Abduction.Marcello D'agostino, Marcelo Finger & Dov Gabbay - 2008 - Logic Journal of the IGPL 16 (6):537-560.details
|
|
Relative efficiency of propositional proof systems: resolution vs. cut-free LK.Noriko H. Arai - 2000 - Annals of Pure and Applied Logic 104 (1-3):3-16.details
|
|