The Boolean algebra of logic
HTML articles powered by AMS MathViewer
- by William Hanf PDF
- Bull. Amer. Math. Soc. 81 (1975), 587-589
References
- Lawrence Feiner, Hierarchies of Boolean algebras, J. Symbolic Logic 35 (1970), 365–374. MR 282805, DOI 10.2307/2270692
- William Hanf, Model-theoretic methods in the study of elementary logic, Theory of Models (Proc. 1963 Internat. Sympos. Berkeley), North-Holland, Amsterdam, 1965, pp. 132–145. MR 0210570
- William Hanf, Primitive Boolean algebras, Proceedings of the Tarski Symposium (Proc. Sympos. Pure Math., Vol. XXV, Univ. California, Berkeley, Calif., 1971) Amer. Math. Soc., Providence, R.I., 1974, pp. 75–90. MR 0379182
- Marvin L. Minsky, Recursive unsolvability of Post’s problem of “tag” and other topics in theory of Turing machines, Ann. of Math. (2) 74 (1961), 437–455. MR 140405, DOI 10.2307/1970290
- Raphael M. Robinson, Undecidability and nonperiodicity for tilings of the plane, Invent. Math. 12 (1971), 177–209. MR 297572, DOI 10.1007/BF01418780
Additional Information
- Journal: Bull. Amer. Math. Soc. 81 (1975), 587-589
- MSC (1970): Primary 02J05; Secondary 06A40, 02G15, 02H05
- DOI: https://doi.org/10.1090/S0002-9904-1975-13747-5
- MathSciNet review: 0389573