Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
From MaRDI portal
Publication:3260571
DOI10.2307/2964290zbMath0088.01601OpenAlexW2127316662WikidataQ29392709 ScholiaQ29392709MaRDI QIDQ3260571
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
Related Items
Definitional schemes for primitive recursive and computable functions, Orbits of maximal vector spaces, The minimum of two regressive isols, European Summer Meeting of the Association for Symbolic Logic, Partial combinatory algebra and generalized numberings, A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets, Inductive inference of recursive functions: Qualitative theory, A theorem on hyperhypersimple sets, Two Theorems on Hyperhypersimple Sets, Complete Recursively Enumerable Sets, Coding in the partial order of enumerable sets, Learning-theoretic perspectives of acceptable numberings, Data representation and computational complexity, Two theorems on minimal generalized computable numberings, Extremal numberings and fixed point theorems, On the Lattice of Recursively Enumerable Sets, Recursively enumerable classes and their application to recursive sequences of formal theories, Enumerating abelian \(p\)-groups, A Friedberg enumeration of equivalence structures, Effectively infinite classes of numberings and computable families of reals, Closed left-r.e. sets, On the Degrees of Index Sets. II, Classifications of computable structures, The independence of control structures in abstract programming systems, Prescribed Learning of R.E. Classes, Learning in Friedberg Numberings, Honest polynomial time reducibilities and the \(P=?NP\) problem, Weakly Represented Families in Reverse Mathematics, On Splits of Computably Enumerable Sets, Uniquely universal sets, An easy priority-free proof of a theorem of Friedberg, Complexity of \(\Sigma^0_n\)-classifications for definable subsets, Numberings Optimal for Learning, Semidecidable numberings in admissible sets, Learning families of algebraic structures from informant, Optimal enumerations and optimal gödel numberings, Effectively closed sets and enumerations, Learning with belief levels, A Theorem on Recursively Enumerable Classes and Splinters, Degree spectra of real closed fields, Learning in Friedberg numberings, Closed Left-R.E. Sets, Friedberg numberings in the Ershov hierarchy, Some properties of the upper semilattice of computable families of computably enumerable sets, Friedberg splittings of recursively enumerable sets, On Reducibility by Recursive Functions, Weakly computable real numbers, Things that can be made into themselves, Numberings and Randomness, Index Sets and Universal Numberings, Friedberg numberings of families of partial computable functionals, Preference aggregation theory without acyclicity: the core without majority dissatisfaction, Computably enumerable sets and related issues, Some effectively infinite classes of enumerations, Friedberg numberings in the Ershov hierarchy, Syntax and semantics of universal programming languages, Numberings optimal for learning, On computable enumerations. I, On computable enumerations. II, Hypothesis spaces for learning, Splitting a context-sensitive set, Über die Reduzierbarkeit berechenbarer Numerierungen, Index sets and universal numberings, Some clarifications of the concept of a Garden-of-Eden configuration, Computable one-to-one enumerations of effective domains, Comparison of identification criteria for machine inductive inference, Kolmogorov entropy in the context of computability theory, Control structures in hypothesis spaces: The influence on learning, INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS, A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE, Hypothesis Spaces for Learning, Computable numberings of families of infinite sets, Classifications of definable subsets, Recursively enumerable sets and degrees, Prescribed learning of r.e. classes, Some applications of computable one-one numberings, Extension of partial recursive functions and functions with a recursive graph, On a positive set theory with inequality, On Approximate Decidability of Minimal Programs, Rogers semilattices for families of equivalence relations in the Ershov hierarchy, COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS, Hyperhypersimple sets and \(\Delta _ 2\) systems, Hyperarithmetical Index Sets in Recursion Theory, An enumeration of the primitive recursive functions without repetition, On effectively hypersimple sets, The index sets of m-degrees, Reductions between types of numberings, Computable single-valued numerations, Learning by the process of elimination, Strong reducibilities, 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, Metarecursively enumerable sets and admissible ordinals
Cites Work
