Hostname: page-component-8448b6f56d-t5pn6 Total loading time: 0 Render date: 2024-04-24T15:37:33.611Z Has data issue: false hasContentIssue false

Anti-admissible sets

Published online by Cambridge University Press:  12 March 2014

Jacob Lurie*
Affiliation:
6611 Braeburn Parkway, Bethesda, Maryland 20817, USA E-mail: lurie@fas.harvard.edu

Abstract

Aczel's theory of hypersets provides an interesting alternative to the standard view of sets as inductively constructed, well-founded objects, thus providing a convienent formalism in which to consider non-well-founded versions of classically well-founded constructions, such as the “circular logic” of [3], This theory and ZFC are mutually interpretable; in particular, any model of ZFC has a canonical “extension” to a non-well-founded universe. The construction of this model does not immediately generalize to weaker set theories such as the theory of admissible sets. In this paper, we formulate a version of Aczel's antifoundation axiom suitable for the theory of admissible sets. We investigate the properties of models of the axiom system KPU, that is, KPU with foundation replaced by an appropriate strengthening of the extensionality axiom. Finally, we forge connections between “non-wellfounded sets over the admissible set A” and the fragment LA of the modal language L.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1999

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

[1] Aczel, Peter, Non-well-founded sets, CSLI Publications, Stanford, 1988.Google Scholar
[2] Barwise, Jon, Admissible sets and structures, Springer-Verlag, Berlin, 1975.Google Scholar
[3] Barwise, Jon and Etchemendy, John, The liar: An essay in truth and circularity, Oxford University Press, Oxford, 1987.Google Scholar
[4] Barwise, Jon and Moss, Lawrence, Vicious circles, CSLI Publications, Stanford, 1996.Google Scholar
[5] Sacks, Gerald E., Higher recursion theory, Springer-Verlag, New York, 1990.Google Scholar