Imaginaries in Boolean algebras

Mathematical Logic Quarterly 58 (3):217-235 (2012)
  Copy   BIBTEX

Abstract

Given an infinite Boolean algebra B, we find a natural class of equation image-definable equivalence relations equation image such that every imaginary element from Beq is interdefinable with an element from a sort determined by some equivalence relation from equation image. It follows that B together with the family of sorts determined by equation image admits elimination of imaginaries in a suitable multisorted language. The paper generalizes author's earlier results concerning definable equivalence relations and weak elimination of imaginaries for Boolean algebras, obtained in 10

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-12-01

Downloads
18 (#859,738)

6 months
1 (#1,516,021)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Lattice Ordered O -Minimal Structures.Carlo Toffalori - 1998 - Notre Dame Journal of Formal Logic 39 (4):447-463.
Small theories of Boolean ordered o-minimal structures.Roman Wencel - 2002 - Journal of Symbolic Logic 67 (4):1385-1390.
Definable sets in Boolean ordered o-minimal structures. II.Roman Wencel - 2003 - Journal of Symbolic Logic 68 (1):35-51.
Weak elimination of imaginaries for Boolean algebras.Roman Wencel - 2005 - Annals of Pure and Applied Logic 132 (2-3):247-270.

Add more references