Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones-Reference-Cited by-同舟云学术

Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones

Published:1995-10 Issue:5 Volume:34 Page:313-330
ISSN:0933-5846
Container-title:Archive for Mathematical Logic
language:en
Short-container-title:Arch Math Logic

Author:

Weiermann Andreas

Publisher

Springer Science and Business Media LLC

Subject

Logic,Philosophy

Link

http://link.springer.com/article/10.1007/BF01387511/fulltext.html

Reference62 articles.

1. Aczel, P.: Another elementary treatment of Girard's result connecting the slow and fast growing hierarchies of numbertheoretic functions. Preprint (1980)

2. Aoyama, K., Kadota, N.: Some extensions of built-upness on systems of fundamental sequences. Z math Logik Grundl Math36, 357–364 (1990)

3. Arai, T.: A slow growing analogue to Buchholz' proof. Ann Pure Appl Logic54, 101–120 (1991)

4. Barwise, J.: Admissible sets and structures. Berlin Heidelberg New York: Springer 1975

5. Buchholz, W.: Eine Erweiterung der Schnitteliminationsmethode. Habilitationsschrift, München (1977)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Epsilon Numbers;Ordinal Analysis with an Introduction to Proof Theory;2020

2. Goodstein sequences for prominent ordinals up to the ordinal ofΠ11−CA0;Annals of Pure and Applied Logic;2013-12

3. Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results;Annals of Pure and Applied Logic;2005-10

4. Classifying Recursive Functions;Handbook of Computability Theory;1999

5. Term rewriting theory for the primitive recursive functions;Annals of Pure and Applied Logic;1997-02