Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T15:31:34.756Z Has data issue: false hasContentIssue false

Boolean sentence algebras: Isomorphism constructions

Published online by Cambridge University Press:  12 March 2014

William P. Hanf
Affiliation:
University of Hawaii, Honolulu, Hawaii 96822
Dale Myers
Affiliation:
University of Illinois at Chicago Circle, Chicago, Illinois 60680

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1983

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable