On Simplification Algorithms for Disjunctive Normal Formsby Yu. I. Žuravlev; E. Mendelson
- 期刊名称The Journal of Symbolic Logic
- 作者Review by: Andrzej Rowicki
- 卷第31卷
- 期第1期
- 印刷ISSN0022-4812
- 文件大小191.50KB
- 发表时间1966-03
- DOI10.2307/2270684
General Recursive Functionsby Julia RobinsonReview by: Martin Davis · The Journal of Symbolic Logic · 1951
Undecidable Theoriesby Alfred TarskiReview by: Martin Davis · The Journal of Symbolic Logic · 1959
Paradoxes in ParadiseReview by: Martin Davis · American Scientist · 2003
Enumerability, Decidability, Computabilityby H. HermesReview by: Martin Davis · Mathematics of Computation · 1967
Touring TuringReview by: Martin Davis · American Scientist · 2008
Ahead of His TimeReview by: Martin Davis · American Scientist · 2006
Overheard in the ParkReview by: Martin Davis · American Scientist · 2000
The Man Who Defined TruthReview by: Martin Davis · American Scientist · 2005
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