Diophantine Decision Problems.by Julia Robinson
- 期刊名称The Journal of Symbolic Logic
- 作者Review by: H. B. Enderton
- 卷第37卷
- 期第3期
- 印刷ISSN0022-4812
- 文件大小123.87KB
- 发表时间1972-09
- DOI10.2307/2272757
A Decision Procedure Based on the Resolution Method.by Bruce KallickReview by: Joyce Friedman · The Journal of Symbolic Logic · 1973
Application of Recursive Arithmetic to the Problem of Circuit Synthesisby Alonzo ChurchReview by: Joyce Friedman · The Journal of Symbolic Logic · 1963
Words in the History of a Turing Machine with a Fixed Inputby Michael O. Rabin; Hao WangReview by: Joyce Friedman · The Journal of Symbolic Logic · 1969
A Non-Heuristic Program for Proving Elementary Logical Theoremsby B. Dunham; R. Fridshal; G. L. Sward;Exploratory Mathematics by Machineby B. Dunham; R. Fridshal; J. H. North;Theorem Testing by Computerby B. Dunham; J. H. NorthReview by: Joyce Friedman · The Journal of Symbolic Logic · 1967
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