- Proofs and computations.Helmut Schwichtenberg - 2012 - New York: Cambridge University Press. Edited by S. S. Wainer.details
|
|
Combinatorial principles weaker than Ramsey's Theorem for pairs.Denis R. Hirschfeldt & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (1):171-206.details
|
|
On the strength of Ramsey's theorem for pairs.Peter A. Cholak, Carl G. Jockusch & Theodore A. Slaman - 2001 - Journal of Symbolic Logic 66 (1):1-55.details
|
|
On the strength of Ramsey's theorem for pairs.Peter A. Cholak, Carl G. Jockusch & Theodore A. Slaman - 2001 - Journal of Symbolic Logic 66 (1):1-55.details
|
|
Reverse mathematics and well-ordering principles: A pilot study.Bahareh Afshari & Michael Rathjen - 2009 - Annals of Pure and Applied Logic 160 (3):231-237.details
|
|
Computations in higher types.Johan Moldestad - 1977 - New York: Springer Verlag.details
|
|
Non-standard analysis in ACA0 and Riemann mapping theorem.Keita Yokoyama - 2007 - Mathematical Logic Quarterly 53 (2):132-146.details
|
|
Weak systems of determinacy and arithmetical quasi-inductive definitions.P. D. Welch - 2011 - Journal of Symbolic Logic 76 (2):418 - 436.details
|
|
Weak axioms of determinacy and subsystems of analysis I: δ20 games.Kazuyuki Tanaka - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (6):481-491.details
|
|
Weak axioms of determinacy and subsystems of analysis I: δmath image games.Kazuyuki Tanaka - 1990 - Mathematical Logic Quarterly 36 (6):481-491.details
|
|
Weak axioms of determinacy and subsystems of analysis II.Kazuyuki Tanaka - 1991 - Annals of Pure and Applied Logic 52 (1-2):181-193.details
|
|
Forcing with tagged trees.John R. Steel - 1978 - Annals of Mathematical Logic 15 (1):55.details
|
|
On the strength of könig's duality theorem for countable bipartite graphs.Stephen G. Simpson - 1994 - Journal of Symbolic Logic 59 (1):113-123.details
|
|
Linear Orderings.Joseph G. Rosenstein - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.details
|
|
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.details
|
|
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.details
|
|
Direct and local definitions of the Turing jump.Richard A. Shore - 2007 - Journal of Mathematical Logic 7 (2):229-262.details
|
|
Infinite games in the Cantor space and subsystems of second order arithmetic.Takako Nemoto, MedYahya Ould MedSalem & Kazuyuki Tanaka - 2007 - Mathematical Logic Quarterly 53 (3):226-236.details
|
|
Necessary use of [image] induction in a reversal.Itay Neeman - 2011 - Journal of Symbolic Logic 76 (2):561 - 574.details
|
|
Reverse mathematics and π21 comprehension.Carl Mummert & Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (4):526-533.details
|
|
Reverse Mathematics and Π 1 2 Comprehension.Carl Mummert & Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (3):526-533.details
|
|
Indecomposable linear orderings and hyperarithmetic analysis.Antonio Montalbán - 2006 - Journal of Mathematical Logic 6 (1):89-120.details
|
|
[image] -Determinacy, Comprehension and Induction.Medyahya Ould Medsalem & Kazuyuki Tanaka - 2007 - Journal of Symbolic Logic 72 (2):452 - 462.details
|
|
Δ 0 3 -determinacy, comprehension and induction.MedYahya Ould MedSalem & Kazuyuki Tanaka - 2007 - Journal of Symbolic Logic 72 (2):452-462.details
|
|
The veblen functions for computability theorists.Alberto Marcone & Antonio Montalbán - 2011 - Journal of Symbolic Logic 76 (2):575 - 602.details
|
|
On Fraïssé’s conjecture for linear orders of finite Hausdorff rank.Alberto Marcone & Antonio Montalbán - 2009 - Annals of Pure and Applied Logic 160 (3):355-367.details
|
|
On suborderings of the alpha-recursively enumerable alpha-degrees.Manuel Lerman - 1972 - Annals of Mathematical Logic 4 (4):369.details
|
|
Nonstandard arithmetic and reverse mathematics.H. Jerome Keisler - 2006 - Bulletin of Symbolic Logic 12 (1):100-125.details
|
|
Nonstandard arithmetic and recursive comprehension.H. Keisler - 2010 - Annals of Pure and Applied Logic 161 (8):1047-1062.details
|
|
The strength of Jullien's indecomposability theorem.Itay Neeman - 2008 - Journal of Mathematical Logic 8 (1):93-119.details
|
|
Higher set theory and mathematical practice.Harvey M. Friedman - 1971 - Annals of Mathematical Logic 2 (3):325.details
|
|
General recursion theory: an axiomatic approach.Jens Erik Fenstad - 1980 - New York: Springer Verlag.details
|
|
The polarized Ramsey’s theorem.Damir D. Dzhafarov & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (2):141-157.details
|
|
A Δ20 set with no infinite low subset in either it or its complement.Rod Downey, Denis R. Hirschfeldt, Steffen Lempp & Reed Solomon - 2001 - Journal of Symbolic Logic 66 (3):1371-1381.details
|
|
A $\delta^0_2$ Set With No Infinite Low Subset In Either It Or Its Complement.Rod Downey, Denis Hirschfeldt, Steffen Lempp & Reed Solomon - 2001 - Journal of Symbolic Logic 66 (3):1371-1381.details
|
|
[Omnibus Review].H. Jerome Keisler - 1970 - Journal of Symbolic Logic 35 (2):342-344.details
|
|
Reverse mathematics and well-ordering principles.Michael Rathjen & Andreas Weiermann - 2011 - In S. B. Cooper & Andrea Sorbi (eds.), Computability in Context: Computation and Logic in the Real World. World Scientific.details
|
|