Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2022.04.056 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.056 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4225423377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal logics for reasoning about infinite unions and intersections of binary relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general method for proving decidability of intuitionistic modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-dimensional modal logic as a framework for spatio-temporal reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modal perspective on the computational complexity of attribute value grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding $$\mathsf {ATL^*}$$ Satisfiability by Tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal Logics in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics in simple cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic epistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures and expressiveness in the temporal logic of branching time / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Sometimes” and “not never” revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On modal logic with an intuitionistic base / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-dimensional modal logics: theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of modal and intermediate first-order logics with two individual variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of modal logics, part 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantification in nonclassical logic. Volume I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete axiomatization and decidability of alternating-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tableau-based decision procedures for logics of strategic ability in multiagent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reasoning about knowledge and time. I: Lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of First-Order Intuitionistic and Modal Logics with Two variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extensions of the modal logic <i>K</i>5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On formulas of one variable in intuitionistic propositional calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics of public communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: FM 2009: Formal methods. Second world congress, Eindhoven, The Netherlands, November 2--6, 2009. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3647277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of intuitionistic propositional logic and its fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of finite-variable fragments of propositional modal logics of symmetric frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and expressivity of propositional dynamic logics with finitely many variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5224585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5104724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive enumerability and elementary frame definability in predicate modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of finite-variable fragments of products with <b>K</b> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of QLTL and QCTL with two variables and one monadic predicate letter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of finite-variable fragments of products with non-transitive modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: ATL* Satisfiability Is 2EXPTIME-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiagent Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem of provability logic with only one atom / rank
 
Normal rank
Property / cites work
 
Property / cites work: ATL Satisfiability is Indeed EXPTIME-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable fragments of first-order modal logics / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2022.04.056 / rank
 
Normal rank

Latest revision as of 06:08, 17 December 2024

scientific article
Language Label Description Also known as
English
Complexity of finite-variable fragments of propositional temporal and modal logics of computation
scientific article

    Statements

    Complexity of finite-variable fragments of propositional temporal and modal logics of computation (English)
    0 references
    0 references
    0 references
    24 June 2022
    0 references
    branching-time temporal logics
    0 references
    alternating-time temporal logics
    0 references
    modal logics
    0 references
    finite-variable fragments
    0 references
    computational complexity
    0 references
    satisfiability problem
    0 references
    validity problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references