Linear sampling and the ∀∃∀ case of the decision problem

DOI10.2307/2272894zbMath0301.02042OpenAlexW64380676MaRDI QIDQ4055979

Harry R. Lewis, Stål Aanderaa

Publication date: 1974

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272894

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25)

Related Items (11)

The periodic domino problem revisited ⋮ Cold dynamics in cellular automata: a tutorial ⋮ Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata ⋮ On the conjugacy problem of cellular automata ⋮ Complexity results for classes of quantificational formulas ⋮ Subshifts with sparse traces ⋮ The Undecidability of the Domino Problem ⋮ An aperiodic set of 11 Wang tiles ⋮ Nilpotency and periodic points in non-uniform cellular automata ⋮ Decidability in Group Shifts and Group Cellular Automata ⋮ Nilpotent endomorphisms of expansive group actions

This page was built for publication: Linear sampling and the ∀∃∀ case of the decision problem