Pages that link to "Item:Q4149442"
From MaRDI portal
The following pages link to The Computational Complexity of Provability in Systems of Modal Propositional Logic (Q4149442):
Displaying 50 items.
- Three-valued logics in modal logic (Q383567) (← links)
- Loop-free calculus for modal logic S4. I (Q392988) (← links)
- Lower complexity bounds in justification logic (Q408543) (← links)
- On the complexity of the closed fragment of Japaridze's provability logic (Q482919) (← links)
- Public announcement logic with distributed knowledge: expressivity, completeness and complexity (Q484926) (← links)
- Complexity of validity for propositional dependence logics (Q515658) (← links)
- A logic for reasoning about counterfactual emotions (Q543627) (← links)
- Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction) (Q631075) (← links)
- The complexity of satisfiability for fragments of hybrid logic. I. (Q631087) (← links)
- Complexity of hybrid logics over transitive frames (Q631089) (← links)
- Coalgebraic semantics of modal logics: an overview (Q639647) (← links)
- 3-SAT = SAT for a class of normal modal logics (Q673009) (← links)
- \({\mathcal E}\)-connections of abstract description systems (Q814594) (← links)
- Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete (Q866565) (← links)
- Complexity of admissible rules (Q868660) (← links)
- Uniform interpolation and propositional quantifiers in modal logics (Q878154) (← links)
- Open answer set programming for the semantic web (Q881833) (← links)
- Symmetric blocking (Q897931) (← links)
- An NP-complete fragment of fibring logic (Q905999) (← links)
- Hypothetical datalog: Complexity and expressibility (Q915436) (← links)
- General default logic (Q987485) (← links)
- Generalized modal satisfiability (Q988571) (← links)
- The complexity of hybrid logics over equivalence relations (Q1047797) (← links)
- Hybrid logics of separation axioms (Q1047799) (← links)
- Belief, awareness, and limited reasoning (Q1096610) (← links)
- Satisfiability in many-valued sentential logic is NP-complete (Q1100196) (← links)
- A class of decidable information logics (Q1128479) (← links)
- Application of modal logic to programming (Q1150592) (← links)
- On the size of refutation Kripke models for some linear modal and tense logics (Q1155046) (← links)
- Control machines: A new model of parallelism for compositional specifications and their effective compilation (Q1177148) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- A guide to completeness and complexity for modal logics of knowledge and belief (Q1193476) (← links)
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic (Q1209339) (← links)
- Propositional dynamic logic of regular programs (Q1258296) (← links)
- A simple propositional \(\text{S}5\) tableau system (Q1295438) (← links)
- The complexity of the disjunction and existential properties in intuitionistic logic (Q1304542) (← links)
- A modal perspective on the computational complexity of attribute value grammar (Q1314274) (← links)
- Generalized quantifiers and modal logic (Q1314283) (← links)
- The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics (Q1329742) (← links)
- Conditional logics of normality: A modal approach (Q1330670) (← links)
- The complexity of concept languages (Q1363785) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- Complexity of some problems in positive and related calculi (Q1401362) (← links)
- On the polynomial-space completeness of intuitionistic propositional logic (Q1411664) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- The decision problem of provability logic with only one atom (Q1423633) (← links)
- EXPtime tableaux for ALC (Q1589576) (← links)
- On the relationship between fuzzy description logics and many-valued modal logics (Q1726404) (← links)
- Parameterized modal satisfiability (Q1759682) (← links)
- The price of universality (Q1815426) (← links)
