Quantification of number-theoretic functions
S. C. Kleene (1959-1960)
Compositio Mathematica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the Quantifier of Limiting Realizability”
Quantification of number-theoretic functions
Computable analysis
Stanisław Mazur
Similarity:
CONTENTS Foreword.......................................................................................... 3 I. Recursive and computable numbers...................................... 4 1. Recursive numbers................................................................... 5 2. Computable numbers............................................................... 17 II. Recursive and computable sequences................................. 22 III. Recursive and computable functionals....................................
Reducibilities of sets based on constructive functions of a real variable
Osvald Demuth (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Deduction-preserving "Recursive Isomorphisms" between theories
Marian Pour-El, Saul Kripke (1967)
Fundamenta Mathematicae
Similarity:
Notation systems and recursive ordered fields
Yiannis N. Moschovakis (1965-1966)
Compositio Mathematica
Similarity:
Recursiveness of initial segments of Kleene's O
Carl Jockusch (1975)
Fundamenta Mathematicae
Similarity:
Failure of completeness properties of intuitionistic predicate logic for constructive models
Daniel Leivant (1976)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity: