Published package / CLIR

stacks.sets

v0.1.0

Set Theory

A package can be printed as a standalone module in a general-purpose language that answers without the rules engine: an answer and its status, with no proof, hashes or canonical document. Everything on this page comes from the generation plan built with the index; the gallery computes nothing of its own.

Generation plan

The plan builds: the package can be printed as a module.

plan format
law-backend-plan/0.7
capabilities
base layer only

Checked against package scenarios

Not checked: the package scenarios have not been run against generated modules. A plan that builds does not yet show that the answers coincide.

Target languages

print this planbslcsdarterlexgojavaktluaphppyrbrsscalaswiftts

Print the module from a repository checkout

./law dev backend corpus/clir/stacks-sets.lawir.json --target ts --target py --target go --out DIR

Module interface

Questions are public relations with a producing rule; inputs are the facts a question reads. Function names follow the language: ask_… in Python, ask.… in TypeScript, Ask… in Go.

Questions · 5

NameParametersMeaningReadsSources
countabletext000D: the set is countableat_most_aleph_nullcardinality_oftag/000D
exists_ordinal_of_large_cofinalitytext05N3: there exists an ordinal whose cofinality is bigger than the cardinal — the cofinality of an ordinal being the least cardinality of a cofinal subset of it (000E)infinitetag/05N3tag/000E
lies_in_some_stagetext000C: the set is an element of \(V_alpha\) for some ordinal \(alpha\)element_ofhas_rankis_ordinalis_partial_universeis_setstage_oftag/000Ctag/000B
product_istext, text, text000D: the cardinal product of the first two cardinals equals the third: \(k (x) l = m\), the cardinality of the productat_leastinfinitetag/000D
sum_istext, text, text000D: the cardinal sum of the first two cardinals equals the third: \(k (+) l = m\), the cardinality of the disjoint unionat_leastinfinitetag/000D

Inputs · 10

NameParametersMeaning
at_leasttext, text000D: the first cardinal is greater than or equal to the second in the well-ordering of the ordinals: \(k >= l\)
at_most_aleph_nulltext000D: the cardinal is at most \(aleph_0\)
cardinality_oftext, text000D: the cardinality of the set is the cardinal — the least ordinal admitting a bijection with the set, written \(k = |s|\)
element_oftext, text000B: the set is an element of the partial universe: \(s\) in \(V_alpha\)
has_ranktext, text000B: the rank of the set is the ordinal — the least \(alpha\) such that \(s\) is an element of \(V_{alpha+1}\)
infinitetext000D: the cardinal is infinite — it is at least the first infinite cardinal \(aleph_0 = omega\)
is_ordinaltext05N1: the set is an ordinal — transitive and well-ordered by the membership relation
is_partial_universetext000B: the set is a partial universe — a suitably large set of the form \(V_alpha\), transitive by construction
is_settext0009: the object is a set — every mathematical object unravels into a set
stage_oftext, text000B: the partial universe is the stage of the given ordinal: \(v = V_alpha\), defined by transfinite recursion \(V_0 = 0\), \(V_{alpha+1} = P(V_alpha)\), \(V_alpha\) = union of earlier stages at a limit