Myhill's work in recursion theory (Q1192344): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Recursive isomorphism” and effectively extensible theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4769050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3247126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isols and the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The universal properties of Dedekind finite cardinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompatible extensions of combinatorial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of unsolvability associated with classes of formalized theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uniqueness of finite division for recursive equivalence types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Divergence of Extension Procedures in Isol Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Properties of ∀∃ Models in the Isols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Creative sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive equivalence types and combinatorial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Category methods in recursion theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to isols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to isolic integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine correct non-standard models in the isols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank

Latest revision as of 12:32, 16 May 2024

scientific article
Language Label Description Also known as
English
Myhill's work in recursion theory
scientific article

    Statements

    Myhill's work in recursion theory (English)
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    The authors discuss, from the present-day point of view, John Myhill's contribution to recursion theory. The isomorphism theorems are presented using a new, uniform method of proof. J. Myhill's theorem on isomorphism of creative sets, the theorem on recursive equivalence (recursive analogue of Cantor-Bernstein theorem), his investigations on combinatorial functions and the application of the category method to recursion theory are thoroughly discussed. New and detailed proofs to most of these theorems are given. For example, the Myhill results stating that (i) there are isols which are neither even nor odd, and (ii) the ring \(\Lambda^*\) has zero divisors, are reproved using the Baire category theorem. A theorem on recursive combinatorial functions published by Myhill without proof is provided with a proof ``he might have done''. A short guide to the references is given.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    recursive equivalence types
    0 references
    isomorphism theorems
    0 references
    creative sets
    0 references
    combinatorial functions
    0 references
    isols
    0 references
    Baire category
    0 references