Abstract
The main goal of the paper is to suggest some analytic proof systems for LC and its finite-valued counterparts which are suitable for proof-search. This goal is achieved through following the general Rasiowa-Sikorski methodology for constructing analytic proof systems for semantically-defined logics. All the systems presented here are terminating, contraction-free, and based on invertible rules, which have a local character and at most two premises.
Similar content being viewed by others
References
Avellone, A., M. Ferrari, P. Miglioli. Duplication-free Tableaux Calculi Together with Cut-free and Contraction-free Sequent Calculi for the Interpolable Propositional Intermediate Logics. Logic J. IGPL, 7:447-480, 1999.
Avron, A. Using Hypersequents in Proof Systems for Non-classical Logics. Annals of Mathematics and Artificial Intelligence, 4:225-248, 1991.
Avron, A. A Tableaux System for Gödel-Dummett Logic Based on a Hypersequential Calculus. In Proc. of TABLEAUX'2000, LNAI 1847 (R. Dyckhoff, Ed.) Springer Verlag, pp. 98-111, 2000.
Baaz, M., G. C. Fermüller. Analytic Calculi for Projective Logics. In Proc. of TABLEAUX'99, LNCS 1617, pp. 36-50, Springer-Verlag, Berlin, 1999.
Dunn, J.M., R.K. Meyer. Algebraic Completeness Results for Dummett's LC and its extensions. Z. math. Logik und Grundlagen der Mathematik, 17:225-230, 1971.
Dummett, M. A Propositional Calculus with a Denumerable matrix. Journal of Symbolic Logic, 24:96-107, 1959.
Dyckhoff, R. A Deterministic Terminating Sequent Calculus for Gödel-Dummett Logic.Logic J. IGPL, 7:319-326, 1999.
Gödel, K. On the Intuitionistic Propositional Calculus, 1933. In Collected Work, Vol. 1, edited by S. Feferman et al, Oxford University Press, 1986.
Hajek, P. Metamathematics of Fuzzy Logic. Kluwer Academic Publishers, 1998.
Konikowska, B. Rasiowa-Sikorski deduction system: a handy tool for Computer Science Logic. In Proceedings WADT'98, LNCS 1589, pp. 183-197, Springer-Verlag, Berlin, 1999.
Konikowska, B. Rasiowa-Sikorski Deduction Systems in Computer Science Applications. To appear in a Special Issue of Theoretical Computer Science.
Konikowska, B. Rasiowa-Sikorski Deduction Systems: Fundamentals and Applications. Tutorial at the Tableaux 2000 Conference, St Andrews, Scotland, July 4–7 2000, http://www.dcs.st-and.ac.uk/~tab2000/Tutorials/Konikowska.ps.
Rasiowa, H., R. Sikorski. The mathematics of metamathematics. Warsaw, PWN (Polish Scientific Publishers), 1963.
Sonobe, O. A Gentzen-type Formulation of Some Intermediate Propositional Logics. Journal of Tsuda College, 7:7-14, 1975.
Troelstra, A.S., H. Schwichtenberg. Basic Proof Theory, en2nd Edition. Cambridge University Press, 2000.
Visser, A. On the Completeness Principle: A study of provability in Heyting's arithmetic. Annals of Mathematical Logic, 22:263-295, 1982.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Avron, A., Konikowska, B. Decomposition Proof Systems for Gödel-Dummett Logics. Studia Logica 69, 197–219 (2001). https://doi.org/10.1023/A:1013813806341
Issue Date:
DOI: https://doi.org/10.1023/A:1013813806341