Studia Logica

, Volume 68, Issue 1, pp 143-152

First online:

Three Complexity Problems in Quantified Fuzzy Logic

  • Franco MontagnaAffiliated withDipartimento di Matematica

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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].

many valued logics predicate logics undecidability