Finite-valued reductions of infinite-valued logics

DOI10.1007/s001530100118zbMath1032.03017OpenAlexW2060345474MaRDI QIDQ1407546

Stefano Aguzzoli, Brunella Gerla

Publication date: 16 September 2003

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530100118

zbMATH Keywords

sequent calculusmany-valued logicproduct logicGödel logicinfinite-valued Łukasiewicz logictautology problemsequence formalisation

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Many-valued logic (03B50) Abstract deductive systems (03B22)

Related Items (5)

Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction ⋮ Mathematical Fuzzy Logics ⋮ Analytic calculi for product logics ⋮ An asymptotically tight bound on countermodels for Łukasiewicz logic ⋮ Complexity issues in Basic Logic

This page was built for publication: Finite-valued reductions of infinite-valued logics