Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Boolean Sentence Algebras: Isomorphism Constructions

William P. Hanf and Dale Myers
The Journal of Symbolic Logic
Vol. 48, No. 2 (Jun., 1983), pp. 329-338
DOI: 10.2307/2273550
Stable URL: http://www.jstor.org/stable/2273550
Page Count: 10
  • Read Online (Free)
  • Download ($10.00)
  • Subscribe ($19.50)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Boolean Sentence Algebras: Isomorphism Constructions
Preview not available

Abstract

Associated with each first-order theory is a Boolean algebra of sentences and a Boolean space of models. Homomorphisms between the sentence algebras correspond to continuous maps between the model spaces. To what do recursive homomorphisms correspond? We introduce axiomatizable maps as the appropriate dual. For these maps we prove a Cantor-Bernstein theorem. Duality and the Cantor-Bernstein theorem are used to show that the Boolean sentence algebras of any two undecidable languages or of any two functional languages are recursively isomorphic where a language is undecidable iff it has at least one operation or relation symbol of two or more places or at least two unary operation symbols, and a language is functional iff it has exactly one unary operation symbol and all other symbols are for unary relations, constants, or propositions.

Page Thumbnails

  • Thumbnail: Page 
329
    329
  • Thumbnail: Page 
330
    330
  • Thumbnail: Page 
331
    331
  • Thumbnail: Page 
332
    332
  • Thumbnail: Page 
333
    333
  • Thumbnail: Page 
334
    334
  • Thumbnail: Page 
335
    335
  • Thumbnail: Page 
336
    336
  • Thumbnail: Page 
337
    337
  • Thumbnail: Page 
338
    338