Three complexity problems in quantified fuzzy logic

DOI10.1023/A:1011958407631MaRDI QIDQ5951916zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Franco Montagna

Publication date 13 May 2002

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1011958407631

zbMATH Keywords

many valued logicspredicate logicundecidability

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52)

Review text

It is proved that the set 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. Also, solutions of some problems proposed by \textit{P. Hájek} [``Fuzzy logic and arithmetical hierarchy. III, Stud. Log. 68, 129-142 (2001; Zbl 0988.03042] are given.

Recommendations

• Arithmetical complexity of fuzzy predicate logics -- a survey
• On arithmetical complexity of fragments of prominent fuzzy predicate logics
• Fuzzy logic and arithmetical hierarchy. III
• Complexity issues in Basic Logic
• Arithmetical complexity of fuzzy predicate logics -- a survey. II.

Cited in

(27)

• Arithmetical complexity of fuzzy predicate logics -- a survey. II.
• A triangular norm-based fuzzy predicate logic
• Monadic fuzzy predicate logics
• Obituary: Franco Montagna (1948--2015)
• On the predicate logics of continuous t-norm BL-algebras
• A non-hyperarithmetical Gödel logic
• Triangular norm based predicate fuzzy logics
• Complexity of fuzzy probability logics. II
• On arithmetical complexity of fragments of prominent fuzzy predicate logics
• Complexity of fuzzy probability logics
• Complex fuzzy sets and complex fuzzy logic an overview of theory and applications
• On theories and models in fuzzy predicate logics
• Mathematical Fuzzy Logics
• Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
• A note on the first‐order logic of complete BL‐chains
• SOME (NON)TAUTOLOGIES OF ŁUKASIEWICZ AND PRODUCT LOGIC
• Vagueness and formal fuzzy logic: some criticisms
• A Henkin-style proof of completeness for first-order algebraizable logics
• Notes on Strong Completeness in Łukasiewicz, Product and BL Logics and in Their First-Order Extensions
• Complexity and Definability Issues in LFormula
• On witnessed models in fuzzy logic II
• Effectiveness and multivalued logics
• Logic versus Approximation
• Complexity of t-tautologies
• Complexity issues in Basic Logic
• Arithmetical complexity of fuzzy predicate logics -- a survey
• Provability in predicate product logic

This page was built for publication: Three complexity problems in quantified fuzzy logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951916)