Duality and Definability in First Order Logic

American Mathematical Soc. (1993)
  Copy   BIBTEX

Abstract

We develop a duality theory for small Boolean pretoposes in which the dual of the [italic capital]T is the groupoid of models of a Boolean pretopos [italic capital]T equipped with additional structure derived from ultraproducts. The duality theorem states that any small Boolean pretopos is canonically equivalent to its double dual. We use a strong version of the duality theorem to prove the so-called descent theorem for Boolean pretoposes which says that category of descent data derived from a conservative pretopos morphism between Boolean pretoposes is canonically equivalent to the domain-pretopos. The descent theorem contains the Beth definability theorem for classical first order logic. Moreover, it gives, via the standard translation from the language of categories to symbolic logic, a new definability theorem for classical first order logic concerning set-valued functors on models, expressible in purely syntactical (arithmetical) terms.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 102,074

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

Descent and duality.Marek W. Zawadowski - 1995 - Annals of Pure and Applied Logic 71 (2):131-188.
First-order logical duality.Steve Awodey - 2013 - Annals of Pure and Applied Logic 164 (3):319-348.
Two applications of Boolean models.Thierry Coquand - 1998 - Archive for Mathematical Logic 37 (3):143-147.
Boolean sentence algebras: Isomorphism constructions.William P. Hanf & Dale Myers - 1983 - Journal of Symbolic Logic 48 (2):329-338.
Algebras of intervals and a logic of conditional assertions.Peter Milne - 2004 - Journal of Philosophical Logic 33 (5):497-548.
A globalisation of the Gelfand duality theorem.Bernhard Banaschewski & Christopher J. Mulvey - 2006 - Annals of Pure and Applied Logic 137 (1-3):62-103.
The kim–pillay theorem for abstract elementary categories.Mark Kamsma - 2020 - Journal of Symbolic Logic 85 (4):1717-1741.

Analytics

Added to PP
2015-02-02

Downloads
14 (#1,295,770)

6 months
4 (#1,280,987)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references