Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions-Reference-Cited by-同舟云学术

Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions

Published:2006 Issue: Volume: Page:556-570
ISSN:0302-9743
Container-title:Logical Approaches to Computational Barriers
language:
Short-container-title:

Author:

Weiermann Andreas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11780342_57

Reference31 articles.

1. Arai, T.: On the slowly well orderedness of ε 0. Math. Log. Q. 48, 125–130 (2002)

2. Buchholz, W., Cichon, A., Weiermann, A.: A uniform approach to fundamental sequences and hierarchies. Math. Log. Q. 40, 273–286 (1994)

3. Carlucci, L., Lee, G., Weiermann, A.: Classifying the phase transition threshold for regressive Ramsey functions (preprint, 2006) (submitted to TAMS)

4. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. American Journal of Mathematics 35, 413–422 (1913)

5. Erdös, P., Mills, G.: Some bounds for the Ramsey-Paris-Harrington numbers. J. Combin. Theory Ser. A 30(1), 53–70 (1981)

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

1. The strength of infinitary Ramseyan principles can be accessed by their densities;Annals of Pure and Applied Logic;2017-09

2. Monomial ideals and independence of;Mathematical Logic Quarterly;2017-03-15

3. Classifying the phase transition threshold for Ackermannian functions;Annals of Pure and Applied Logic;2009-04

4. Phase transitions for Gödel incompleteness;Annals of Pure and Applied Logic;2009-02

5. Phase Transitions for Weakly Increasing Sequences;Logic and Theory of Algorithms;2008