Computabilityby George J. TourlakisReview by: Ann Yasuhara · The Journal of Symbolic Logic · 1988

Some Structure Results for Propositional Calculiby Ronald HarropReview by: Ann Yasuhara · The Journal of Symbolic Logic · 1967

On Post's Canonical Systemsby Raymond M. SmullyanReview by: Ann Yasuhara · The Journal of Symbolic Logic · 1968

Defining Relations and Algorithmic Problems for Groups and Semigroups.by S. I. Adjan; M. GreendlingerReview by: Ann Yasuhara · The Journal of Symbolic Logic · 1973

Undecidability of the General Problems of Completeness, Decidability and Equivalence for Propositional Calculi.by A. V. Kuznecov; E. MendelsonReview by: Ann Yasuhara · The Journal of Symbolic Logic · 1972

The Post Correspondence Problem.by Dennis F. Cudia; Wilson E. Singletary;Degrees of Unsolvability in Formal Grammars.by Dennis F. Cudia; Wilson E. SingletaryReview by: Ann Yasuhara · The Journal of Symbolic Logic · 1974

Tag Systems and Lag Systemsby Hao Wang;Universality of Tag Systems with D = 2by John Cocke; Marvin Minsky;The Solvability of the Derivability Problem for One-Normal Systemsby Stephen A. CookReview by: Ann Yasuhara · The Journal of Symbolic Logic · 1971

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