First-order Gödel logics

Annals of Pure and Applied Logic

Volumn 147, Issue 1-2, 2007, Pages 23-47

  Baaz, Matthias ^a   Preining, Norbert ^b   Zach, Richard ^c  

^a INSTITUT FÜR DISKRETE MATHEMATIK UND GEOMETRIE   (Austria)

^b UNIVERSITY OF SIENA   (Italy)

^c UNIVERSITY OF CALGARY   (Canada)

Author keywords

Axiomatizability; G del logics; Intuitionistic logic

Indexed keywords

EID: 34249295532     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2007.03.001     Document Type: Article

References (31)

1. Baaz M. Infinite-valued Gödel logics with 0-1-projections and relativizations. In: Hájek P. (Ed). Proc. Gödel'96, Logic Foundations of Mathematics, Computer Science and Physics - Kurt Gödel's Legacy. Lecture Notes in Logic vol. 6 (1996), Springer 23-33
2. Baaz M., and Ciabattoni A. A Schütte-Tait style cut-elimination proof for first-order Gödel logic. Automated Reasoning with Analytic Tableaux and Related Methods. tableaux 2002, Proceedings. LNAI vol. 2381 (2002), Springer 24-38
3. Baaz M., Ciabattoni A., and Fermüller C.G. Herbrand's theorem for prenex Gödel logic and its consequences for theorem proving. Logic for Programming and Automated Reasoning. LPAR 2001. Proceedings. LNAI vol. 2250 (2001), Springer, Cuba 201-216
4. Baaz M., Ciabattoni A., and Zach R. Quantified propositional Gödel logic. In: Voronkov A., and Parigot M. (Eds). Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000 (2000), Springer, Berlin 240-256 INAI 1955
5. Baaz M., Ciabattoni A., and Fermüller C.G. Hypersequent calculi for Gödel logics-a survey. Journal of Logic and Computation 13 (2003) 835-861
6. Baaz M., Leitsch A., and Zach R. Incompleteness of an infinite-valued first-order Gödel logic and of some temporal logics of programs. In: Börger E. (Ed). Computer Science Logic. Selected Papers from CSL'95 (1996), Springer, Berlin 1-15
7. Baaz M., Leitsch A., and Zach R. Completeness of a first-order temporal logic with time-gaps. Theoretical Computer Science 160 1-2 (1996) 241-270
8. Baaz M., Preining N., and Zach R. Characterization of the axiomatizable prenex fragments of first-order Gödel logics. 33rd International Symposium on Multiple-valued Logic. May 2003, Tokyo, Japan, Proceedings (2003), IEEE Press, Los Alamitos 175-180
9. Baaz M., Preining N., and Zach R. Completeness of a hypersequent calculus for some first-order Gödel logics with delta. 36th International Symposium on Multiple-valued Logic. May 2006, Singapore, Proceedings (2006), IEEE Press, Los Alamitos
10. Baaz M., and Veith H. An axiomatization of quantified propositional Gödel logic using the Takeuti-Titani rule. In: Buss S., Hájek P., and Pudlák P. (Eds). Proceedings of the Logic Colloquium '98. Prague. LNL vol. 13 (2000), ASL 74-87
11. Baaz M., and Zach R. Compact propositional Gödel logics. 28th International Symposium on Multiple-valued Logic. May 1998, Fukuoka, Japan, Proceedings (1998), IEEE Press, Los Alamitos 108-113
12. Baaz M., and Zach R. Hypersequents and the proof theory of intuitionistic fuzzy logic. In: Clote P.G., and Schwichtenberg H. (Eds). Computer Science Logic. CSL'2000, Proceedings. LNCS vol. 1862 (2000), Springer 178-201
13. A. Beckmann, M. Goldstern, N. Preining, Continuous Fraïssé conjecture, Order (submitted for publication)
14. Beckmann A., and Preining N. Linear Kripke frames and Gödel logics. Journal of Symbolic Logic 72 (2007) 26-44
15. Ciabattoni A. A proof-theoretical investigation of global intuitionistic (fuzzy) logic. Archive of Mathematical Logic 44 (2005) 435-457
16. Dummett M. A propositional logic with denumerable matrix. Journal of Symbolic Logic 24 (1959) 96-107
17. Gödel K. Zum intuitionistischen Aussagenkalkül. Ergebnisse eines mathematischen Kolloquiums 4 (1933) 34-38
18. Hájek P. Metamathematics of Fuzzy Logic (1998), Kluwer
19. Hájek P. A non-arithmetical Gödel logic. Logic Journal of the IGPL 13 4 (2005) 435-441
20. Horn A. Logic with truth values in a linearly ordered Heyting algebra. Journal of Symbolic Logic 34 3 (1969) 395-409
21. Kechris A.S. Classical Descriptive Set Theory (1995), Springer
22. Moschovakis Y.N. Descriptive set theory. Studies in Logic and the Foundations of Mathematics vol. 100 (1980), North-Holland, Amsterdam
23. Preining N. Gödel logics and Cantor-Bendixon analysis. In: Baaz M., and Voronkov A. (Eds). Logic for Programming and Automated Reasoning. LPAR 2002, Proceedings. LNAI vol. 2514 (2002), Springer 327-336
24. N. Preining, Complete recursive axiomatizability of Gödel logics, Ph.D. Thesis, Vienna University of Technology, Austria, 2003
25. Rosenstein J.G. Linear Orderings (1982), Academic Press
26. Scarpellini B. Die Nichtaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von Łukasiewicz. Journal of Symbolic Logic 27 (1962) 159-170
27. Takano M. Another proof of the strong completeness of the intuitionistic fuzzy logic. Tsukuba Journal of Mathematics 11 1 (1987) 101-105
28. Takeuti G., and Titani S. Intuitionistic fuzzy logic and intuitionistic fuzzy set theory. Journal of Symbolic Logic 49 (1984) 851-866
29. Takeuti G., and Titani S. Global intuitionistic fuzzy set theory. The Mathematics of Fuzzy Systems (1986), TUV-Verlag 291-301
30. van Dalen D. Intuitionistic logic. In: Gabbay D., and Guenthner F. (Eds). Handbook of Philosophical Logic: Volume III: Alternatives to Classical Logic (1986), Reidel, Dordrecht 225-340
31. Winkler R. How much must an order theorist forget to become a topologist?. Contributions of General Algebra 12, Proc. of the Vienna Conference (1999), Verlag Johannes Heyn, Klagenfurt, Austria 420-433