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

Links

PhilArchive



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

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

On the Foundations of Corecursion.Lawrence Moss & Norman Danner - 1997 - Logic Journal of the IGPL 5 (2):231-257.
An Application of Non‐Wellfounded Sets to the Foundations of Geometry.Jan Kuper - 1991 - Mathematical Logic Quarterly 37 (17):257-264.
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.
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.
An Application of Non-Wellfounded Sets to the Foundations of Geometry.Jan Kuper - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (17):257-264.

Analytics

Added to PP
2010-08-24

Downloads
33 (#472,388)

6 months
12 (#305,852)

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

Rank in set theory without foundation.M. Victoria Marshall & M. Gloria Schwarze - 1999 - Archive for Mathematical Logic 38 (6):387-393.

Add more references