Skip to main content
SpringerLink
Log in

The Boolean algebra of the theory of linear orders

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

We characterize the isomorphism type of the Boolean algebra of sentences of the theory of linear orders. It is isomorphic to the sentence algebras of the theory of equivalence relations, the theory of permutations and the theory of well-orderings.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Amit and Saharon Shelah,The complete finitely axiomatizable theories of order are dense. Israel J. Math.23 (1976), 200–208.

    MATH  MathSciNet  Google Scholar 

  2. Andrzej Ehrenfeucht,An application of games to the completeness problem for formalized theories, Fund. Math.49 (1961), 129–141.

    MATH  MathSciNet  Google Scholar 

  3. William Hanf,Primitive Boolean Algebras, Proc. Symp. in honor of Alfred Traski (Berkeley, 1971), Vol. 25, Amer. Math. Soc., Providence, R. I., 1974, pp. 75–90.

    Google Scholar 

  4. William Hanf,The Boolean algebra of logic, Bull. Amer. Math. Soc.81 (1975), 587–589.

    Article  MATH  MathSciNet  Google Scholar 

  5. L. Henkin, J. D. Monk and A. Tarski,Cylindric Algebras, Part 1, North-Holland, Amsterdam, 1971, p. 169.

    MATH  Google Scholar 

  6. H. Läuchli and J. Leonard,On the elementary theory of linear order, Fund. Math.59 (1966), 109–116.

    MATH  MathSciNet  Google Scholar 

  7. Dale Myers,The Boolean algebras of abelian groups and well-orders, J. Symbolic Logic39 (1974), 452–458.

    Article  MATH  MathSciNet  Google Scholar 

  8. F. P. Ramsey,On a problem in formal logic, Proc. London Math. Soc., Ser, 2,30 (1930), 264–286.

    Article  Google Scholar 

  9. Roger Simons,The Boolean Algebra of the Theory of a Function, Ph.D. Thesis, University of California, Berkeley, 1972.

    Google Scholar 

  10. Alfred Tarski,Arithmetical classes and types of Boolean algebras, Bull. Amer. Math. Soc.55 (1949), 64, Abstract 76t.

    Google Scholar 

  11. Alfred Tarski,Arithmetical classes and types of algebraically closed and real-closed fields, Bull. Amer. Math. Soc.55 (1949), 64, Abstract 77t.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Hawaii, 96822, Honolulu, Hawaii, USA

    Dale Myers

Authors
  1. Dale Myers
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was partially supported by the National Science Foundation under research grant MCS 76-07249.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Myers, D. The Boolean algebra of the theory of linear orders. Israel J. Math. 35, 234–256 (1980). https://doi.org/10.1007/BF02761195

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02761195

Keywords

Search

Navigation