Three complexity problems in quantified fuzzy logic

Studia Logica 68 (1):143-152 (2001)
  Copy   BIBTEX

Abstract

We prove that the sets of standard tautologies of predicate Product Logic and of predicate Basic Logic, as well as the set of standard-satisfiable formulas of predicate Basic Logic are not arithmetical, thus finding a rather satisfactory solution to three problems proposed by Hájek in [H01].

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
132 (#338,322)

6 months
35 (#252,376)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On Theories and Models in Fuzzy Predicate Logics.Petr Hájek & Petr Cintula - 2006 - Journal of Symbolic Logic 71 (3):863 - 880.
Fuzzy logic and arithmetical hierarchy III.Petr Hájek - 2001 - Studia Logica 68 (1):129-142.
Fuzzy logic.Petr Hajek - 2008 - Stanford Encyclopedia of Philosophy.
On witnessed models in fuzzy logic.Petr Hájek - 2007 - Mathematical Logic Quarterly 53 (1):66-77.

View all 19 citations / Add more citations

References found in this work

S. - 2008 - In A. P. Martinich, A Hobbes Dictionary. Wiley-Blackwell. pp. 269-298.
Algebraic foundations of many-valued reasoning.Roberto Cignoli - 1999 - Boston: Kluwer Academic Publishers. Edited by Itala M. L. D'Ottaviano & Daniele Mundici.
Metamathematics of Fuzzy Logic.Petr Hájek - 1998 - Dordrecht, Boston and London: Kluwer Academic Publishers.
Fuzzy logic and arithmetical hierarchy III.Petr Hájek - 2001 - Studia Logica 68 (1):129-142.
Fuzzy logic and arithmetical hierarchy, II.Petr Hájek - 1997 - Studia Logica 58 (1):129-141.

View all 7 references / Add more references