Pages that link to "Item:Q1073004"
From MaRDI portal
The following pages link to Harvey Friedman's research on the foundations of mathematics (Q1073004):
Displaying 49 items.
- Relating first-order set theories, toposes and categories of classes (Q386623) (← links)
- An order-theoretic characterization of the Howard-Bachmann-hierarchy (Q512137) (← links)
- Proof lengths for instances of the Paris-Harrington principle (Q526964) (← links)
- An improper arithmetically closed Borel subalgebra of \(\mathcal P(\omega)\) mod FIN (Q649610) (← links)
- Kripke-style models for typed lambda calculus (Q804559) (← links)
- The associated sheaf functor theorem in algebraic set theory (Q958487) (← links)
- Mathematical intuition and the cognitive roots of mathematical concepts (Q989742) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory (Q1182475) (← links)
- Fast growing functions based on Ramsey theorems (Q1191932) (← links)
- On the strength of König's duality theorem for infinite bipartite graphs (Q1193566) (← links)
- Fuzzy sets and residuated logic (Q1193647) (← links)
- Riesz representation theorem, Borel measures and subsystems of second- order arithmetic (Q1208086) (← links)
- A study of singular points and supports of measures in reverse mathematics (Q1919546) (← links)
- Minimal bad sequences are necessary for a uniform Kruskal theorem (Q2125990) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- Finite structure for Friedman ideals of finite trees (Q2259862) (← links)
- Equivalence between Fraïssé's conjecture and Jullien's theorem (Q2368905) (← links)
- Fresh logic: Proof-theory and semantics for FM and nominal techniques (Q2372191) (← links)
- Heyting-valued interpretations for constructive set theory (Q2575769) (← links)
- Extension and interpretability (Q2658276) (← links)
- Radical theory of Scott-open filters (Q2682912) (← links)
- Theorems as Constructive Visions (Q2915840) (← links)
- Analysis of a Double Kruskal Theorem (Q2951923) (← links)
- How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems (Q3195714) (← links)
- Strong WQO Tree Theorems (Q3295147) (← links)
- Kripke Models Built from Models of Arithmetic (Q3455186) (← links)
- Intuitionistic modal logic and set theory (Q3984426) (← links)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768) (← links)
- Polyadic quantifiers (Q4733854) (← links)
- Two remarks on the Lifschitz realizability topos (Q4879901) (← links)
- CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS (Q4959663) (← links)
- From Kruskal’s theorem to Friedman’s gap condition (Q4988429) (← links)
- Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees (Q5013906) (← links)
- A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH (Q5046601) (← links)
- (Q5101339) (← links)
- The small‐is‐very‐small principle (Q5108874) (← links)
- Predicatively unprovable termination of the Ackermannian Goodstein process (Q5113418) (← links)
- WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY (Q5159496) (← links)
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS (Q5159502) (← links)
- The Interpretation Existence Lemma (Q5214783) (← links)
- EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES (Q5222519) (← links)
- On the mathematical and foundational significance of the uncountable (Q5223120) (← links)
- THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC (Q5274882) (← links)
- PREDICATIVITY THROUGH TRANSFINITE REFLECTION (Q5359565) (← links)
- Generalized quantification as substructural logic (Q5687328) (← links)
- EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER (Q6095975) (← links)
- Bachmann-Howard derivatives (Q6103503) (← links)
- INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)