Catullus, lxvi. 43
- 期刊名称The Classical Review
- 作者Percy Simpson
- 卷第4卷
- 期第10期
- 印刷ISSN0009-840X
- 电子ISSN1464-3561
- 文件大小454.10KB
- 发表时间1890-12
- DOI10.2307/693511
- 页码481-482
Finite Automataby M. V. LawsonReview by: Robert McNaughton · SIAM Review · 2004
Theories of Computabilityby Nicholas PippengerReview by: Robert McNaughton · SIAM Review · 2000
Linear Automaton Transformationsby A. NerodeReview by: Robert McNaughton · The Journal of Symbolic Logic · 1963
Abstract Set Theoryby Abraham A. FraenkelReview by: Robert McNaughton · The Journal of Symbolic Logic · 1955
Introduction to Automataby R. J. NelsonReview by: Robert McNaughton · The Journal of Symbolic Logic · 1971
Minimization of Boolean Functionsby E. J. McCluskey,Review by: Robert McNaughton · The Journal of Symbolic Logic · 1958
Papers on Predicate Calculusby S. C. KleeneReview by: Robert McNaughton · The Journal of Symbolic Logic · 1954
Many-Valued Logical Machinesby Alan RoseReview by: Robert McNaughton · 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