λ-Definability and Recursivenessby S. C. Kleene
- 期刊名称The Journal of Symbolic Logic
- 作者Review by: Rózsa Péter
- 卷第2卷
- 期第1期
- 印刷ISSN0022-4812
- 文件大小345.06KB
- 发表时间1937-03
- DOI10.2307/2268802
- 页码38-39
On Derivabilityby W. V. QuineReview by: Rózsa Péter · The Journal of Symbolic Logic · 1938
Nested Recursionby W. W. TaitReview by: Rózsa Péter · The Journal of Symbolic Logic · 1963
Primitive Recursive Functionsby Raphael M. RobinsonReview by: Rózsa Péter · The Journal of Symbolic Logic · 1948
Zur Widerspruchsfreiheit der Zahlentheorieby Wilhelm AckermannReview by: Rózsa Péter · The Journal of Symbolic Logic · 1940
Undecidable-Ringsby Raphael M. RobinsonReview by: Rózsa Péter · The Journal of Symbolic Logic · 1952
Recursion and Double Recursionby Raphael M. RobinsonReview by: Rózsa Péter · The Journal of Symbolic Logic · 1949
λ-Definability and Recursivenessby S. C. KleeneReview by: Rózsa Péter · The Journal of Symbolic Logic · 1937
Computability and λ-DefinabilityA. M. Turing · The Journal of Symbolic Logic · 1937
Definability and Decision Problems in ArithmeticJulia Robinson · The Journal of Symbolic Logic · 1949
Arithmetical Problems and Recursively Enumerable PredicatesMartin Davis · The Journal of Symbolic Logic · 1953
The Interpretability Logic of Peano ArithmeticAlessandro Berarducci · The Journal of Symbolic Logic · 1990
Steps Toward a Constructive NominalismNelson Goodman and W. V. Quine · The Journal of Symbolic Logic · 1947
A Completeness Theorem in Modal LogicSaul A. Kripke · The Journal of Symbolic Logic · 1959
Models and RealityHilary Putnam · The Journal of Symbolic Logic · 1980
A Theory of Restricted Quantification ITheodore Hailperin · The Journal of Symbolic Logic · 1957