Pages that link to "Item:Q3642694"
From MaRDI portal
The following pages link to The atomic model theorem and type omitting (Q3642694):
Displaying 35 items.
- On the strength of the finite intersection principle (Q375889) (← links)
- Infinite dimensional proper subspaces of computable vector spaces (Q402446) (← links)
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs (Q436224) (← links)
- Degrees bounding principles and universal instances in reverse mathematics (Q490869) (← links)
- The thin set theorem for pairs implies DNR (Q894259) (← links)
- An example of a theory without weakly (\(\Sigma\) ,\(\Sigma\) )-atomic models (Q1064318) (← links)
- Refining the taming of the reverse mathematics zoo (Q1633897) (← links)
- On the uniform computational content of the Baire category theorem (Q1633900) (← links)
- Book review of: D. R. Hirschfeldt, Slicing the truth. On the computable and reverse mathematics of combinatorial principles (Q1680523) (← links)
- \(\mathsf{WKL}_0\) and induction principles in model theory (Q2344719) (← links)
- Dominating the Erdős-Moser theorem in reverse mathematics (Q2400499) (← links)
- The reverse mathematics of non-decreasing subsequences (Q2402955) (← links)
- Baire categoricity and \(\Sigma_1^0\)-induction (Q2443120) (← links)
- Weakly Represented Families in Reverse Mathematics (Q2970957) (← links)
- Strength and Weakness in Computable Structure Theory (Q2970966) (← links)
- THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES (Q2976345) (← links)
- Reverse Mathematics: The Playground of Logic (Q3163663) (← links)
- Iterative Forcing and Hyperimmunity in Reverse Mathematics (Q3195708) (← links)
- Effective prime uniqueness (Q4592760) (← links)
- HENKIN CONSTRUCTIONS OF MODELS WITH SIZE CONTINUUM (Q4632538) (← links)
- On the logical strengths of partial solutions to mathematical problems (Q4642696) (← links)
- Model completions and omitting types (Q4842638) (← links)
- A characterization of the <i>0</i>-basis homogeneous bounding degrees (Q4931102) (← links)
- Reduction games, provability and compactness (Q5055312) (← links)
- THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS (Q5067874) (← links)
- Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees (Q5189151) (← links)
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS (Q5346692) (← links)
- Any FIP real computes a 1-generic (Q5347283) (← links)
- The finite intersection principle and genericity (Q5360372) (← links)
- Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem (Q5366979) (← links)
- SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS (Q5401600) (← links)
- Cohesive avoidance and strong reductions (Q5496327) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)
- ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS (Q6103458) (← links)
- The reverse mathematics of \textsf{CAC for trees} (Q6642882) (← links)
