Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
From MaRDI portal
Publication:5059700
Recommendations
- Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables
- Monodic temporal logic with quantified propositional variables
- scientific article; zbMATH DE number 2084388
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation
- Quantified CTL: expressiveness and complexity
Cites work
- A decidable intuitionistic temporal logic
- A general method for proving decidability of intuitionistic modal logics
- A modal analysis of staged computation
- A recursively enumerable Kripke complete first-order logic not complete with respect to a first-order definable class of frames
- A survey of temporal extensions of description logics
- A temporal logic approach to binding-time analysis
- Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
- Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages
- Algorithmic properties of first-order modal logics of the natural number line in restricted languages
- Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages
- Alternating-time temporal logic
- An intuitionistic axiomatization of `eventually'
- ATL* Satisfiability Is 2EXPTIME-Complete
- Axiomatic systems and topological semantics for intuitionistic temporal logic
- Complete axiomatization and decidability of alternating-time temporal logic
- Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables
- Complexity and expressivity of propositional dynamic logics with finitely many variables
- Complexity of finite-variable fragments of products with K
- Complexity of finite-variable fragments of propositional modal logics of symmetric frames
- Complexity of intuitionistic and Visser's basic and formal logics in finitely many variables
- Complexity of intuitionistic propositional logic and its fragments
- Complexity of products of modal logics
- Computer Science Logic
- Concerning the semantic consequence relation in first-order temporal logic
- Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
- Decidable fragments of first-order temporal logics
- Decision procedures and expressiveness in the temporal logic of branching time
- Elements of finite model theory.
- Finite Kripke models and predicate logics of provability
- Handbook of modal logic
- scientific article; zbMATH DE number 5778850 (Why is no real title available?)
- scientific article; zbMATH DE number 3950488 (Why is no real title available?)
- scientific article; zbMATH DE number 3982506 (Why is no real title available?)
- scientific article; zbMATH DE number 3706414 (Why is no real title available?)
- scientific article; zbMATH DE number 3637823 (Why is no real title available?)
- scientific article; zbMATH DE number 1215479 (Why is no real title available?)
- scientific article; zbMATH DE number 1303434 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1536573 (Why is no real title available?)
- scientific article; zbMATH DE number 755666 (Why is no real title available?)
- scientific article; zbMATH DE number 1852921 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 1405444 (Why is no real title available?)
- scientific article; zbMATH DE number 1431908 (Why is no real title available?)
- scientific article; zbMATH DE number 2196586 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- scientific article; zbMATH DE number 3078481 (Why is no real title available?)
- Incompleteness of first-order temporal logic with until
- Intuitionistic linear temporal logics
- Logic in Computer Science
- LTL over description logic axioms
- Many-dimensional modal logics: theory and applications
- Monodic fragments of first-order temporal logics: 2000--2001 A.D.
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On formulas of one variable in intuitionistic propositional calculus
- On intuitionistic modal and tense logics and their classical companion logics: topological semantics and bisimulations
- On languages with two variables
- On modal logic with an intuitionistic base
- On some intuitionistic modal logics
- On the Decision Problem for Two-Variable First-Order Logic
- On the feasibility of checking temporal integrity constraints
- Propositional dynamic logic of regular programs
- Quantification in nonclassical logic. Volume I.
- Quantifiers, propositions and identity. Admissible semantics for quantified modal and substructural logics
- Recursive enumerability and elementary frame definability in predicate modal logic
- Tableau-based decision procedure for the multiagent epistemic logic with all coalitional operators for common and distributed knowledge
- Tableau-based decision procedures for logics of strategic ability in multiagent systems
- Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic
- Temporal logics in computer science. Finite-state systems
- Temporalizing description logics
- The complexity of propositional linear temporal logics
- The complexity of reasoning about knowledge and time. I: Lower bounds
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
- The intuitionistic temporal logic of dynamical systems
- The power of temporal proofs
- The Undecidability of Monadic Modal Quantification Theory
- Undecidability of First-Order Intuitionistic and Modal Logics with Two variables
- Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter
- Undecidability of modal and intermediate first-order logics with two individual variables
- Undecidability of the Logic of Partial Quasiary Predicates
Cited in
(4)- Complexity of finite-variable fragments of propositional temporal and modal logics of computation
- Computational complexity of theories of a binary predicate with a small number of variables
- Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?
- Non-axiomatizability of modal predicate logics of Dedekind-complete linear orders with constant domains
This page was built for publication: Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059700)
