Operator Algorithmen. IIby A. P. Jerschow; Heinz D. Modrow
- 期刊名称The Journal of Symbolic Logic
- 作者Review by: E. M. Fels
- 卷第33卷
- 期第3期
- 印刷ISSN0022-4812
- 文件大小210.41KB
- 发表时间1968-09
- DOI10.2307/2270337
On Constructive Functionsby A. A. MarkovReview by: E. M. Fels · The Journal of Symbolic Logic · 1966
On Matrix Schemataby Ú. I. ÁnovReview by: E. M. Fels · The Journal of Symbolic Logic · 1967
Constructive Real Numbers and Constructive Functional SpacesReview by: E. M. Fels · The Journal of Symbolic Logic · 1969
On the Constructive Interpretation of Mathematical JudgmentsReview by: E. M. Fels · The Journal of Symbolic Logic · 1966
The Logical Structure of Programmesby A. A. LjapunoReview by: E. M. Fels · The Journal of Symbolic Logic · 1968
Operator Algorithmen. IIby A. P. Jerschow; Heinz D. ModrowReview by: E. M. Fels · The Journal of Symbolic Logic · 1968
Funktionen-Algorithmen und Graphschemataby Günter AsserReview by: E. M. Fels · The Journal of Symbolic Logic · 1963
On Logical Schemata of Algorithmsby Ú. I. ÁnovReview by: E. M. Fels · The Journal of Symbolic Logic · 1962
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