Abstract
Two variants of monadic fuzzy predicate logic are analyzed and compared with the full fuzzy predicate logic with respect to finite model property (properties) and arithmetical complexity of sets of tautologies, satisfiable formulas and of analogous notion restricted to finite models.
Similar content being viewed by others
References
Baaz M., P. HÁjek, F. Montagna, H. Veith, 'Complexity of t-tautologies’ (to appear in Annals of Pure and Applied Logic).
HÁjek, P., Metamathematics of Fuzzy Logic, Kluwer 1998.
HÁjek, P. 'Trakhtenbrot theorem and fuzzy logic', pp. 1-8 in G. Gottlob et. al. (ed.), Computer Science Logic CSL'98, Springer 1999.
HÁjek, P., 'Fuzzy logic and arithmetical hierarchy III', Studia Logica 68 (2001), 129-142.
HÁjek P., and T. HavrÁnek, Mechanizing Hypothesis Formation, Springer 1978.
Montagna, F., 'Three complexity problems in quantified fuzzy logic', Studia Logica 68 (2001), 143-152.
Mundici, D., 'Satisfiability in many-valued sentential logic is NP-complete', Theor. Comp. Sci. 52 (1987), 145-153.
Ragaz, M., Arithmetische Klassifikation von Formelnmengen der unendlichwertigen Logik, Thesis, ETH Zürich 1981.
Ragaz, M., 'Die Unentscheidbarkeit der einstelligen unendlichwertigen Prädikatenlogik', Arch. Math. Logik 23 (1983), 129-139.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hájek, P. Monadic Fuzzy Predicate Logics. Studia Logica 71, 165–175 (2002). https://doi.org/10.1023/A:1016544704961
Issue Date:
DOI: https://doi.org/10.1023/A:1016544704961