参考文献:1. Baaz, M.: Infinite-valued G?del logics with 0-1-projections and relativizations. In: G?del-6. In: Lecture Notes Logic vol. 6, pp 23-3 2. Baaz M., Fasching O.: G?del logics with monotone operators. Fuzzy Sets Syst. 197(1), 3-3 (2012) CrossRef 3. Baaz, M., Preining, N.:G?del-Dummett logics. In: Cintula, P., Hájek, P., Noguera, C. (eds.) Handbook Of Mathematical Fuzzy Logic, vol. 2, pp. 585-26. College Publications, London (2011) 4. Baaz M., Veith H.: Interpolation in fuzzy logic. Arch. Math. Log. 38, 461-89 (1999) CrossRef 5. Ciabattoni A., Metcalfe G., Montagna F.: Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions. Fuzzy Sets Syst. 161(3), 369-89 (2010) CrossRef 6. Caicedo X., Rodríguez R.O.: Standard G?del modal logics. Stud. Log. 94, 189-14 (2010) CrossRef 7. Dummett M.: A propositional calculus with denumerable matrix. J. Symb. Log. 24, 97-06 (1959) CrossRef 8. Fasching, O.: G?del homomorphisms as G?del modal operators. Fundam. Inform. (2012, in press) 9. Fasching, O.: Operator extensions of Gdel logics. Ph.D. thesis, Vienna University of Technology (2011) 10. Hájek P.: On very true. Fuzzy Sets Syst. 124, 329-33 (2001) CrossRef 11. Ragaz, M.: Arithmetische Klassifikation von Formelmengen der unendlichwertigen Logik. Ph.D. Thesis, ETH Zürich (1981) 12. Scarpellini B.: Die Nichtaxiomatisierbarkeit des unendlichwertigen Pr?dikatenkalküls von ?ukasiewicz. J. Symb. Log. 27, 159-70 (1962) CrossRef 13. Takeuti G., Titani S.: Intuitionistic fuzzy logic and intuitionistic fuzzy set theory. J. Symb. Log. 49, 851-66 (1984) CrossRef 14. Trakhtenbrot B.: The impossibility of an algorithm for the decision problem for finite domains. Doklady Akad. Nauk SSSR 70, 569-72 (1950)
作者单位:Oliver Fasching (1) Matthias Baaz (2)
1. Wiedner Hauptstra?e 8/E104.2, 1040, Vienna, Austria 2. Vienna University of Technology, Wiedner Hauptstra?e 8/E104.2, 1040, Vienna, Austria
ISSN:1432-0665
文摘
We consider an extension of G?del logic by a unary operator that enables the addition of non-negative reals to truth-values. Although its propositional fragment has a simple proof system, first-order validity is Π 2-hard. We explain the close connection to Scarpellini’s result on Π 2-hardness of ?ukasiewicz’s logic.