Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?
From MaRDI portal
Publication:6075540
DOI10.21146/2074-1472-2023-29-1-114-146OpenAlexW4378575317MaRDI QIDQ6075540
Publication date: 20 September 2023
Published in: Logical Investigations (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.21146/2074-1472-2023-29-1-114-146
Cites Work
- Elements of finite model theory.
- Trakhtenbrot theorem and first-order axiomatic extensions of MTL
- A decision method for a set of first order classical formulas and its applications to decision problems for non-classical propositional logics
- Undecidability results on two-variable logics
- Decidable fragments of first-order temporal logics
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
- Logic for programming, artificial intelligence, and reasoning. 8th international conference, LPAR 2001, Havana, Cuba, December 3--7, 2001. Proceedings.
- Undecidable fragments of elementary theories
- Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter
- Decidable fragments of first-order modal logics
- A note on hereditarily Π10- and Σ10-complete sets of sentences
- Undecidability of First-Order Intuitionistic and Modal Logics with Two variables
- Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages
- Computability and Logic
- Complexity of intuitionistic propositional logic and its fragments
- The undecidability of entailment and relevant implication
- The Undecidability of Monadic Modal Quantification Theory
- On languages with two variables
- Undecidability of modal and intermediate first-order logics with two individual variables
- On the Decision Problem for Two-Variable First-Order Logic
- On the complexity of propositional quantification in intuitionistic logic
- On the Products of Linear Modal Logics
- On modal logics betweenK × K × KandS5 × S5 × S5
- On the Restraining Power of Guards
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
- Undecidability of the Logic of Partial Quasiary Predicates
- Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
- The undecidability of the domino problem
- Products of ‘transitive” modal logics
- A note on the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Complexity of finite-variable fragments of products with K
- Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages
- Complexity of finite-variable fragments of products with non-transitive modal logics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
