First-order logical duality

Annals of Pure and Applied Logic 164 (3):319-348 (2013)
  Copy   BIBTEX

Abstract

From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models can be topologized in such a way that the theory can be recovered from its space of models. The situation can be cast as a formal duality relating two categories of syntax and semantics, mediated by homming into a common dualizing object, in this case 2.In the present work, we generalize the entire arrangement from propositional to first-order logic, using a representation result of Butz and Moerdijk. Boolean algebras are replaced by Boolean categories presented by theories in first-order logic, and spaces of models are replaced by topological groupoids of models and their isomorphisms. A duality between the resulting categories of syntax and semantics, expressed primarily in the form of a contravariant adjunction, is established by homming into a common dualizing object, now Sets, regarded once as a boolean category, and once as a groupoid equipped with an intrinsic topology.The overall framework of our investigation is provided by topos theory. Direct proofs of the main results are given, but the specialist will recognize toposophical ideas in the background. Indeed, the duality between syntax and semantics is really a manifestation of that between algebra and geometry in the two directions of the geometric morphisms that lurk behind our formal theory. Along the way, we give an elementary proof of Butz and Moerdijkʼs result in logical terms

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

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

Through your library

Analytics

Added to PP
2010-08-22

Downloads
145 (#125,668)

6 months
29 (#104,868)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Steve Awodey
Carnegie Mellon University

Citations of this work

What Scientific Theories Could Not Be.Hans Halvorson - 2012 - Philosophy of Science 79 (2):183-206.
Morita Equivalence.Thomas William Barrett & Hans Halvorson - 2016 - Review of Symbolic Logic 9 (3):556-582.
Scientific Theories.Hans Halvorson - 2016 - In Paul Humphreys (ed.), The Oxford Handbook of Philosophy of Science. Oxford University Press USA. pp. 585-608.
What Do Symmetries Tell Us About Structure?Thomas William Barrett - 2017 - Philosophy of Science (4):617-639.

View all 17 citations / Add more citations

References found in this work

Reducts of random hypergraphs.Simon Thomas - 1996 - Annals of Pure and Applied Logic 80 (2):165-193.
Reducts of the random graph.Simon Thomas - 1991 - Journal of Symbolic Logic 56 (1):176-181.
A theorem on barr-exact categories, with an infinitary generalization.Michael Makkai - 1990 - Annals of Pure and Applied Logic 47 (3):225-268.
Strong conceptual completeness for first-order logic.Michael Makkai - 1988 - Annals of Pure and Applied Logic 40 (2):167-215.

View all 8 references / Add more references