ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE

DOI10.1073/pnas.48.3.365zbMath0102.00801OpenAlexW2032725063WikidataQ36394186 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

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

This page was built for publication: ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE