The elementary theory of recursively enumerable sets

DOI10.1215/S0012-7094-68-03513-8zbMath0281.02043OpenAlexW2048588931MaRDI QIDQ1843563

Alistair H. Lachlan

Publication date: 1968

Published in: Duke Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/s0012-7094-68-03513-8

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (25)

On the Σ₂-theory of the upper semilattice of Turing degrees ⋮ Duality, non-standard elements, and dynamic properties of r.e. sets ⋮ THE ∀∃ THEORY OF PEANO Σ₁ SENTENCES ⋮ A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets ⋮ Diagonals and -maximal sets ⋮ Coding in the partial order of enumerable sets ⋮ Embedding relations in the lattice of recursively enumerable sets ⋮ The complexity of recursion theoretic games ⋮ One hundred and two problems in mathematical logic ⋮ Decidability of the AE-theory of the lattice of \({\Pi}_1^0\) classes ⋮ Maximality in effective topology ⋮ Codable sets and orbits of computably enumerable sets ⋮ Computably enumerable sets and related issues ⋮ Almost complemented \(\Pi^{0}_{1}\) classes ⋮ -MAXIMAL SETS ⋮ \(r\)-maximal major subsets ⋮ Turing computability: structural theory ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy ⋮ Recursively enumerable sets and degrees ⋮ Computational complexity, speedable and levelable sets ⋮ Simplicity in effective topology ⋮ Decision problem for separated distributive lattices ⋮ The intervals of the lattice of recursively enumerable sets determined by major subsets ⋮ Automorphisms of the lattice of recursively enumerable sets ⋮ Global and local admissibility. II. Major subsets and automorphisms

This page was built for publication: The elementary theory of recursively enumerable sets