Last updated 10th July 2024: Online ordering is currently unavailable due to technical issues. We apologise for any delays responding to customers while we resolve this. For further updates please visit our website https://www.cambridge.org/news-and-insights/technical-incident

Skip to main content Accessibility help

Home
Journals
The Journal of Symbolic Logic
Volume 22 Issue 2

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 22 - Issue 2 - June 1957

Reviews

L. Henkin. The representation theorem for cylindrical algebras. Mathematical interpretation of formal systems, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1955, pp. 85–97.

L. Henkin. La structure algébrique des théories matérmatiques. Collection de logique mathématique, série A. Gauthier-Villars, Paris; E. Nauwelaerts, Louvain; 1956, 52 pp.

K. Jaakko Hintikka. An application of logic to algebra. Mathematica scandinavica, vol. 2 (1954), pp. 243–246.

A. Janiczak. Undecidability of some simple formalized theories. Nach dem Tode des Verf., von A. Mostowski und A. Grzegorczyk herausgegeben. Fundamenta mathematicae, Bd. 40 (1953), S. 131–139.

Hartley Rogers Jr. Certain logical reduction and decision problems. Annals of mathematics, Bd. 64 (1956), S. 264–284.

A. A. Mučnik. Nérazréšimost′ problémy svodimosti téorii algoritmov (Negative answer to the problem of reducibility of the theory of algorithms). Doklady Akadéimii Nauk SSSR, vol. 108 (1956), pp. 194–197.

G. S. Céjtin. Associativnoé isčislénié s nérazréšimoj problémoj ekvivaléntnosti (An associative calculus with an unsolvable equivalence problem). Doklady Akadéimii Nauk SSSR, vol. 107 (1956), pp. 370–371.

G. S. Céjtin. Otnositél′ǹo no problémy raspoznavaniá svojstv associativnyh isčislénij (Concerning the problem of recognizing properties of associative calculi). Doklady Akadéimii Nauk SSSR, vol. 107 (1956), pp. 209–212.

V. A. Uspénskij. Sistémy péréčislimyh množéstv i ih numéracii (Systems of enumerable sets and their enumerations). Doklady Akadéimii Nauk SSSR, vol. 105 (1955), pp. 1155–1158.

V. I. Šéstakov. O préobrazovanii monocikličéskoj poslédovatél′nosti v vozvratnuú (On the transformation of a periodic sequence into a recursive one). Doklady Akadéimii Nauk SSSR, vol. 105 (1955), vol. 98 (1954), pp. 541–544.

V. I. Šéstakov. Algébraičéskij métod sintéza mnogotaktnyh réléjnyh sistém (An algebraic method for the synthesis of switching circuits). Doklady Akadéimii Nauk SSSR, vol. 99 (1954), pp. 987–990.

Kurt Bing. On simplifying truth-functional formulas. The journal of symbolic logic, vol. 21 (1956), pp. 253–254.

W. Mays. The first circuit for an electrical logic-machine. Science, vol. 118 (1953), pp. 281–282.

Robert McNaughton. Logical and combinatorial problems in computer design. Computers and automation (Newtonville, Mass.), vol. 6 no. 1 (1957), pp. 30–31.

Other

Related Citations

Front matter

JSL volume 22 issue 2 Cover and Front matter and Errata

The Journal of Symbolic Logic

Refine listing

Actions for selected content:

Save Search

Volume 22 - Issue 2 - June 1957

Reviews

Other

Front matter