NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS (Q2925331): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Chi Tat Chong / rank
Normal rank
 
Property / author
 
Property / author: Chi Tat Chong / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133902039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding minimal pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: An easy priority-free proof of a theorem of Friedberg / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to: “On the strength of Ramsey's Theorem for pairs” / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of Ramsey's theorem for pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cohesive set which is not high / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey's theorem and recursion theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fine structure of the constructible hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial principles weaker than Ramsey's Theorem for pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Working below a high recursively enumerable degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strength of the rainbow Ramsey Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random reals, the rainbow Ramsey theorem, and arithmetic conservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse mathematics and Ramsey's property for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse mathematics, computability, and partitions of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The metamathematics of Stable Ramsey’s Theorem for Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable generic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Friedberg Numbering in Fragments of Peano Arithmetic and <i>α</i>-Recursion Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On suborderings of the α-recursively enumerable α-degrees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:29, 9 July 2024

scientific article
Language Label Description Also known as
English
NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS
scientific article

    Statements

    NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS (English)
    0 references
    0 references
    0 references
    0 references
    21 October 2014
    0 references
    nonstandard models
    0 references
    fragments of Peano arithmetic
    0 references
    reverse mathematics
    0 references
    reverse recursion theory
    0 references
    combinatorial principles
    0 references
    Ramsey's theorem for pairs
    0 references
    survey paper
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references