Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
From MaRDI portal
Publication:2557694
DOI10.2307/1970842zbMath0253.02040OpenAlexW2315181607WikidataQ29027329 ScholiaQ29027329MaRDI QIDQ2557694
Publication date: 1974
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1970842
Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25)
Related Items
Recursively enumerable generic sets, Automorphisms of substructure lattices in recursive algebra, On the orbits of hyperhypersimple sets, Orbits of maximal vector spaces, Nonhemimaximal degrees and the high/low hierarchy, An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees, Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets, Variations on promptly simple sets, A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets, Degrees containing members of thin Π10 classes are dense and co-dense, Boolean algebras and orbits of the lattice of r.e sets modulo the finite sets, Coding in the partial order of enumerable sets, There is no fat orbit, Computably enumerable sets that are automorphic to low sets, Splitting properties and jump classes, The Lattice of Computably Enumerable Vector Spaces, Isomorphism of lattices of recursively enumerable sets, Atomless \(r\)-maximal sets, The Complexity of Orbits of Computably Enumerable Sets, Automorphisms of the lattice of recursively enumerable sets: Orbits, Friedberg splittings of recursively enumerable sets, The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$, Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees, Recursive properties of relations on models, Codable sets and orbits of computably enumerable sets, Extension theorems, orbits, and automorphisms of the computably enumerable sets, Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets, On the orbits of computably enumerable sets, Permutations and Presentations, -MAXIMAL SETS, Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces, \(r\)-maximal major subsets, Some lowness properties and computational complexity sequences, Hierarchy of Computably Enumerable Degrees II, Simple and hyperhypersimple vector spaces, Nowhere simple sets and the lattice of recursively enumerable sets, Recursively enumerable sets and degrees, Computational complexity, speedable and levelable sets, Major subspaces of recursively enumerable vector spaces, Hyperhypersimple sets and \(\Delta _ 2\) systems, Definable properties of the computably enumerable sets, Some orbits for \({\mathcal E}\), The intervals of the lattice of recursively enumerable sets determined by major subsets, Automorphisms of the lattice of recursively enumerable sets, Orbits of computably enumerable sets: Low sets can avoid an upper cone, Splitting theorems in recursion theory, Definable Encodings in the Computably Enumerable Sets, Automorphisms of supermaximal subspaces, Determining Automorphisms of the Recursively Enumerable Sets, On orbits, of prompt and low computably enumerable sets
