LargeCardinalHierarchy: A transfinite cardinal arithmetic library including all known large cardinals

[ library, math, mathematics, maths, set-theory ] [ Propose Tags ]


  • LargeCardinalHierarchy


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.0.0, 0.0.1
Dependencies base (>=2 && <4) [details]
License LicenseRef-OtherLicense
Copyright Copyright (c) 2010 Stephen E. A. Britton
Author Stephen E. A. Britton
Maintainer Stephen E. A. Britton
Category Math, Maths, Mathematics, Set Theory
Uploaded by Stephen_E_A_Britton at 2014-09-07T19:14:56Z
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 2001 total (7 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-10-25 [all 9 reports]

Readme for LargeCardinalHierarchy-0.0.1

[back to package description]
Copyright (c) 2010 Stephen E. A. Britton.
All rights reserved.

The LargeCardinalHierarchy module defines a recursively enumerable, countably infinite subclass of the logically (consistent) maximal transfinite set-theoretic universe ZFC+Con(LargeCardinals) (Zermelo-Frankel Set Theory + Axiom of Choice + All known large cardinals consistent with ZFC) via data constructors for each large cardinal within the hierarchy and functions over them. The algebraic data type Card is a Haskell implementation of the set theoretic proper class of all cardinals, Card. Card has value constructors for a countably infinite (aleph-null sized) subset of every cardinal type of all known large cardinals consistent with ZFC (Zermelo-Frankel Set Theory + Axiom of Choice) or, equivalently, ZF+GCH (Zermelo-Frankel Set Theory + Generalized Continuum Hypothesis).