Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more: https://www.cambridge.org/universitypress/about-us/news-and-blogs/cambridge-university-press-publishing-update-following-technical-disruption

Skip to main content Accessibility help

Home
Journals
The Journal of Symbolic Logic
Volume 33

The Journal of Symbolic Logic

Other actions
- Information
- - Add bookmark
  - Add alert
  - RSS Feed
  - Share

Published on behalf of Association of Symbolic Logic

Journal Home

Journal home
Journal information
Accepted manuscripts
FirstView articles
Latest issue
All issues
Most cited
Most read
Open access

The Journal of Symbolic Logic

Refine listing

Actions for selected content:

Volume 33 - January 1969

Reviews

Sheila A. Greibach. A note on pushdown store automata and regular systems. Proceedings of the American Mathematical Society, vol. 18 (1967), pp. 263–268.

John Myhill. Ω — Λ. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 97–104.

Ph. Dwinger and F. M. Yaqub. Generalized free products of Boolean algebras with an amalgamated subalgebra. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 66 (1963), pp. 225–231; also lndagationes mathematicae, vol. 25 (1963), pp. 225–231.

Front matter

JSL volume 33 issue 3 Cover and Front matter

Reviews

F. M. Yaqub. Free extensions of Boolean algebras. Pacific journal of mathematics, vol. 13 (1963), pp. 761–771.

A. Nerode. Combinatorial series and recursive equivalence types. Fundamenta mathematicae, vol. 58 (1966), pp. 113–141.

Angelo R. Meo. On the determination of the ps maximal implicants of a switching function. IEEE transactions on electronic computers, vol. EC-14 (1965), pp. 830–840.

K. I. Appel and T. G. McLaughlin. On properties of regressive sets. Transactions of the American Mathematical Society, vol. 115 (1965), pp. 83–93.

Roman Sikorski. On extensions and products of Boolean algebras. Fundamenta mathematicae, vol. 53 no. 1 (1963), pp. 99–116.

K. I. Appel. No recursively enumerable set is the union of finitely many immune retraceable sets. Proceedings of the American Mathematical Society, vol. 18 (1967). pp. 279–281.

Franz E. Hohn. Applied Boolean algebra. An elementary introduction. Deuxième édition, revue et augmentée, de XXVII 104. The Macmillan Company, New York, et Collier-Macmillan Limited, Londres, 1966, xiii + 273 p.

R. S. Pierce. A note on free algebras. Proceedings of the American Mathematical Society, vol. 14 (1963), pp. 845–846.

K. I. Appel. There exist two regressive sets whose intersection is not regressive. The journal of symbolic logic, vol. 32 (1967), pp. 322–324.

Marlow Sholander. Postulates for Boolean algebras. Canadian journal of mathematics (Journal canadien de mathématiques), vol. 5 (1953), pp. 460–464.

R. S. Pierce. A note on free products of abstract algebras. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 66 (1963), pp. 401–407; also Indagationes mathematicae, vol. 25 (1963), pp. 401–407.

Richard B. Hurley. Transistor logic circuits. John Wiley & Sons, Inc., New York and London1961, xvi + 363 pp.

G. Asser. Einführung in die mathematische Logik. Teil I. Aussagenkalkül. A reprint of XXV 276. Mathematisch-naturwissenschaftliche Bibliothek, no. 18. B. G. Teubner Verlagsgesellschaft, Leipzig1965, VI + 184 pp.

G. Kreisel and Gerald E. Sacks. Metarecursive sets. The journal of symbolic logic, vol. 30 (1965), pp. 318–338.

M. Denis-Papin, A. Kaufmann, and R. Faure. Cours de calcul booléien appliqué (notions tur les ensembles et les treillis, algèbres booléiennes, algèbre binaire). With a preface by René de Possel. Éditions Albin Michel, Paris1963, 495 pp.

The Journal of Symbolic Logic

Refine listing

Actions for selected content:

Save Search

Volume 33 - January 1969

Reviews

Front matter

Reviews