Hostname: page-component-77c89778f8-cnmwb Total loading time: 0 Render date: 2024-07-17T12:26:30.324Z Has data issue: false hasContentIssue false
  • English
  • Français

Boolean sentence algebras: Isomorphism constructions

Published online by Cambridge University Press:  12 March 2014

William P. Hanf  and
Dale Myers
William P. Hanf
Affiliation:
University of Hawaii, Honolulu, Hawaii 96822
Dale Myers
Affiliation:
University of Illinois at Chicago Circle, Chicago, Illinois 60680
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 48 , Issue 2 , June 1983 , pp. 329 - 338
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.)

References

REFERENCES

[BS]Bell, John and Slomson, Alan, Models and ultraproducts: an introduction, North-Holland, Amsterdam, 1971.Google Scholar
[Fa]Faust, Don, The Boolean algebra of formulas of first-order logic, Annals of Mathematical Logic (to appear).Google Scholar
[FHM]Faust, D., Hanf, W. and Myers, D., The Boolean algebra of formulas, this Journal, vol. 42 (1977), p. 145 (abstract).Google Scholar
[Fe]Feferman, Solomon, Lectures in proof theory, Proceedings of the Summer School in Logic, Leeds 1967, Lecture Notes in Mathematics, vol. 70, Springer-Verlag, Berlin-Heidelberg-New York, 1968, pp. 1–107.CrossRefGoogle Scholar
[Ga]Gaifman, Haim, Operations on relational structures, functors and classes. I, Proceedings of the Tar ski Symposium, Proceedings of Symposia in Pure Mathematics, vol. 25, American Mathematical Society, Providence, R. I., 1970, pp. 21–39.Google Scholar
[Ha1]Hanf, William, Isomorphism in elementary logic, preliminary report, Notices of the American Mathematical Society, vol. 9 (1962), pp. 146–147, abstract #62T-75.Google Scholar
[Ha2]Hanf, William, The Boolean algebra of logic, Bulletin of the American Mathematical Society, vol. 81 (1975), pp. 587–589.CrossRefGoogle Scholar
[HMT]Henkin, Leon, Monk, Donald and Tarski, Alfred, Cylindric algebras, North-Holland, Amsterdam, 1971.Google Scholar
[Me]Mendelson, Elliot, Introduction to mathematical logic, D. Van Nostrand, Inc., Princeton, N. J., 1964.Google Scholar
[My1]Myers, Dale, Cylindric algebras of first-order theories, Transactions of the American Mathematical Society, vol. 216 (1976), pp. 189–202.CrossRefGoogle Scholar
[My2]Myers, Dale, Boolean sentence algebras: measure, rank, and monadic languages (to appear).Google Scholar
[My3]Myers, Dale, Model maps and interpretations (to appear).Google Scholar
[Pi]Pillay, Anand, Gaifman operations, minimal models and the number of countable models, Ph. D. Thesis, University of London, 1977.Google Scholar
[Sh]Shelah, Saharon, Every two elementarily equivalent models have isomorphic ultrapowers, Israel Journal of Mathematics, vol. 10 (1972), pp. 224–233.CrossRefGoogle Scholar
[Si]Simons, Roger, The Boolean algebra of sentences of the theory of a function, Ph. D. Thesis, Berkeley, 1971.Google Scholar