Stage Comparison, Fixed Points, and Least Fixed Points in Kripke–Platek Environments

Notre Dame Journal of Formal Logic 63 (4):443-461 (2022)
  Copy   BIBTEX

Abstract

Let T be Kripke–Platek set theory with infinity extended by the axiom (Beta) plus the schema that claims that every set-bounded Σ-definable monotone operator from the collection of all sets to Pow(a) for some set a has a fixed point. Then T proves that every such operator has a least fixed point. This result is obtained by following the proof of an analogous result for von Neumann–Bernays–Gödel set theory in an earlier work by Sato, with some minor modifications.

Links

PhilArchive



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

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
2023-01-05

Downloads
6 (#1,485,580)

6 months
4 (#862,833)

Historical graph of downloads
How can I increase my downloads?