Book contents
- Frontmatter
- Preface
- Plenary sessions
- Special sessions
- Contents
- The Number of Path-Components of a Compact Subset of Rn
- Intervals without Critical Triples
- Beyond Gödel's Theorem: Turing Nonrigidity Revisited
- Types and Indescernibles in Finite Models
- Model Theory of Modules
- Noninterpretability of Infinite Linear Orders
- Combinatorial Principles from Adding Cohen Reals
- Extensions of models of PV
- Convergence Laws for Random Graphs
- V=L and Maximize
- Towards a Categorical Foundation of Mathematics
- Strongly Minimal Sets and Geometry
- Computationally-Sound Proofs
- Lambek Calculus and Formal Languages
- Zil'ber's Trichotomy and o-minimal Structures
- The Higher Infinite in Proof Theory
- There May Be No Nowhere Dense Ultrafilter
- Towards Recursive Model Theory
- Accessible Segments of the Fast Growing Hierarchy
- Author Index
- References
Accessible Segments of the Fast Growing Hierarchy
Published online by Cambridge University Press: 24 March 2017
By
Book contents
- Frontmatter
- Preface
- Plenary sessions
- Special sessions
- Contents
- The Number of Path-Components of a Compact Subset of Rn
- Intervals without Critical Triples
- Beyond Gödel's Theorem: Turing Nonrigidity Revisited
- Types and Indescernibles in Finite Models
- Model Theory of Modules
- Noninterpretability of Infinite Linear Orders
- Combinatorial Principles from Adding Cohen Reals
- Extensions of models of PV
- Convergence Laws for Random Graphs
- V=L and Maximize
- Towards a Categorical Foundation of Mathematics
- Strongly Minimal Sets and Geometry
- Computationally-Sound Proofs
- Lambek Calculus and Formal Languages
- Zil'ber's Trichotomy and o-minimal Structures
- The Higher Infinite in Proof Theory
- There May Be No Nowhere Dense Ultrafilter
- Towards Recursive Model Theory
- Accessible Segments of the Fast Growing Hierarchy
- Author Index
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Logic Colloquium '95 , pp. 339 - 348Publisher: Cambridge University PressPrint publication year: 2017
References
(1)
“An independence result for (Π1
1 – CA) + (BI)”, Annals of Pure and Applied Logic
Vol. 23, 1987, 131–155.Google Scholar
(2)
and
“A uniform approach to fundamental sequences and subrecursive hierarchies”, Math. Logic Quarterly
Vol. 40, 1994, 273–286.Google Scholar
(3) and
“ Elementary descent recursion and proof theory”, Annals of Pure and Applied Logic
Vol. 71, 1995, 1-45.Google Scholar
(4) and
“Axioms for subrecursion theories”, in
(Eds.) Computability, Enumerability, Unsolvability, LMS Lecture Notes 224, Cambridge Univ. Press
1996, 123-138.
(5) “A jump operator for subrecursion theory”, in preparation.
(6)
“On Wainer's notation for a minimal subrecursive inaccessible ordinal”, Math. Logic Quarterly
Vol. 39, 1993, 217-227.Google Scholar
(7)
“Extension of an effectively generated class of functions by enumeration”, Colloquium Mathematicum
Vol. 6, 1958, 67-78.Google Scholar
(8)
“Slow growing versus fast growing”, Journal of Symbolic Logic
Vol. 54, 1989, 608-614.Google Scholar
(9)
“Hierarchies of provably computable functions”, in (Ed.) Mathematical Logic, Plenum Press
1990, 211-220.
(10)
“The hierarchy of terminating recursive programs over N”
, in (Ed.), Logic and Computational Complexity, Springer Lecture Notes in Computer Science
960, 1995, 281-299.Google Scholar