Normal natural deduction proofs (in non-classical logics)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2605 LNAI, Issue , 2005, Pages 169-191

  Sieg, Wilfried ^a   Cittadini, Saverio ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF SIENA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; INTERCALATION; SEMANTICS; THEOREM PROVING;

INTERCALATION CALCULI; INTUITIONISTIC SENTENTIAL; LOGICAL RESTRICTIONS; SEARCH SPACES;

FORMAL LOGIC;

EID: 36849048244     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-32254-2_11     Document Type: Article

References (20)

1. A. Avron, F. Honsell, M. Miculan, and C. Paravano. Encoding Modal Logics in Logical Frameworks. Studia Logica, 60(1):161-208, 1998.
2. D. Basin, S. Matthews, and L. Viganò. Natural Deduction for Non-Classical Logics. Studia Logica, 60(1):119-160, 1998.
3. J. Byrnes. Proof Search and Normal Forms for Natural Deductions. PhD thesis, Carnegie Mellon University, 1999.
4. S. Cittadini. Intercalation calculus for intuitionistic propositional logic. Technical Report PHIL-29, Philosophy, Methodology, and Logic, Carnegie Mellon University, 1992.
5. S. Cittadini. Deduzione Naturale e Ricerca Automatica di Dimostrazioni in varie logiche: il Calcolo delle Intercalazioni. In C. Cellucci, M. C. Di Maio, and G. Roncaglia, editors, Atti del Congresso Logica e filosofia della scienza: problemi e prospettive, Lucca, 7-10 gennaio 1993, pages 583-591, Pisa, 1994. Edizioni ETS.
6. D. van Dalen. Logic and Structure. Springer-Verlag, Berlin-Heidelberg-New York, second edition, 1989.
7. R. Dyckhoff. Contraction-free sequent calculi for intuitionistic logic. The Journal of Symbolic Logic, 57(3):795-807, 1992.
8. M. Fitting. Intuitionistic Logic Model Theory and Forcing. North-Holland Publishing Company, Amsterdam-London, 1969.
9. M. Fitting. Proof Methods for Modal and Intuitionistic Logic. D. Reidel Publishing Company, Dordrecht/Boston/Lancaster, 1983.
10. J. Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, Cambridge, 1989.
11. R. Harrop. Concerning formulas of the types A → B V C, A → (Ex)B(x) in intuitionistic formal systems. The Journal of Symbolic Logic, 25(1):27-32, 1960.
12. D. Prawitz. Natural Deduction: A Proof-Theoretical Study. Almqvist & Wiskell, Stockholm, 1965.
13. N. Shankar. Proof search in the intuitionistic sequent calculus. In D. Kapur, editor, Automated Deduction: CADE-11, vol. 607 of LNCS, pages 522-536, Berlin, 1992. Springer-Verlag.
14. W. Sieg. Mechanisms and Search: Aspects of Proof Theory. AILA Preprint 19, Associazione Italiana di Logica e sue Applicazioni, Padova, 1992.
15. W. Sieg and J. Byrnes. Normal Natural Deduction Proofs (in classical logic). Studia Logica, 60(1):67-106, 1998.
16. W. Sieg and S. Cittadini. Normal Natural Deduction Proofs (in non-classical logics). Rapporto Matematico n. 351, Dipartimento di Matemacute;tica, Università di Siena, 1998.
17. W. Sieg and R. Scheines. Searching for proofs (in sentential logic). In L. Burkholder, editor, Philosophy and the Computer, pages 137-159. Westview Press, Boulder, San Francisco, Oxford, 1992.
18. R. Statman. Intuitionistic propositional logic is polynomial-space complete. Theoretical Computer Science, 9(1):67-72, 1979.
19. N. Tennant. Antologic. Edinburgh University Press, Edinburgh, 1992.
20. L. A. Wallen. Automated Proof Search in Non-Classical Logics. MIT Press, Cambridge, Mass., 1990.