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)
Gödel's theorem; recursive function theory; logics of programs; rapidly growing functions; abstract set theory; Algorithmic procedures; Borel diagonalization; Borel structures for first-order and extended logics; Byerly, R. E.; combinatorial properties of finite trees; Computational complexity of real functions; consistency strengths; elementary recursion theory; Equality between functionals; finite forms of the Higman and Kruskal theorems; Friedman, Harvey; generalized Turing algorithms; Harrington, L. A.; Intuitionistic formal systems; Intuitionistic set theory; Kfoury, A. J.; Kolata, G; Leivant, D.; Nerode, A.; Nonprovability; Nonstandard models; pebble 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 arithmetic; varieties of arboreal experience
01A70: Biographies, obituaries, personalia, bibliographies
03-06: Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations
Related Items