Undecidable-Ringsby Raphael M. Robinson
- 期刊名称The Journal of Symbolic Logic
- 作者Review by: Rózsa Péter
- 卷第17卷
- 期第4期
- 印刷ISSN0022-4812
- 文件大小317.69KB
- 发表时间1952-12
- DOI10.2307/2266617
- 页码268-269
Looking Back at the Seventies? || Back MatterThe Agni Review · 1979
Back to Basics || Back MatterThe Radical Teacher · 1982
BACK TO BASICS || Back MatterLitigation · 1998
Back to the Things Themselves || Back MatterHuman Studies · 1997
Back Matter - Back CoverUniform Law Review - Revue de droit uniforme · 2014
Back Matter - Back CoverUniform Law Review - Revue de droit uniforme · 2014
Back Matter - Back CoverUniform Law Review - Revue de droit uniforme · 2013
Back Matter - Back CoverUniform Law Review - Revue de droit uniforme · 2014
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