The following pages link to (Q3884109):
Displayed 45 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs (Q436224) (← links)
- \(\Delta_{2}\) degrees without \(\Sigma_{1}\) induction (Q466117) (← links)
- Diophantine induction (Q584258) (← links)
- A sharpened version of McAloon's theorem on initial segments of models of \(I\Delta_ 0\) (Q685068) (← links)
- Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics (Q687278) (← links)
- The degree of a \(\Sigma_ n\) cut (Q749530) (← links)
- Fragments of arithmetic (Q762484) (← links)
- Inductive full satisfaction classes (Q920081) (← links)
- Ultrafilters and types on models of arithmetic (Q1058509) (← links)
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction (Q1082338) (← links)
- Models of arithmetic and categories with finiteness conditions (Q1097274) (← links)
- On some formalized conservation results in arithmetic (Q1264147) (← links)
- On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness (Q1295420) (← links)
- The prime number theorem and fragments of PA (Q1337499) (← links)
- Binary models generated by their tally part (Q1337500) (← links)
- \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator (Q1368581) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- Fixed points of self-embeddings of models of arithmetic (Q1709680) (← links)
- Hyperhypersimple sets and \(\Delta _ 2\) systems (Q1823933) (← links)
- Iterated trees and fragments of arithmetic (Q1892096) (← links)
- The theory of \(\kappa\)-like models of arithmetic (Q1913629) (← links)
- Transfinite induction within Peano arithmetic (Q1919522) (← links)
- Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees (Q2155503) (← links)
- On the strength of Ramsey's theorem for trees (Q2182273) (← links)
- End extensions of models of fragments of \(\mathrm{PA}\) (Q2204367) (← links)
- Tanaka's theorem revisited (Q2204369) (← links)
- Algebraic combinatorics in bounded induction (Q2216029) (← links)
- Sub-arithmetical ultrapowers: A survey (Q2276952) (← links)
- R.e. Prime powers and total rigidity (Q2281321) (← links)
- Schmerl decompositions in first order arithmetic (Q2326427) (← links)
- Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) (Q2400502) (← links)
- On axiom schemes for \(T\)-provably \(\Delta_1\) formulas (Q2449854) (← links)
- End extending models of set theory via power admissible covers (Q2672157) (← links)
- Weak and strong versions of effective transfinite recursion (Q2683778) (← links)
- A Conservation Result Concerning Bounded Theories and the Collection Axiom (Q3029007) (← links)
- Chain conditions in computable rings (Q3065750) (← links)
- The metamathematics of Stable Ramsey’s Theorem for Pairs (Q3190948) (← links)
- The atomic model theorem and type omitting (Q3642694) (← links)
- On Extensions of Models of Strong Fragments of Arithmetic (Q4205426) (← links)
- ANOTHER LOOK AT THE SECOND INCOMPLETENESS THEOREM (Q5107534) (← links)
- \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture (Q5937666) (← links)
- Bounded finite set theory (Q6047677) (← links)
- König's lemma, weak König's lemma, and the decidable fan theorem (Q6047683) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)