On Non-wellfounded Sets as Fixed Points of Substitutions

Notre Dame Journal of Formal Logic 42 (1):23-40 (2001)
  Copy   BIBTEX

Abstract

We study the non-wellfounded sets as fixed points of substitution. For example, we show that ZFA implies that every function has a fixed point. As a corollary we determine for which functions f there is a function g such that . We also present a classification of non-wellfounded sets according to their branching structure

Other Versions

No versions found

Similar books and articles

On the Foundations of Corecursion.Lawrence Moss & Norman Danner - 1997 - Logic Journal of the IGPL 5 (2):231-257.
Broadening the Iterative Conception of Set.Mark F. Sharlow - 2001 - Notre Dame Journal of Formal Logic 42 (3):149-170.
Non-wellfounded Mereology.Aaron J. Cotnoir & Andrew Bacon - 2012 - Review of Symbolic Logic 5 (2):187-204.
An Application of Non‐Wellfounded Sets to the Foundations of Geometry.Jan Kuper - 1991 - Mathematical Logic Quarterly 37 (17):257-264.
Saccharinity.Jakob Kellner & Saharon Shelah - 2011 - Journal of Symbolic Logic 76 (4):1153-1183.
Definable fixed points in modal and temporal logics — a survey.Sergey Mardaev - 2007 - Journal of Applied Non-Classical Logics 17 (3):317-346.
Density and Baire category in recursive topology.Iraj Kalantari & Larry Welch - 2004 - Mathematical Logic Quarterly 50 (4-5):381-391.
On the weak Kleene scheme in Kripke's theory of truth.James Cain & Zlatan Damnjanovic - 1991 - Journal of Symbolic Logic 56 (4):1452-1468.

Analytics

Added to PP
2010-08-24

Downloads
94 (#563,390)

6 months
15 (#800,110)

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

Non-Well-Founded Sets.Peter Aczel - 1988 - Palo Alto, CA, USA: Csli Lecture Notes.
Rank in set theory without foundation.M. Victoria Marshall & M. Gloria Schwarze - 1999 - Archive for Mathematical Logic 38 (6):387-393.

Add more references