Three complexity problems in quantified fuzzy logic

Studia Logica 68 (1):143-152 (2001)
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].
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1011958407631
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,567
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
On Theories and Models in Fuzzy Predicate Logics.Petr Hájek & Petr Cintula - 2006 - Journal of Symbolic Logic 71 (3):863 - 880.
On the Predicate Logics of Continuous T-Norm BL-Algebras.Franco Montagna - 2004 - Archive for Mathematical Logic 44 (1):97-114.
On Witnessed Models in Fuzzy Logic II.Petr Hájek - 2007 - Mathematical Logic Quarterly 53 (6):610-615.
Provability in Predicate Product Logic.Michael C. Laskowski & Shirin Malekpour - 2007 - Archive for Mathematical Logic 46 (5-6):365-378.

View all 10 citations / Add more citations

Similar books and articles
Added to PP index

Total downloads
17 ( #288,882 of 2,180,898 )

Recent downloads (6 months)
6 ( #38,327 of 2,180,898 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums