Three Complexity Problems in Quantified Fuzzy Logic
@article{Montagna2001ThreeCP, title={Three Complexity Problems in Quantified Fuzzy Logic}, author={F. Montagna}, journal={Studia Logica}, year={2001}, volume={68}, pages={143-152} }
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].
Topics from this paper
37 Citations
Arithmetical complexity of fuzzy predicate logics - A survey II
- Mathematics, Computer Science
- Ann. Pure Appl. Log.
- 2009
- 13
Arithmetical complexity of fuzzy predicate logics – a survey
- Mathematics, Computer Science
- Soft Comput.
- 2005
- 37
A True Unprovable Formula of Fuzzy Predicate Logic
- Mathematics, Computer Science
- Logic versus Approximation
- 2004
- 5
- Highly Influenced
Effectiveness and multivalued logics
- Mathematics, Computer Science
- J. Symb. Log.
- 2006
- 37
- Highly Influenced
References
SHOWING 1-5 OF 5 REFERENCES
Basic Fuzzy Logic is the logic of continuous t-norms and their residua
- Mathematics, Computer Science
- Soft Comput.
- 2000
- 315