Decidable temporal and sequential relevant logics*

DOI10.1093/LOGCOM/EXX041MaRDI QIDQ4612410zbMATH OpenOpenAlexFDO

Authors 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

completenessdecidabilitycut eliminationrelevant logiclinear-time temporal logic

Mathematics Subject Classification ID

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

Recommendations

• A decidable intuitionistic temporal logic
• A decidable temporal relevant logic for time-dependent relevant human reasoning
• Propositional temporal logics: decidability and completeness
• Decidability w.r.t. logical consecutions of linear temporal logic extended by Since and Previous
• Decidable fragments of first-order temporal logics
• scientific article; zbMATH DE number 759442
• Decidable temporal dynamic description logic
• scientific article; zbMATH DE number 2080198
• scientific article; zbMATH DE number 4119592
• Temporal Logics

Cited in

(6)

• scientific article; zbMATH DE number 5177771 (Why is no real title available?)
• Decidable temporal dynamic description logic
• Logical consecutions in discrete linear temporal logic
• Definability and decidability of binary predicates for time granularity
• A decidable temporal relevant logic for time-dependent relevant human reasoning
• scientific article; zbMATH DE number 1502114 (Why is no real title available?)

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)