- Recursive predicates and quantifiers.S. C. Kleene - 1943 - Transactions of the American Mathematical Society 53:41-73.details
|
|
Some conservation results on weak König's lemma.Stephen G. Simpson, Kazuyuki Tanaka & Takeshi Yamazaki - 2002 - Annals of Pure and Applied Logic 118 (1-2):87-114.details
|
|
(1 other version)An omniscience principle, the König Lemma and the Hahn‐Banach theorem.Hajime Ishihara - 1990 - Mathematical Logic Quarterly 36 (3):237-240.details
|
|
Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.details
|
|
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.details
|
|
(1 other version)An omniscience principle, the König Lemma and the Hahn-Banach theorem.Hajime Ishihara - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (3):237-240.details
|
|
(1 other version)Constructively Complete Finite Sets.Mark Mandelkern - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (2):97-103.details
|
|
Constructive Analysis.Errett Bishop & Douglas S. Bridges - 1985 - Berlin, Heidelberg, New York, and Tokyo: Springer.details
|
|
(1 other version)Constructively Complete Finite Sets.Mark Mandelkern - 1988 - Mathematical Logic Quarterly 34 (2):97-103.details
|
|
On the (semi)lattices induced by continuous reducibilities.Arno Pauly - 2010 - Mathematical Logic Quarterly 56 (5):488-502.details
|
|
Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..details
|
|
How Incomputable Is the Separable Hahn-Banach Theorem?Guido Gherardi & Alberto Marcone - 2009 - Notre Dame Journal of Formal Logic 50 (4):393-425.details
|
|
Uniform versions of some axioms of second order arithmetic.Nobuyuki Sakamoto & Takeshi Yamakazi - 2004 - Mathematical Logic Quarterly 50 (6):587-593.details
|
|
(1 other version)Berechenbare Reelle Funktionenfolgen.Jürgen Hauck - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):265-282.details
|
|
Omniscience Principles and Functions of Bounded Variation.Fred Richman - 2002 - Mathematical Logic Quarterly 48 (1):111-116.details
|
|
Uniform versions of some axioms of second order arithmetic.Nobuyuki Sakamoto & Takeshi Yamazaki - 2004 - Mathematical Logic Quarterly 50 (6):587-593.details
|
|
Borel complexity and computability of the Hahn–Banach Theorem.Vasco Brattka - 2008 - Archive for Mathematical Logic 46 (7-8):547-564.details
|
|
Unique solutions.Peter Schuster - 2006 - Mathematical Logic Quarterly 52 (6):534-539.details
|
|
Corrigendum to “Unique solutions”.Peter Schuster - 2007 - Mathematical Logic Quarterly 53 (2):214-214.details
|
|
Effective Borel measurability and reducibility of functions.Vasco Brattka - 2005 - Mathematical Logic Quarterly 51 (1):19-44.details
|
|
Effective Borel degrees of some topological functions.Guido Gherardi - 2006 - Mathematical Logic Quarterly 52 (6):625-642.details
|
|
A computable version of Banach’s Inverse Mapping Theorem.Vasco Brattka - 2009 - Annals of Pure and Applied Logic 157 (2-3):85-96.details
|
|
Weihrauch degrees, omniscience principles and weak computability.Vasco Brattka & Guido Gherardi - 2011 - Journal of Symbolic Logic 76 (1):143 - 176.details
|
|
On a simple definition of computable function of a real variable‐with applications to functions of a complex variable.Marian Boykan Pour-El & Jerome Caldwell - 1975 - Mathematical Logic Quarterly 21 (1):1-19.details
|
|
On uniform weak König's lemma.Ulrich Kohlenbach - 2002 - Annals of Pure and Applied Logic 114 (1-3):103-116.details
|
|
(1 other version)Berechenbare Reelle Funktionenfolgen.Jürgen Hauck - 1976 - Mathematical Logic Quarterly 22 (1):265-282.details
|
|