Pages that link to "Item:Q3284606"
From MaRDI portal
The following pages link to ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE (Q3284606):
Displaying 18 items.
- A logical approach to locality in pictures languages (Q295631) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- On the entropy of \(\mathbb{Z}^d\) subshifts of finite type (Q676028) (← links)
- The complexity of the satisfiability problem for Krom formulas (Q800915) (← links)
- Satisfiability of formulae with one \(\forall\) is decidable in exponential time (Q915716) (← links)
- Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
- Quantifiers as modal operators (Q1150594) (← links)
- Tiling rectangles with polyominoes (Q1361145) (← links)
- Domino-tiling games (Q1822501) (← links)
- Decidable subsets of open logic and an algorithm for R-calculus (Q2515454) (← links)
- Undecidability and nonperiodicity for tilings of the plane (Q2540183) (← links)
- Simulations and the lamplighter group (Q2694797) (← links)
- Forbidden subgraphs and forbidden substructures (Q2758062) (← links)
- Two-Variable Separation Logic and Its Inner Circle (Q2957697) (← links)
- The Gödel class with identity is unsolvable (Q3317080) (← links)
- (Q5092374) (← links)
- An aperiodic set of 11 Wang tiles (Q5162865) (← links)
- Turning decision procedures into disprovers (Q5505144) (← links)
