Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
From MaRDI portal
Publication:3260571
DOI10.2307/2964290zbMATH Open0088.01601OpenAlexW2127316662WikidataQ29392709 ScholiaQ29392709MaRDI QIDQ3260571FDOQ3260571
Publication date: 1959
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2964290
Cites Work
Cited In (96)
- An enumeration of the primitive recursive functions without repetition
- Honest polynomial time reducibilities and the \(P=?NP\) problem
- Friedberg splittings of recursively enumerable sets
- Preference aggregation theory without acyclicity: the core without majority dissatisfaction
- A theorem on hyperhypersimple sets
- Optimal enumerations and optimal gödel numberings
- Numberings optimal for learning
- Effectively closed sets and enumerations
- Weakly computable real numbers
- Friedberg numberings of families of partial computable functionals
- A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
- Hypothesis spaces for learning
- Orbits of maximal vector spaces
- Learning-theoretic perspectives of acceptable numberings
- Index sets and universal numberings
- Degree spectra of real closed fields
- Control structures in hypothesis spaces: The influence on learning
- Coding in the partial order of enumerable sets
- Learning in Friedberg numberings
- Extremal numberings and fixed point theorems
- Prescribed learning of r.e. classes
- Hyperarithmetical Index Sets in Recursion Theory
- On the Degrees of Index Sets. II
- Computable one-to-one enumerations of effective domains
- The independence of control structures in abstract programming systems
- On computable enumerations. I
- Data representation and computational complexity
- On approximate decidability of minimal programs
- Uniquely universal sets
- European Summer Meeting of the Association for Symbolic Logic
- Some applications of computable one-one numberings
- Kolmogorov entropy in the context of computability theory
- Reductions between types of numberings
- The minimum of two regressive isols
- Enumerating abelian \(p\)-groups
- Inductive inference of recursive functions: Qualitative theory
- Friedberg numberings in the Ershov hierarchy
- Friedberg numberings in the Ershov hierarchy
- Computably enumerable sets and related issues
- On computable enumerations. II
- Strong reducibilities
- A Theorem on Recursively Enumerable Classes and Splinters
- On the Lattice of Recursively Enumerable Sets
- Complete Recursively Enumerable Sets
- COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS
- Computable numberings of families of infinite sets
- Enumerations of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Π</mml:mi><mml:mn>1</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:math> Classes: Acceptability and Decidable Classes
- An easy priority-free proof of a theorem of Friedberg
- The index sets of m-degrees
- Computable single-valued numerations
- Learning in Friedberg Numberings
- Some clarifications of the concept of a Garden-of-Eden configuration
- Recursively enumerable sets and degrees
- Über die Reduzierbarkeit berechenbarer Numerierungen
- Comparison of identification criteria for machine inductive inference
- Recursively enumerable classes and their application to recursive sequences of formal theories
- Index Sets and Universal Numberings
- Hypothesis Spaces for Learning
- Learning with belief levels
- Hyperhypersimple sets and \(\Delta _ 2\) systems
- A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
- Numberings Optimal for Learning
- Some effectively infinite classes of enumerations
- Classifications of computable structures
- Splitting a context-sensitive set
- Learning by the process of elimination
- Classifications of definable subsets
- A Friedberg enumeration of equivalence structures
- Metarecursively enumerable sets and admissible ordinals
- Semidecidable numberings in admissible sets
- Rogers semilattices for families of equivalence relations in the Ershov hierarchy
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets
- Effectively infinite classes of numberings and computable families of reals
- Two theorems on minimal generalized computable numberings
- Weakly Represented Families in Reverse Mathematics
- Effectively infinite classes of numberings and fixed point theorems
- Some recent research directions in the computably enumerable sets
- On a positive set theory with inequality
- Some properties of the upper semilattice of computable families of computably enumerable sets
- On Reducibility by Recursive Functions
- Theoretical computer science: computability, decidability and logic
- Things that can be made into themselves
- Two Theorems on Hyperhypersimple Sets
- Partial combinatory algebra and generalized numberings
- Prescribed Learning of R.E. Classes
- Definitional schemes for primitive recursive and computable functions
- Syntax and semantics of universal programming languages
- Closed left-r.e. sets
- On Splits of Computably Enumerable Sets
- Numberings on admissible structures over equivalence relations
- INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS
- Learning families of algebraic structures from informant
- Numberings and Randomness
- Closed Left-R.E. Sets
- Extension of partial recursive functions and functions with a recursive graph
- On effectively hypersimple sets
This page was built for publication: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3260571)
