Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem (Q5366979): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2534696914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: REVERSE MATHEMATICS OF FIRST-ORDER THEORIES WITH FINITELY MANY MODELS / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\mathsf{WKL}_0\) and induction principles in model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory. / 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: Classifying model-theoretic properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree spectra of prime models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding homogenous models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding prime models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform relationships between combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher set theory and mathematical practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodic points and subsystems of second-order arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong constructivizability of homogeneous models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4384146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively presentable prime models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slicing the Truth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On notions of computability-theoretic reduction between Π21 principles / 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: The atomic model theorem and type omitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5711891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degree spectra of homogeneous models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the <i>0</i>-basis homogeneous bounding degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of homogeneous models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneous models and decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equimorphism Types of Linear Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Questions in Reverse Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strength of Turing determinacy within second order arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite injury and <i>Σ</i><sub>1</sub>-induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary use of induction in a reversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic colloquium '77. Proceedings of the colloquium held in Wroclaw, August 1977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3867812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of Ramsey's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting an α-Recursively Enumerable Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse Mathematics: The Playground of Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3464661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Σ_{𝑛}-bounding and Δ_{𝑛}-induction / rank
 
Normal rank

Latest revision as of 12:19, 14 July 2024

scientific article; zbMATH DE number 6788984
Language Label Description Also known as
English
Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
scientific article; zbMATH DE number 6788984

    Statements

    Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2017
    0 references
    reverse mathematics
    0 references
    computable model theory
    0 references
    atomic models
    0 references
    homogeneous models
    0 references
    generics
    0 references
    induction
    0 references
    bounding
    0 references
    AMT
    0 references
    HMT
    0 references
    ATT
    0 references
    FATT
    0 references
    Weihrauch
    0 references
    uniform reduction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references