On the size of refutation Kripke models for some linear modal and tense logics

DOI10.1007/BF00713542zbMATH Open0466.03008OpenAlexW1981561399MaRDI QIDQ1155046FDOQ1155046

Authors: S. H. Smith 

Publication date: 1980

Published in: Studia Logica (Search for Journal in Brave)

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

zbMATH Keywords

satisfiability problemfinite model property

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Title not available (Why is that?)
• The complexity of theorem-proving procedures
• Title not available (Why is that?)
• The Computational Complexity of Provability in Systems of Modal Propositional Logic

Cited In (12)

• Backdoors for linear temporal logic
• Title not available (Why is that?)
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
• Undecidability of multi-modal hybrid logics
• First-order rewritability of ontology-mediated queries in linear temporal logic
• The complexity of the temporal logic with ``until over general linear time
• The complexity of propositional linear temporal logics in simple cases
• A Cookbook for Temporal Conceptual Data Modelling with Description Logics
• All finitely axiomatizable tense logics of linear time flows are coNP-complete
• Conditional logics of normality: A modal approach
• Complexity of hybrid logics over transitive frames
• Canonical formulas for K4. Part II: Cofinal subframe logics

This page was built for publication: On the size of refutation Kripke models for some linear modal and tense logics

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