Decidable temporal and sequential relevant logics*

DOI10.1093/LOGCOM/EXX041zbMATH Open1444.03081OpenAlexW2769987433MaRDI QIDQ4612410

Norihiro Kamide

Publication date: 31 January 2019

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exx041

zbMATH Keywords

completenesscut eliminationdecidabilityrelevant logiclinear-time temporal logic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Temporal logic (03B44) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (4)

Decidable temporal dynamic description logic ⋮ Title not available (Why is that?) ⋮ Definability and decidability of binary predicates for time granularity ⋮ Logical consecutions in discrete linear temporal logic

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Decidable fragments of first-order temporal logics 👍 👎
• Decidable temporal dynamic description logic 👍 👎
• A Decidable Temporal Relevant Logic for Time-Dependent Relevant Human Reasoning 👍 👎
• Propositional temporal logics: decidability and completeness 👍 👎
• A Decidable Intuitionistic Temporal Logic 👍 👎
• Temporal Logics 👍 👎

This page was built for publication: Decidable temporal and sequential relevant logics*

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