Cut-free systems for three-valued modal logics

DOI10.1305/NDJFL/1093634401zbMATH Open0778.03005OpenAlexW1988289605MaRDI QIDQ1203764FDOQ1203764

Mitio Takano

Publication date: 22 February 1993

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093634401

zbMATH Keywords

sequent calculicut-elimination

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Many-valued logic (03B50) Cut-elimination and normal-form theorems (03F05)

Cited In (2)

• Subformula property in many-valued modal logics
• Cut technique in valued relational systems: Mainsprings and applications

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Three-valued logics in modal logic 👍 👎
• Cut-free sequent and tableau systems for propositional Diodorean modal logics 👍 👎
• Partial and paraconsistent three-valued logics 👍 👎
• Three-Valued Paraconsistent Propositional Logics 👍 👎
• Some modal logics based on a three-valued logic 👍 👎
• Sequent calculi for three-valued logics 👍 👎
• A semantical analysis of cut-free calculi for modal logics 👍 👎

This page was built for publication: Cut-free systems for three-valued modal logics

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