Stage comparison, fixed points, and least fixed points in Kripke–Platek environments

Jäger, Gerhard (2022). Stage comparison, fixed points, and least fixed points in Kripke–Platek environments. Notre Dame journal of formal logic, 63(4), pp. 443-461. Duke University Press 10.1215/00294527-2022-0025

Full text not available from this repository.

et 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.

Item Type:

Journal Article (Original Article)

Division/Institute:

08 Faculty of Science > Institute of Computer Science (INF) > Logic and Theory Group (LTG)
08 Faculty of Science > Institute of Computer Science (INF)

UniBE Contributor:

Jäger, Gerhard Max

Subjects:

000 Computer science, knowledge & systems
500 Science > 510 Mathematics

ISSN:

0029-4527

Publisher:

Duke University Press

Language:

English

Submitter:

Atefeh Rohani

Date Deposited:

25 Jan 2023 11:05

Last Modified:

25 Jan 2023 23:28

Publisher DOI:

10.1215/00294527-2022-0025

URI:

https://boris.unibe.ch/id/eprint/177370

Actions (login required)

Edit item Edit item
Provide Feedback