Konstruktion nichtrekursiver Funktionen
R. Péter (1935)
Mathematische Annalen
Similarity:
Displaying similar documents to “Tag Systems and Lag Systems.”
Konstruktion nichtrekursiver Funktionen
Turing-Machines and the Entscheidungsproblem.
J.R. BÜCHI (1962)
Mathematische Annalen
Similarity:
Completeness of Lukasiewicz-Tarski PropositionaICalculi
Alan Rose (1950/51)
Mathematische Annalen
Similarity:
A Reduction-Principle for Infinite Formulas.
E. ENGELER (1963)
Mathematische Annalen
Similarity:
Between Number Theory and Set Theory.
H. Wang (1953)
Mathematische Annalen
Similarity:
First Order Completeness Theorems.
John J. Wavrik (1973)
Mathematische Annalen
Similarity:
Note on a Paper of Kemeny's.
R.O. Gandy (1958)
Mathematische Annalen
Similarity:
The Theory of Successor with an Extra Predicate.
Wolfgang Thomas (1978)
Mathematische Annalen
Similarity:
Some Applications of Gentzens Second Consistency Proof.
B. SCARPELLINI (1969)
Mathematische Annalen
Similarity:
An alternative Generalisation of the Concept of Duality.
A. Rose (1962)
Mathematische Annalen
Similarity:
A Note on B- and Br-Completeness.
D. van Dulst (1972)
Mathematische Annalen
Similarity:
Undecidable Problems of Elementary Number Theory.
J.G. Kemeny (1958)
Mathematische Annalen
Similarity:
Computing Degrees of Unsolvability.
H. ROGERS (1959)
Mathematische Annalen
Similarity:
Pointless Axiomatic Set Theory.
H. Nakano (1970)
Mathematische Annalen
Similarity:
An Axiomatic Set Theory.
H. Nakano (1970)
Mathematische Annalen
Similarity:
The Theory of Proportionality as an Abstraction of Group Theory.
J.B. Büchi, J.B. Wright (1955/56)
Mathematische Annalen
Similarity: