Errett Bishop (1967):
Foundations of constructive analysis.
McGraw-Hill Book Co..
Errett Bishop & Douglas S. Bridges (1985):
Constructive analysis.
Grundlehren der Mathematischen Wissenschaften 279.
Springer,
doi:10.1007/978-3-642-61667-9.
Errett A. Bishop (1985):
Schizophrenia in contemporary mathematics.
In: Murray Rosenblatt: Errett Bishop: reflections on him and his research. Proceedings of the memorial meeting for Errett Bishop held at the University of California, San Diego, Calif., September 24, 1983,
Contemporary Mathematics 39.
American Mathematical Society,
pp. 1–32,
doi:10.1090/conm/039/788163.
Vasco Brattka, Peter Hertling & Klaus Weihrauch (2008):
A tutorial on computable analysis.
In: S. Barry Cooper, Benedikt Löwe & Andrea Sorbi: New computational paradigms.
Springer,
pp. 425–491,
doi:10.1007/978-0-387-68546-5_18.
Douglas S. Bridges & Luminiţa Simona Vîţă (2006):
Techniques of constructive analysis.
Universitext.
Springer,
doi:10.1002/9781118033357.
Samuel R. Buss (1998):
An introduction to proof theory.
In: Samuel R. Buss: Handbook of proof theory,
Studies in Logic and the Foundations of Mathematics 137.
North-Holland,
Amsterdam,
pp. 1–78,
doi:10.1016/S0049-237X(98)80016-5.
Alonzo Church (1936):
A note on the Entscheidungsproblem.
Journal of Symbolic Logic 1,
pp. 40–41,
doi:10.2307/2269049.
Laura Crosilla & Peter Schuster (2005):
From sets and types to topology and analysis.
Oxford Logic Guides 48.
Oxford University Press.
Harvey Friedman (1975):
Some systems of second order arithmetic and their use.
In: Proceedings of the International Congress of Mathematicians. Volume 1. Held in Vancouver, B. C., August 21–29, 1974.
Canadian Mathematical Congress,
pp. 235–242.
Harvey Friedman (1976):
Systems of second order arithmetic with restricted induction, I & II (Abstracts).
Journal of Symbolic Logic 41,
pp. 557–559.
Jean van Heijenoort (1967):
From Frege to Gödel. A source book in mathematical logic, 1879–1931.
Harvard University Press.
Karel Hrbacek (1978):
Axiomatic foundations for nonstandard analysis.
Fundamenta Mathematicae 98(1),
pp. 1–19.
Karel Hrbacek (2007):
Stratified analysis?.
In: Imme van den Berg & Vítor Neves: The strength of nonstandard analysis.
Springer,
pp. 47–63,
doi:10.1007/978-3-211-49905-4_4.
Hajime Ishihara (2006):
Reverse mathematics in Bishop's constructive mathematics.
Philosophia Scientiae CS 6,
pp. 43–59,
doi:10.4000/philosophiascientiae.406.
H. Jerome Keisler (2006):
Nonstandard arithmetic and reverse mathematics.
Bulletin of Symbolic Logic 12(1),
pp. 100–125,
doi:10.2178/bsl/1140640945.
H. Jerome Keisler (2010):
Nonstandard arithmetic and recursive comprehension.
Annals of Pure and Applied Logic 161(8),
pp. 1047–1062,
doi:10.1016/j.apal.2010.01.001.
Ieke Moerdijk & Erik Palmgren (1997):
Minimal models of Heyting arithmetic.
Journal of Symbolic Logic 62(4),
pp. 1448–1460,
doi:10.2307/2275651.
Erik Palmgren (2001):
Unifying constructive and nonstandard analysis,
doi:10.1007/978-94-015-9757-9_15.
In: [pp. 167–183]venice.
Yves Péraire (1992):
Théorie relative des ensembles internes.
Osaka Journal of Mathematics 29(2),
pp. 267–297.
Abraham Robinson (1966):
Non-standard analysis.
North-Holland Publishing Co..
Sam Sanders (2010):
More infinity for a better finitism.
Annals of Pure and Applied Logic 161,
pp. 1525–1540,
doi:10.1016/j.apal.2010.06.003.
Sam Sanders (2010):
Relative Arithmetic.
Mathematical Logic Quarterly 56,
pp. 564 –572,
doi:10.1002/malq.200910110.
Sam Sanders (2011):
A tale of three Reverse Mathematics.
Submitted.
Sam Sanders (2011):
ERNA and Friedman's Reverse Mathematics.
Journal of Symbolic Logic 76,
pp. 637–664,
doi:10.2178/jsl/1305810768.
Peter Schuster, Ulrich Berger & Horst Osswald (2001):
Reuniting the antipodes—constructive and nonstandard views of the continuum. Proceedings of the symposium held in Venice, May 16–22, 1999.
Synthese Library 306.
Kluwer Academic Publishers.
Stephen G. Simpson (2009):
Subsystems of second order arithmetic,
2nd edition,
Perspectives in Logic.
Cambridge University Press,
doi:10.1017/CBO9780511581007.
Stephen G. Simpson & Keita Yokoyama (2011):
A nonstandard counterpart of WWKL.
Notre Dame Journal of Formal Logic 52(3),
pp. 229–243,
doi:10.1215/00294527-1435429.
Robert I. Soare (1987):
Recursively enumerable sets and degrees.
Perspectives in Mathematical Logic.
Springer-Verlag,
doi:10.1007/978-3-662-02460-7.
Alan Turing (1937):
On computable numbers, with an application to the Entscheidungsproblem.
Proceedings of the London Mathematical Society 42,
pp. 230–265,
doi:10.1112/plms/s2-42.1.230.
Jaap Van Oosten (2006):
Review of cross.
Bulletin of Symbolic Logic 12(4),
pp. 611–612,
doi:10.1017/S107989860000250X.
Klaus Weihrauch (2000):
Computable analysis.
Texts in Theoretical Computer Science. An EATCS Series.
Springer-Verlag,
doi:10.1007/978-3-642-56999-9.
An introduction.
Keita Yokoyama (2009):
Standard and non-standard analysis in second order arithmetic.
Tohoku Mathematical Publications 34.
Tohoku University Mathematical Institute.
Keita Yokoyama (2010):
Formalizing non-standard arguments in second-order arithmetic.
Journal of Symbolic Logic 75(4),
pp. 1199–1210,
doi:10.2178/jsl/1286198143.
Keita Yokoyama (2010):
On Π_1^1 conservativity for Π_2^1 theories in second order arithmetic.
In: T. Arai, J. Brendle, H. Kikyo, C.T. Chong, R. Downey, Q. Feng & H. Ono: 10th Asian Logic Conference. Proceedings of the conference held at Kobe University, Kobe, September 1–6, 2008.
World Scientific,
pp. 375–386,
doi:10.1142/9789814293020_0016.