You are not currently logged in.
Access JSTOR through your library or other institution:
Three Complexity Problems in Quantified Fuzzy Logic
Studia Logica: An International Journal for Symbolic Logic
Vol. 68, No. 1, Methods for Investigating Self-Referential Truth (Jun., 2001), pp. 143-152
Published by: Springer
Stable URL: http://www.jstor.org/stable/20016302
Page Count: 10
You can always find the topics here!Topics: Fuzzy logic, Arithmetic, Product standards, Educational evaluation, Natural numbers, Predicates, Integers
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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].
Studia Logica: An International Journal for Symbolic Logic © 2001 Springer