The finite levels of the hierarchy of effective R-sets
Peter Hinman (1973)
Fundamenta Mathematicae
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.
Displaying similar documents to “Subsequences of binary recursive sequences”
The finite levels of the hierarchy of effective R-sets
On the definitions of computable real continuous functions
Andrzej Grzegorczyk (1957)
Fundamenta Mathematicae
Similarity:
Hyperarithmetical quantifiers
C. Spector (1960)
Fundamenta Mathematicae
Similarity:
Examples of sets definable by means of two and three quantifiers
Andrzej Mostowski (1955)
Fundamenta Mathematicae
Similarity:
Recursive objects in all finite types
Andrzej Grzegorczyk (1964)
Fundamenta Mathematicae
Similarity:
On the reducibility of decision problems
A. Janiczak (1954)
Colloquium Mathematicae
Similarity:
On computable sequences
Andrzej Mostowski (1957)
Fundamenta Mathematicae
Similarity:
Divisibility properties of certain recurrent sequences.
Dubickas, A. (2005)
Journal of Mathematical Sciences (New York)
Similarity:
Extension pathology in regressive isols
Matthew J. Hassett (1973)
Compositio Mathematica
Similarity:
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....................................