Abstract
We define a hypersequent calculus for Gödel logic enhanced with (fuzzy) quantifiers over propositional variables. We prove soundness, completeness and cut-elimination for this calculus and provide a detailed investigation of the so-called Takeuti-Titani rule which expresses density of the ordering of truth values. Since this rule is critical from the point of view of proof search we characterize a fragment of the logic for which it can be eliminated.
This work was partially supported by the Austrian Science Fund Projects NZ29-INF and P10282-MAT, and the Max Kade Foundation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avron, A.: Hypersequents, Logical Consequence and Intermediate Logics for Concurrency. Annals of Mathematics and Artificial Intelligence 4, 225–248 (1991)
Avron, A.: The Method of Hypersequents in Proof Theory of Propositional Non- Classical Logics. In: Logic: From Foundations to Applications. European Logic Colloquium, Keele, UK, July 20-29, pp. 1–32. Clarendon Press, Oxford (1996)
Baaz, M.: Infinite-Valued Gödel Logics with 0-1-Projections and Relativizations. In: Proceedings of Gödel 1996 - Kurt Gödel’s Legacy. LNML, vol. 6, pp. 23–33. Springer, Heidelberg (1996)
Baaz, M., Fermüller, C.: Analytic Calculi for Projective Logics. In: Murray, N.V. (ed.) TABLEAUX 1999. LNCS (LNAI), vol. 1617, pp. 36–50. Springer, Heidelberg (1999)
Baaz, M., Ciabattoni, A., Fermüller, C., Veith, H.: Proof Theory of Fuzzy Logics: Urquhart’s C and Related Logics. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 203–212. Springer, Heidelberg (1998)
Baaz, M., Ciabattoni, A., Fermüller, C., Veith, H.: On the Undecidability of Some Sub-classical First-order Logics. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 258–268. Springer, Heidelberg (1999)
Baaz, M., Veith, H.: Interpolation in Fuzzy Logic. Archive for Mathematical Logic (to appear)
Baaz, M., Veith, H.: Quantifier Elimination in Fuzzy Logic. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol. 1584, pp. 399–414. Springer, Heidelberg (1999)
Baaz, M., Veith, H.: An Axiomatization of Quantified Propositional Gödel Logic Using the Takeuti-Titani Rule. In: Proc. Logic Colloquium 1998. LNML. Springer, Heidelberg (1998) (to appear)
Ciabattoni, A.: Proof-theoretic Techniques in Many-valued Logics. Doctoral dissertation, University of Milano (1999)
Dummett, M.: A propositional calculus with denumerable matrix. J. Symbolic Logic 24, 97–106 (1959)
Dunn, J.M., Meyer, R.K.: Algebraic Completeness Results for Dummett’s LC and its Extensions. Z. math. Logik und Grundlagen der Mathematik 17, 225–230 (1971)
Dyckhoff, R.: A Deterministic Terminating Sequent Calculus for Gödel-Dummett Logic. Logic Journal of the IGPL 7, 319–326 (1999)
Egly, U., Eiter, T., Tompits, H., Woltran, S.: Quantified Boolean logic as framework for non-monotonic reasoning. Unpublished manuscript, Vienna (1999)
Gödel, K.: Zum intuitionistischen Aussagenkalkül. Anz. Akad. Wiss. Wien 69, 65–66 (1932)
Hájek, P.: Metamathematics of Fuzzy Logic. Kluwer, Dordrecht (1998)
Horn, A.: Logic with truth values in a linearly ordered Heyting algebra. J. Symbolic Logic 27, 159–170 (1962)
Sonobe, O.: A Gentzen-type Formulation of Some Intermediate Propositional Logics. Journal of Tsuda College 7, 7–14 (1975)
Takano, M.: Another proof of the strong completeness of the intuitionistic fuzzy logic. Tsukuba J. Math. 11, 851–866 (1984)
Takeuti, G., Titani, T.: Intuitionistic fuzzy logic and intuitionistic fuzzy set theory. J. Symbolic Logic 49, 851–866 (1984)
Visser, A.: On the Completeness Principle: A Study of Provability in Heyting’s Arithmetic. Annals of Math. Logic 22, 263–295 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baaz, M., Fermüller, C., Veith, H. (2000). An Analytic Calculus for Quantified Propositional Gödel Logic. In: Dyckhoff, R. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2000. Lecture Notes in Computer Science(), vol 1847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722086_12
Download citation
DOI: https://doi.org/10.1007/10722086_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67697-3
Online ISBN: 978-3-540-45008-5
eBook Packages: Springer Book Archive