Recursive equivalence types and combinatorial functions

DOI10.1090/S0002-9904-1958-10241-4zbMath0085.24801OpenAlexW1968948318MaRDI QIDQ3256315

John Myhill

Publication date: 1958

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9904-1958-10241-4

zbMATH Keywords

philosophy and foundations of mathematics

Related Items

Solution of a problem of R. Friedberg, The minimum of two regressive isols, Recursive equivalence types and groups, Extending finite subsets of an immune set, A choice free theory of Dedekind cardinals, A characterization of the orders of regressive ω-groups, On the Divergence of Extension Procedures in Isol Theory, Nonrecursive combinatorial functions, Ideals in isols containing a set of regressive isols, Bibliography of John Myhill, Myhill's work in recursion theory, Cancellation laws for polynomial-time \(p\)-isolated sets, Incompatible extensions of combinatorial functions, Extension Methods in Cardinal Arithmetic, Additive relations among recursive equivalence types, Universal isols, The divisibility of isols by powers of primes, Elementary properties of the group of isolic integers

Cites Work

• On completely recursively enumerable classes and their key arrays
• Unnamed Item