The following pages link to (Q3395521):
Displaying 50 items.
- A note on typed truth and consistency assertions (Q263089) (← links)
- Reverse mathematics, well-quasi-orders, and Noetherian spaces (Q283113) (← links)
- Reverse complexity (Q287279) (← links)
- Inductive inference and reverse mathematics (Q324252) (← links)
- Reverse mathematics and marriage problems with finitely many solutions (Q335003) (← links)
- A note on definability in fragments of arithmetic with free unary predicates (Q365661) (← links)
- Collapsing probabilistic hierarchies. I (Q384407) (← links)
- Reverse mathematics and initial intervals (Q386152) (← links)
- Nonstandard second-order arithmetic and Riemann's mapping theorem (Q386626) (← links)
- Constructive Zermelo-Fraenkel set theory and the limited principle of omniscience (Q386630) (← links)
- Propagation of partial randomness (Q386647) (← links)
- Infinite dimensional proper subspaces of computable vector spaces (Q402446) (← links)
- Subsets coded in elementary end extensions (Q403405) (← links)
- The Peirce translation (Q408162) (← links)
- Expressive power of digraph solvability (Q409316) (← links)
- Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\) (Q412061) (← links)
- Aligning the weak König lemma, the uniform continuity theorem, and Brouwer's fan theorem (Q424539) (← links)
- A simple proof and some difficult examples for Hindman's theorem (Q424579) (← links)
- Reverse mathematics and properties of finite character (Q435197) (← links)
- Classes and truths in set theory (Q450946) (← links)
- Comparing Peano arithmetic, Basic Law V, and Hume's Principle (Q450961) (← links)
- Computing maximal chains (Q453200) (← links)
- A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP (Q476116) (← links)
- Categorical characterizations of the natural numbers require primitive recursion (Q476119) (← links)
- The limits of determinacy in second order arithmetic: consistency and complexity strength (Q480816) (← links)
- A disquotational theory of truth as strong as \(Z_2^-\) (Q496323) (← links)
- Effective asymptotic regularity for one-parameter nonexpansive semigroups (Q499259) (← links)
- The weakness of being cohesive, thin or free in reverse mathematics (Q503277) (← links)
- Proper divisibility in computable rings (Q504325) (← links)
- The strength of the Grätzer-Schmidt theorem (Q506962) (← links)
- An order-theoretic characterization of the Howard-Bachmann-hierarchy (Q512137) (← links)
- Notes on computable analysis (Q519888) (← links)
- Reverse mathematics and order theoretic fixed point theorems (Q527337) (← links)
- Algebraic structures computable without delay (Q528478) (← links)
- Metric structures and probabilistic computation (Q541224) (← links)
- A complexity analysis of functional interpretations (Q557798) (← links)
- Set existence axioms for general (not necessarily countable) stability theory (Q580327) (← links)
- Theories of truth without standard models and Yablo's sequences (Q622620) (← links)
- The maximal linear extension theorem in second order arithmetic (Q634769) (← links)
- Nonstandard arithmetic and recursive comprehension (Q636343) (← links)
- The determinacy strength of \(\Pi_2^1\)-comprehension (Q636381) (← links)
- More infinity for a better finitism (Q636387) (← links)
- Set systems: order types, continuous nondeterministic deformations, and quasi-orders (Q653312) (← links)
- Hilbert versus Hindman (Q661295) (← links)
- The consistency of arithmetic (Q666895) (← links)
- The self-embedding theorem of \(\text{WKL}_ 0\) and a non-standard method (Q676310) (← links)
- Computability of countable subshifts in one dimension (Q693067) (← links)
- Algorithmic randomness, reverse mathematics, and the dominated convergence theorem (Q714719) (← links)
- Some notes on truths and comprehension (Q722023) (← links)
- Generalizing classical and effective model theory in theories of operations and classes (Q810008) (← links)
