Constructible Sets with Applications.by A. Mostowski
- 期刊名称The Journal of Symbolic Logic
- 作者Review by: Perry Smith
- 卷第40卷
- 期第4期
- 印刷ISSN0022-4812
- 文件大小553.83KB
- 发表时间1975-12
- DOI10.2307/2271851
- 页码631-632
Fragments of HA Based on Σ1-Inductionby Kai F. WehmeierReview by: Helmut Pfeiffer · The Bulletin of Symbolic Logic · 2001
Iterated Inductive Definitions and Subsystems of Analysisby Wilfried Buchholz; Wolfram Pohlers; Wilfried SiegReview by: Helmut Pfeiffer · The Journal of Symbolic Logic · 1994
Regular Ordinals and Normal Forms.by David Isles; A. Kino; J. Myhill; R. E. VesleyReview by: Helmut Pfeiffer · The Journal of Symbolic Logic · 1973
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