Recursively enumerable sets and degrees
From MaRDI portal
Cites work
- [Russian Text Ignored]
- r-maximal major subsets
- A Completely Mitotic Nonrecursive R.E. Degree
- A criterion for completeness of degrees of unsolvability
- A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
- A Dichotomy of the Recursively Enumerable Sets
- A lattice property of Post's simple set
- A maximal set which is not complete
- A minimal degree less than 0’
- A minimal pair of recursively enumerable degrees
- A minimal pair of Π10 classes
- A note on universal sets
- A recursively enumerable degree which will not split over all lesser ones
- A Simple Set Which is Not Effectively Simple
- A theorem on hyperhypersimple sets
- A Theorem on Hypersimple Sets
- A Theory of Positive Integers in Formal Logic. Part I
- An Unsolvable Problem of Elementary Number Theory
- Automorphisms of the lattice of recursively enumerable sets
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Axiomatizable theories with few axiomatizable extensions
- Banach–Mazur games, comeager sets and degrees of unsolvability
- Boolean algebras, splitting theorems, and $Δ^0_2$ sets
- Bounding minimal pairs
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Complete Recursively Enumerable Sets
- Completeness, the Recursion Theorem, and Effectively Simple Sets
- Computational complexity, speedable and levelable sets
- Computing degrees of unsolvability
- Congruence relations, filters, ideals, and definability in lattices of α-recursively enumerable sets
- Constructive Analogues of the Group of Permutations of the Natural Numbers
- Creative sets
- d-simple sets, small sets, and degree classes
- Deficiency Sets and Bounded Information Reducibilities
- Degrees in Which the Recursive Sets are Uniformly Recursive
- Degrees of classes of RE sets
- Degrees of members of \(\Pi_ 1^ 0\) classes
- Degrees of recursively enumerable sets which have no maximal supersets
- Degrees of unsolvability associated with classes of formalized theories
- Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
- Degrees of Unsolvability. (AM-55)
- Determining Automorphisms of the Recursively Enumerable Sets
- Distributive Initial Segments of the Degrees of Unsolvability
- Effectively Simple Sets
- General recursive functions of natural numbers
- Hilbert's Tenth Problem is Unsolvable
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 3458600 (Why is no real title available?)
- scientific article; zbMATH DE number 2007871 (Why is no real title available?)
- scientific article; zbMATH DE number 3010765 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 3304986 (Why is no real title available?)
- scientific article; zbMATH DE number 3316917 (Why is no real title available?)
- scientific article; zbMATH DE number 3316934 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- scientific article; zbMATH DE number 3086775 (Why is no real title available?)
- Hypersimple sets with retraceable complements
- Interpolation and embedding in the recursively enumerable degrees
- Jump equivalence of the Δ20 hyperimmune sets
- Jump restricted interpolation in the recursively enumerable degrees
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- Minimal pairs and high recursively enumerable degrees
- Minimal Upper Bounds for Sequences of Recursively Enumerable Degrees
- Mitotic recursively enumerable sets
- Nowhere simple sets and the lattice of recursively enumerable sets
- On a Class of Complete Simple Sets
- On a Problem of G. E. Sacks
- On a question of G. E. Sacks
- On a Theorem of Lachlan and Martin
- On completely recursively enumerable classes and their key arrays
- On complexity properties of recursively enumerable sets
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On degrees of recursive unsolvability
- On degrees of unsolvability
- On elementary theories of some lattices or α-recursively enumerable sets
- On Group-Theoretic Decision Problems and Their Classification. (AM-68)
- On some games which are relevant to the theory of recursively enumerable sets
- On subcreative sets and S-reducibility
- On the degrees less than 0'
- On the Degrees of Index Sets
- On the Degrees of Index Sets. II
- On the Lattice of Recursively Enumerable Sets
- Post's problem and his hypersimple set
- Post's program and incomplete recursively enumerable sets.
- Prioric games and minimal degrees below $0^{(1)}$
- Productive Sets
- Quasicreative Sets
- Recursion, metarecursion, and inclusion
- Recursive Enumerability and the Jump Operator
- Recursive Functions Modulo Co-r-Maximal Sets
- Recursively enumerable many-one degrees
- Recursively Enumerable Sets and Retracing Functions
- Recursively enumerable sets of positive integers and their decision problems
- Recursively enumerable vector spaces
- Reducibility and Completeness for Sets of Integers
- Relationships Between Reducibilities
- Retraceable Sets
- Simplicity of recursively enumerable sets
- Some lowness properties and computational complexity sequences
- Some Notions of Reducibility and Productiveness
- Some theorems on R-maximal sets and major subsets of recursively enumerable sets
- Some Theorems on Classes of Recursively Enumerable Sets
- Sublattices of the Recursively Enumerable Degrees
- The class of recursively enumerable subsets of a recursively enumerabl e set
- The decision problem for recursively enumerable degrees
- The degrees of hyperhyperimmune sets
- The Degrees of Hyperimmune Sets
- The elementary theory of recursively enumerable sets
- The Friedberg-Muchnik Theorem Re-Examined
- The Halting Problem Relativized to Complements
- The impossibility of finding relative complements for recursively enumerable degrees
- The infinite injury priority method
- The Priority Method I
- The recursively enumerable degrees are dense
- The upper semi-lattice of degrees of recursive unsolvability
- The weak truth table degrees of recursively enumerable sets
- The word problem
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Three theorems on the degrees of recursively enumerable sets
- Turing degrees and many-one degrees of maximal sets
- Two Notes on Recursively Enumerable Sets
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- Two Theorems on Hyperhypersimple Sets
- Undecidable and creative theories
- Uniform enumeration operations
- w tt-Complete Sets are not Necessarily tt-Complete
- Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups
- Π10 classes and Boolean combinations of recursively enumerable sets
- ∏ 0 1 Classes and Degrees of Theories
Cited in
(71)- A low and a high hierarchy within NP
- On effectively computable realizations of choice functions
- Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
- Structural interactions of the recursively enumerable T- and W-degrees
- Intervals and sublattices of the r.e. weak truth table degrees. I: Density
- An infinite version of Arrow's theorem in the effective setting
- Not every finite lattice is embeddable in the recursively enumerable degrees
- Splitting properties and jump classes
- On the finiteness of the recursive chromatic number
- Sets of generator and automorphism bases for the enumeration degrees
- A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
- The dense simple sets are orbit complete with respect to the simple sets
- On speedable and levelable vector spaces
- The structure of the honest polynomial m-degrees
- \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator
- Binary search and recursive graph problems
- Some connections between bounded query classes and non-uniform complexity.
- \(\Pi_{1}^{0}\) classes and orderable groups
- Lattice nonembeddings and intervals of the recursively enumerable degrees
- Hyperhypersimple sets and \(\Delta _ 2\) systems
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
- The computable dimension of ordered abelian groups
- \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees
- Nonbounding and Slaman triples
- \(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets
- Transducer degrees: atoms, infima and suprema
- On the Turing degrees of minimal index sets
- Strong jump-traceability. I: The computably enumerable case
- Formalizing forcing arguments in subsystems of second-order arithmetic
- High and low Kleene degrees of coanalytic sets
- Orbits of hyperhypersimple sets and the lattice of Σ03 sets
- 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
- On relativized nondeterministic polynomial-time bounded computations
- Hierarchy of Computably Enumerable Degrees II
- Degrees of transducibility
- From index sets to randomness in ∅n: random reals and possibly infinite computations part II
- Definable structures in the lattice of recursively enumerable sets
- On the orbits of hyperhypersimple sets
- Jumps of quasi-minimal enumeration degrees
- On the embedding of α-recursive presentable lattices into the α-recursive degrees below 0′
- Density of recursively inseparable R. E. Sets and universal recrusively inseparability
- Traces, traceability, and lattices of traces under the set theoretic inclusion
- Immunity, simplicity, probabilistic complexity classes and relativizations
- Decomposition of Recursively Enumerable Degrees
- Strong reducibilities
- The theory of the recursively enumerable weak truth-table degrees is undecidable
- The degrees of conditional problems
- Initial segments of the lattice of ideals of r.e. degrees
- The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees
- Singular coverings and non-uniform notions of closed set computability
- Computable analysis and notions of continuity in \textsc{Coq}
- Nonlowness is independent from fickleness
- Notes on computable analysis
- eT-reducibility of sets
- Quantitative continuity and Computable Analysis in Coq
- Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
- From undecidability of non-triviality and finiteness to undecidability of learnability
- Separable algorithmic representations of classical systems and their applications
- Upper bounds on ideals in the computably enumerable Turing degrees
- Quotients, pure existential completions and arithmetic universes
- Inverse problems are solvable on real number signal processing hardware
- Frequency computation and bounded queries
- Training digraphs
- Infima in the d.r.e. degrees
- On the theory of the PTIME degrees of the recursive sets
- Computable de Finetti measures
- Oracle-dependent properties of the lattice of NP sets
- The density of infima in the recursively enumerable degrees
- On strongly jump traceable reals
- \(\Pi_1^0 \) classes, LR degrees and Turing degrees
This page was built for publication: Recursively enumerable sets and degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4184825)
