Cumulative hierarchies and computability over universes of sets

Cumulative hierarchies and computability over universes of sets

<p>Various metamathematical investigations, beginning with Fraenkel&rsquo;s historical proof of the independence of the axiom of choice, called for suitable definitions of hierarchical universes of sets. This led to the discovery of such important cumulative structures as the one singled ou...

Full description

Bibliographic Details
Main Authors: Domenico Cantone, Claudio Chiaruttini, Marianna Nicolosi Asmundo, Eugenio G. Omedeo
Format: Article
Language:English
Published: Università degli Studi di Catania 2008-05-01
Series:Le Matematiche
Subjects:
Set theory
Computable set theory
Cumulative hierarchies
Superstructures
Hereditarily finite sets
Constructible sets
Hypersets
Proof verification, Syllogistics
Online Access:http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/48

Internet

http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/48

Similar Items