An Infinitistic Rule of Proof
- 期刊名称The Journal of Symbolic Logic
- 作者H. B. Enderton
- 卷第32卷
- 期第4期
- 印刷ISSN0022-4812
- 文件大小498.26KB
- 发表时间1967-12
- DOI10.2307/2270173
- 页码447-451
Liver biopsyDon C. Rockey; Stephen H. Caldwell; Zachary D. Goodman; Rendon C. Nelson; Alastair D. Smith · 2009
Reply:Don C. Rockey; Stephen H. Caldwell; Zachary D. Goodman; Rendon C. Nelson; Alastair D. Smith · 2009
RepliesNelson Goodman · 1978
Notes on the well-made worldNelson Goodman · 1983
RepliesNelson Goodman · 1978
Words, works, worldsNelson Goodman · 1975
Statements and picturesNelson Goodman · 1985
The Trouble with RootNelson Goodman · 1977
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