On Gentzen relations associated with finite-valued logics preserving degrees of truth
algebraic logicdistributive latticesGentzen relationGentzen systemlogics preserving degrees of truthpseudocomplemented distributive lattices
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Many-valued logic (03B50) Proof theory in general (including proof-theoretic semantics) (03F03) Cut-elimination and normal-form theorems (03F05) Other algebras related to logic (03G25) Abstract algebraic logic (03G27)
The author describes the content of the article in a clear and compact way, and hence we quote the abstract: When considering \(m\)-sequents, it is always possible to obtain an \(m\)-sequent calculus VL for every \(m\)-valued logic (defined from an arbitrary finite algebra \(L\) of cardinality \(m\)) following for instance the works of the Vienna Group for Multiple-valued Logics. The Gentzen relations associated with the calculi VL are always finitely equivalential but might not be algebraizable. In this paper we associate an algebraizable 2-Gentzen relation with every sequent calculus VL in a uniform way, provided the original algebra \(L\) has a reduct that is a distributive lattice or a pseudocomplemented distributive lattice. We also show that the sentential logic naturally associated with the provable sequents of this algebraizable Gentzen relation is the logic that preserves degrees of truth with respect to the original algebra (in contrast with the more common logic that merely preserves truth). Finally, for some particular logics we obtain 2-sequent calculi that axiomatize the algebraizable Gentzen relations obtained so far.
- On Gentzen Systems Associated with the Finite Linear MV-algebras
- Finitely equivalential Gentzen systems associated with arbitrary finite algebras
- On the infinite-valued Łukasiewicz logic that preserves degrees of truth
- Many-place sequent calculi for finitely-valued logics
- scientific article; zbMATH DE number 35414
- A Strong Completeness Theorem for the Gentzen systems associated with finite algebras
- An algebraic approach to non-classical logics
- Classic-Like Analytic Tableaux for Finite-Valued Logics
- Commodious axiomatization of quantifiers in multiple-valued logic
- Correspondences between gentzen and hilbert systems
- Finitely equivalential Gentzen systems associated with arbitrary finite algebras
- Gentzen-type systems, resolution and tableaux
- scientific article; zbMATH DE number 440121 (Why is no real title available?)
- scientific article; zbMATH DE number 3501559 (Why is no real title available?)
- scientific article; zbMATH DE number 777292 (Why is no real title available?)
- Logics preserving degrees of truth from varieties of residuated lattices
- MUltlog 1.0: towards an expert system for many-valued logics
- On Gentzen Systems Associated with the Finite Linear MV-algebras
- On the infinite-valued Łukasiewicz logic that preserves degrees of truth
- Protoalgebraic Gentzen systems and the cut rule
- Sequents in many valued logic I
This page was built for publication: On Gentzen relations associated with finite-valued logics preserving degrees of truth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368479)