Embedding logics into product logic

DOI10.1023/A:1005026229560zbMath0962.03019OpenAlexW1531159060MaRDI QIDQ1580660

Petr Hájek, David Švejda, Jan Krajíček, Matthias Baaz

Publication date: 19 April 2001

Published in: Studia Logica (Search for Journal in Brave)

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

zbMATH Keywords

fuzzy logicNP-completenesssatisfiabilityarithmetical hierarchyŁukasiewicz logicproduct logicGödel logic

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Many-valued logic (03B50)

Related Items (7)

UNDECIDABILITY AND NON-AXIOMATIZABILITY OF MODAL MANY-VALUED LOGICS ⋮ First-order satisfiability in Gödel logics: an NP-complete fragment ⋮ Introduction ⋮ Analytic calculi for product logics ⋮ SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability ⋮ A note on intervals of residuated \(\ell \)-groupoids ⋮ Complexity issues in Basic Logic

This page was built for publication: Embedding logics into product logic