scientific article; zbMATH DE number 3657754
From MaRDI portal
Publication:3856727
Cited in
(31)- Reasoning about knowledge of unawareness
- Implication of clauses is undecidable
- Dominoes and the complexity of subclasses of logical theories
- Complexity results for classes of quantificational formulas
- A theory of abstraction
- Common knowledge and update in finite environments
- The decidability of the ^* class and the axiom of foundation
- Domino-tiling games
- The undecidability of the first-order theories of one step rewriting in linear canonical systems
- Thue trees
- Decidability and completeness for open formulas of membership theories
- On timeline-based games and their complexity
- On the relative expressiveness of description logics and predicate logics
- The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
- On the Gödel class with identity
- Conservative reduction classes of Krom formulas
- Existential interpretation. II
- Asymptotic probabilities of existential second-order Gödel sentences
- The periodic domino problem revisited
- Undecidability of modal and intermediate first-order logics with two individual variables
- On the Decision Problem for Two-Variable First-Order Logic
- Decidability of ∀*∀‐Sentences in Membership Theories
- Asymptotic conditional probabilities: The non-unary case
- Quine's ‘limits of decision’
- The undecidability of the domino problem
- An aperiodic set of 11 Wang tiles
- Decision procedures using model building techniques
- Finite-model theory -- A personal perspective
- A counterexample to the periodic tiling conjecture
- The complexity of the satisfiability problem for Krom formulas
- 0-1 laws and decision problems for fragments of second-order logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3856727)
