Hypersets
Several elegant solutions of problems in theoretical computer science, e.g. the constructions of natural models of the \(\lambda\)-calculus by \textit{M. von Rimscha} [Arch. Math. Logik Grundlagenforsch. 20, 65--73 (1980; Zbl 0428.03045)], have brought to the attention of a larger audience the usefulness of alternatives to the axiom of foundation. A systematic study of such principles (generalizations of Mostowski's collapse combined with various forms of extensionality) has been initiated by \textit{P. Hajek} [Z. Math. Logik Grundlagen Math. 11, 103--115 (1965; Zbl 0171.26402)] and \textit{M. Boffa} [ibid. 14, 329--334 (1968; Zbl 0169.30603)]. In the paper under review the authors give an introduction into one of these alternatives, the antifoundation axiom AFA in \textit{P. Aczel's} terminology [Non-well-founded sets. CSLI Lecture Notes, 14. Stanford, CA (1988; Zbl 0668.04001)]. The purpose of this paper is to convince the reader that AFA ``is an interesting, mathematically and philosophically respectable alternative to the axiom of foundation.
- A Cook's tour of the finitary non-well-founded sets
- Axiomatic set theory. With a historical introduction by Abraham A. Fraenkel
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 42737 (Why is no real title available?)
- scientific article; zbMATH DE number 44058 (Why is no real title available?)
- scientific article; zbMATH DE number 3494394 (Why is no real title available?)
- scientific article; zbMATH DE number 3508797 (Why is no real title available?)
- scientific article; zbMATH DE number 719912 (Why is no real title available?)
- scientific article; zbMATH DE number 3289430 (Why is no real title available?)
- Non-well-founded sets modeled as ideal fixed points
- Set theory. An introduction to independence proofs
- Anti-foundation and self-reference
- Issues in commonsense set theory
- A general construction of hyperuniverses
- HYPERSOLVER: A graphical tool for commonsense set theory
- An efficient algorithm for computing bisimulation equivalence
- Well-quasi-ordering hereditarily finite sets
- On the negation of the axiom of foundation
- scientific article; zbMATH DE number 408791 (Why is no real title available?)
- Anti-admissible sets
- scientific article; zbMATH DE number 740994 (Why is no real title available?)
- scientific article; zbMATH DE number 1107504 (Why is no real title available?)
- Scanning the structure of ill‐known spaces: Part 1. Founding principles about mathematical constitution of space
- scientific article; zbMATH DE number 2076192 (Why is no real title available?)
- scientific article; zbMATH DE number 2152234 (Why is no real title available?)
- Inconsistency of GPK + AFA
- HYPERINCURSIVE METHODS FOR GENERATING FRACTALS IN AUTOMATA RELATED TO DIFFUSION AND WAVE EQUATIONS
- Final semantics for a higher order concurrent language
- Antifoundation and transitive closure in the system of Zermelo
- The graph conception of set
This page was built for publication: Hypersets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181863)