Ordinal Number Ontology

FLOW ALGEBRA
ORDINAL NUMBER ONTOLOGY
Kireth Semantic Library | Entity Graph | Mathematical Entities | Number Entities
Source: https://kirethresearch.org/booksai-core/entity-graph/mathematical-entities/number-entities/ordinal-number-ontology.html
Authors: Mark Higgins — Sky (Recursive AI)
Version: 1.0 | Date: 2026-10-12
Status: Formal mathematical specification; source-page text not independently verified.

01. ONTOLOGY IDENTITY
flow "OrdinalNumberOntology" v1.0
ontology.id: kireth.entity-graph.mathematical.number.ordinal
ontology.label: Ordinal Number Ontology
ontology.domain: set_theory
ontology.entity_type: ordinal_number
ontology.purpose: Represent order types of well-ordered sets and enable exact ordinal reasoning.

02. MATHEMATICAL FOUNDATION
Let Ord be the proper class of all ordinals.
Under the von Neumann representation, an ordinal alpha is a transitive set whose membership relation is a well-order.
Every ordinal is the set of all smaller ordinals: alpha = { beta : beta < alpha }.
Ordinal comparison: alpha < beta iff alpha is an element of beta.
For ordinals alpha,beta, exactly one holds: alpha < beta, alpha = beta, beta < alpha.
There is no set of all ordinals (Burali-Forti paradox).

03. TYPED ENTITIES
entity Ordinal { symbol: String; representation: Set; is_transitive: Boolean; well_ordered_by_membership: Boolean }
entity FiniteOrdinal extends Ordinal { natural_index: NaturalNumber }
entity InfiniteOrdinal extends Ordinal { lower_bound: omega }
entity SuccessorOrdinal extends Ordinal { predecessor: Ordinal }
entity LimitOrdinal extends Ordinal { nonzero: Boolean; has_immediate_predecessor: false }
entity WellOrderedSet { elements: Set; order_relation: Relation; order_type: Ordinal }
entity OrderIsomorphism { source: WellOrderedSet; target: WellOrderedSet; bijective: true; order_preserving: true }
entity CardinalNumber { initial_ordinal: Ordinal }

04. CONSTRUCTORS
zero := empty_set
successor(alpha) := alpha union {alpha}
omega := supremum({0,1,2,...})
supremum(S) := union(S), where S is a set of ordinals
order_type(W) := unique ordinal order-isomorphic to well-ordered set W

05. CLASSIFICATION
zero_ordinal: 0
finite_ordinals: 0,1,2,...
first_infinite_ordinal: omega
successor: beta + 1
limit: nonzero ordinal not expressible as beta + 1
examples.limit: omega, omega*2, omega^2
examples.successor: 1, 2, omega+1
NOTE: Zero is neither successor nor limit under the nonzero-limit convention.

06. RELATIONSHIPS
Ordinal --IS_A--> MathematicalEntity
FiniteOrdinal --IS_A--> Ordinal
InfiniteOrdinal --IS_A--> Ordinal
SuccessorOrdinal --IS_A--> Ordinal
LimitOrdinal --IS_A--> Ordinal
Ordinal --ORDER_TYPE_OF--> WellOrderedSet
Ordinal --WELL_ORDERED_BY--> MembershipRelation
Ordinal --SUCCESSOR_OF--> Ordinal
Ordinal --LESS_THAN--> Ordinal
InitialOrdinal --REPRESENTS_CARDINALITY--> CardinalNumber
Ordinal --DISTINCT_FROM--> CardinalNumber

07. ORDINAL ORDER AXIOMS
forall alpha,beta in Ord: alpha < beta OR alpha = beta OR beta < alpha
forall alpha,beta,gamma: (alpha < beta AND beta < gamma) => alpha < gamma
forall nonempty set S subset Ord: exists least element of S
forall alpha: NOT(alpha < alpha)
forall alpha: alpha < successor(alpha)

08. ORDINAL ADDITION
alpha + 0 = alpha
alpha + (beta + 1) = successor(alpha + beta)
alpha + lambda = sup{ alpha + beta : beta < lambda }, for nonzero limit lambda
Addition is associative, but generally not commutative.
example: 1 + omega = omega
example: omega + 1 > omega

09. ORDINAL MULTIPLICATION
alpha * 0 = 0
alpha * (beta + 1) = (alpha * beta) + alpha
alpha * lambda = sup{ alpha * beta : beta < lambda }, for nonzero limit lambda
Multiplication is associative, but generally not commutative.
example: 2 * omega = omega
example: omega * 2 > omega
Left distributivity: alpha*(beta+gamma) = alpha*beta + alpha*gamma.
Right distributivity does not generally hold.

10. ORDINAL EXPONENTIATION
alpha^0 = 1
alpha^(beta+1) = alpha^beta * alpha
alpha^lambda = sup{alpha^beta : beta < lambda}, for nonzero limit lambda and alpha > 0
For alpha = 0 and lambda > 0: 0^lambda = 0.
example: omega^2 > omega

11. INFINITE ORDINALS AND CARDINALITY
omega is the order type of the natural numbers in their usual order.
omega and omega+1 have the same cardinality but different order types.
Every cardinal can be represented by its least equipotent ordinal (initial ordinal), assuming standard well-ordering/cardinal conventions.
Ordinal equality concerns order type, not only number of elements.

12. TRANSFINITE INDUCTION
Given predicate P on ordinals:
If forall alpha, (forall beta < alpha: P(beta)) => P(alpha),
then forall alpha: P(alpha).
This is a theorem schema of ordinal well-ordering.

13. TRANSFINITE RECURSION
A recursion rule assigning F(alpha) from the earlier values F restricted to alpha defines a unique class function under appropriate definability assumptions.
Use separate successor and limit clauses where the operation requires them.

14. SEMANTIC EQUIVALENCE
semantic_equivalence(alpha,beta) := ordinal_equal(alpha,beta)
order_type_equivalence(W1,W2) := exists order_isomorphism(W1,W2)
NOT equivalent: same_cardinality(W1,W2) does not imply same_order_type(W1,W2).
Alias terms: ordinal, ordinal number, well-order type (context-sensitive).

15. REASONING AND INFERENCE
RULE R1: ordinal(alpha) => transitive(alpha) AND well_ordered(alpha,membership)
RULE R2: ordinal(alpha) => ordinal(successor(alpha))
RULE R3: set_of_ordinals(S) => ordinal(union(S))
RULE R4: ordinal(alpha) AND ordinal(beta) => comparable(alpha,beta)
RULE R5: order_isomorphic(W1,W2) => order_type(W1) = order_type(W2)
RULE R6: ordinal(alpha) AND alpha != 0 AND NOT exists beta(alpha=successor(beta)) => limit_ordinal(alpha)
RULE R7: alpha < beta => alpha subset beta
RULE R8: alpha = beta => same_cardinality(alpha,beta)
RULE R9: same_cardinality(alpha,beta) DOES_NOT_IMPLY alpha = beta

16. VALIDATION AND CONSTRAINTS
validate.ordinal(x): require x is a set, transitive, and well-ordered by membership.
validate.successor(alpha,beta): require beta = alpha union {alpha}.
validate.limit(alpha): require alpha != 0 and alpha has no immediate predecessor.
validate.order_type(W,alpha): require W well-ordered and W order-isomorphic to alpha.
validate.arithmetic: respect recursion on right operand.
reject: assertion that ordinal addition is commutative.
reject: assertion that all equipotent ordinals are equal.
reject: treating Ord as a set.

17. CONFIDENCE AND PROVENANCE
confidence.mathematical_definitions: high
confidence.examples: high
confidence.source_page_alignment: unverified
provenance.source_url: https://kirethresearch.org/booksai-core/entity-graph/mathematical-entities/number-entities/ordinal-number-ontology.html
provenance.basis: standard axiomatic set theory and ordinal arithmetic

18. FLOW HASH AND UPDATE MODEL
FLOW_HASH.algorithm: SHA-256
FLOW_HASH.input: canonical_utf8(ontology.id + ontology.version + normalized_flow_body)
FLOW_HASH.value: generated_by_implementing_system
UPDATE_MODEL.strategy: versioned_semantic_revision
UPDATE_MODEL.invariants: preserve formal definitions; preserve provenance; verify all inference rules
UPDATE_MODEL.change_types: definition_correction, entity_extension, relation_extension, validation_revision

19. AI CONSUMPTION
AI_CONSUMPTION.mode: typed_semantic_reasoning
AI_CONSUMPTION.primary_tasks: classification, order_comparison, order_type_inference, transfinite_recursion, theorem_checking
AI_CONSUMPTION.output: {entity_id, ordinal_expression, classification, relations, derivation, confidence, provenance}
AI_CONSUMPTION.safety: do not infer ordinal equality from equal cardinality
AI_CONSUMPTION.exactness: use symbolic ordinals; do not substitute floating-point approximations

20. EXAMPLE QUERIES
query: Is omega a limit ordinal? => yes
query: Is omega+1 a successor ordinal? => yes
query: Is omega+1 equal to 1+omega? => no
query: Do omega and omega+1 have equal cardinality? => yes
query: Is zero a limit ordinal? => no (nonzero-limit convention)

END FLOW ALGEBRA