ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE

DOI10.1073/pnas.48.3.365zbMath0102.00801WikidataQ36394186 ScholiaQ36394186MaRDI QIDQ3284606

Hao Wang, Edward F. Moore, A. S. Kahr

Publication date: 1962

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.48.3.365

zbMATH Keywords

logics, foundations, philosophy

Related Items

Undecidability of modal and intermediate first-order logics with two individual variables, Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen, About the Domino Problem for Subshifts on Groups, In Memoriam: Hao Wang 1921–1995, On the Restraining Power of Guards, Turning decision procedures into disprovers, A logical approach to locality in pictures languages, Testable and untestable classes of first-order formulae, On the entropy of \(\mathbb{Z}^d\) subshifts of finite type, The complexity of the satisfiability problem for Krom formulas, Satisfiability of formulae with one \(\forall\) is decidable in exponential time, Dominoes and the complexity of subclasses of logical theories, Quantifiers as modal operators, Tiling rectangles with polyominoes, Domino-tiling games, Decidable subsets of open logic and an algorithm for R-calculus, Undecidability and nonperiodicity for tilings of the plane, Forbidden subgraphs and forbidden substructures, Two-Variable Separation Logic and Its Inner Circle, The Gödel class with identity is unsolvable, Two-by-Two Substitution Systems and the Undecidability of the Domino Problem, Classification of $AEA$ formulas by letter atoms, On the Gödel class with identity