Harvey Friedman's research on the foundations of mathematics

zbMath0588.03001MaRDI QIDQ1073004

No author found.

Publication date: 1985

Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Gödel's theoremrecursive function theorylogics of programsrapidly growing functionsabstract set theoryAlgorithmic proceduresBorel diagonalizationBorel structures for first-order and extended logicsByerly, R. E.combinatorial properties of finite treesComputational complexity of real functionsconsistency strengthselementary recursion theoryEquality between functionalsfinite forms of the Higman and Kruskal theoremsFriedman, Harveygeneralized Turing algorithmsHarrington, L. A.Intuitionistic formal systemsIntuitionistic set theoryKfoury, A. J.Kolata, GLeivant, D.Nerode, A.NonprovabilityNonstandard modelspebble gameŠčedrov, A.Shepherdson, J. C.Simpson, S. G.Smith, R. L.Smoryński, C.Stanley, L. J.Statman, R.Steinhorn, C.subsystems of second order arithmeticvarieties of arboreal experience

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)

Related Items (50)

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

This page was built for publication: Harvey Friedman's research on the foundations of mathematics