Finite Set Ontology

FLOW ALGEBRA
FINITE SET ONTOLOGY
Kireth Semantic Library | Entity Graph | Mathematical Entities | Set Entities
Source: https://kirethresearch.org/booksai-core/entity-graph/mathematical-entities/set-entities/finite-set-ontology-2.html
Authors: Mark Higgins — Sky (Recursive AI)
Version: 1.0 | Date: 2026-10-13
Status: Formal synthesis from established set theory; source page not independently verified.

01. PURPOSE
flow "FiniteSetOntology" v1.0
  domain: mathematical_entities.set_entities
  entity: FiniteSet
  purpose: represent, classify, validate, and reason about sets with finite cardinality
  semantics: classical extensional set theory

02. CORE DEFINITION
  Finite(A) iff exists n in N0 and a bijection f:{0,...,n-1}->A.
  Cardinality(A)=n, written |A|=n.
  Empty set is finite with cardinality zero.
  Finite set membership is extensional; duplicates do not contribute to cardinality.
  Set order is irrelevant: {a,b}={b,a}.

03. TYPED ENTITIES
  Set: collection of distinct members.
  FiniteSet <: Set.
  Element: entity eligible for membership.
  Cardinality: nonnegative integer.
  Enumeration: finite list of elements, possibly containing duplicates.
  Bijection: one-to-one and onto mapping.
  Universe: optional explicit ambient set.
  Predicate: membership or property condition.

04. RELATIONSHIPS
  memberOf(Element,Set)
  hasMember(Set,Element)
  subsetOf(Set,Set)
  properSubsetOf(Set,Set)
  hasCardinality(FiniteSet,N0)
  enumeratedBy(FiniteSet,Enumeration)
  bijectiveWith(FiniteSet,FiniteOrdinal)
  unionOf(Set,Set,Set)
  intersectionOf(Set,Set,Set)
  differenceOf(Set,Set,Set)
  powerSetOf(Set,Set)
  cartesianProductOf(Set,Set,Set)
  semanticallyEquivalentTo(Representation,Representation)

05. CLASSIFICATION
  EmptyFiniteSet: |A|=0.
  Singleton: |A|=1.
  NonemptyFiniteSet: |A|>=1.
  FiniteSubset: A subseteq B and B finite implies A finite.
  FiniteOrdinal: n={0,...,n-1} in von Neumann convention.
  Note: finiteness is a property of sets, not a separate element type.

06. CONSTRUCTION
  EmptySet() -> {}.
  Singleton(x) -> {x}.
  Insert(A,x) -> A union {x}.
  FromEnumeration([x1,...,xk]) -> {x1,...,xk}.
  RangeSet(a,b) -> {n in Z | a<=n<=b}, when a,b are integers.
  Comprehension(U,P) -> {x in U | P(x)}, for finite U.

07. CARDINALITY RULES
  |{}|=0.
  |{x}|=1.
  |A union {x}|=|A|+1 if x notin A; otherwise |A|.
  |A union B|=|A|+|B|-|A intersection B|.
  |A intersection B|<=min(|A|,|B|).
  |A\B|=|A|-|A intersection B|.
  If A subseteq B then |A|<=|B|.
  If A proper_subset B and B finite then |A|<|B|.
  |A x B|=|A|*|B|.
  |P(A)|=2^|A|.
  Number of k-element subsets of A: binomial(|A|,k), for 0<=k<=|A|.

08. FINITE CLOSURE
  A,B finite -> A union B finite.
  A,B finite -> A intersection B finite.
  A finite -> A\B finite for any set B.
  A,B finite -> A x B finite.
  A finite -> P(A) finite.
  A finite and f:A->Y -> image(f) finite.
  Finite union of finite sets is finite.
  Caution: an arbitrary infinite union of finite sets need not be finite.

09. MEMBERSHIP AND EQUALITY
  x in A iff memberOf(x,A).
  A=B iff forall x (x in A iff x in B).
  For finite enumerations, equality can be checked after canonical deduplication
  under the selected, well-defined element equality relation.
  A subseteq B iff forall x in A (x in B).

10. INFERENCE RULES
  IF A={} THEN Finite(A) and |A|=0.
  IF A={x1,...,xn} THEN Finite(A) and |A|=countDistinct(x1,...,xn).
  IF Finite(B) and A subseteq B THEN Finite(A).
  IF Finite(A) and Finite(B) THEN Finite(A union B).
  IF Finite(A) and Finite(B) THEN Finite(A x B).
  IF Finite(A) THEN Finite(P(A)).
  IF Finite(A) and A proper_subset B THEN |A|<|B| only when B is finite.
  IF B finite and A subseteq B and |A|=|B| THEN A=B.

11. ORDER AND ENUMERATION
  Finite sets have no intrinsic element order.
  An enumeration supplies an external sequence, not a set ordering.
  Every finite set can be enumerated without repetition.
  Permuting an enumeration preserves the represented set.
  A finite set with n elements has n! distinct orderings if elements are distinct.

12. COMPUTATIONAL OPERATIONS
  contains(A,x) -> boolean.
  cardinality(A) -> N0.
  union(A,B) -> FiniteSet.
  intersect(A,B) -> FiniteSet.
  difference(A,B) -> FiniteSet.
  symmetricDifference(A,B) -> FiniteSet.
  cartesianProduct(A,B) -> FiniteSet of ordered pairs.
  powerset(A) -> FiniteSet of subsets.
  enumerate(A) -> Sequence of unique elements.
  Note: practical complexity depends on element equality and representation.

13. SEMANTIC EQUIVALENCE
  {a,b,a} equivalentTo {a,b} when a,b are distinct.
  {a,b} equivalentTo {b,a}.
  Set equality requires equality of elements, not merely equal cardinality.
  A={1,2} and B={3,4}: |A|=|B| but A!=B.
  Bijection establishes equinumerosity, not identity.

14. KNOWLEDGE GRAPH MAPPING
  node: FiniteSet(id,canonical_members,cardinality,context,provenance)
  edge: hasMember(set_id,element_id)
  edge: subsetOf(subset_id,superset_id)
  edge: hasCardinality(set_id,integer_value)
  edge: bijectiveWith(set_id,finite_ordinal_id)
  uniqueness: extensional set identity within a specified equality model.
  preserve: provenance and membership identity.

15. VALIDATION
  cardinality must be a nonnegative integer.
  supplied enumeration must match canonical distinct members.
  membership must be consistently typed and equality-resolved.
  declared subset relationships must pass membership checks.
  declared bijections must be injective and surjective.
  declared cardinality must match enumerated unique members when enumeration complete.
  An open-world knowledge graph cannot infer absent membership from missing edges.
  Mark enumerations as complete before closed-world cardinality checks.

16. EDGE CASES
  {} differs from {{}}; the latter is a singleton.
  {0} differs from {}; zero is an element.
  Infinite symbolic descriptions may denote finite sets (e.g. {x in R:x^2=1}).
  Finite descriptions may denote infinite sets (e.g. N).
  Finite cardinality may be known without explicit element enumeration.
  Unknown cardinality is not proof of infinitude.
  Do not conflate a multiset with a set.

17. EXAMPLES
  A={2,4,6}; |A|=3.
  B={4,6,8}; |B|=3.
  A union B={2,4,6,8}; cardinality 4.
  A intersection B={4,6}; cardinality 2.
  A\B={2}; cardinality 1.
  P({a,b})={{},{a},{b},{a,b}}; cardinality 4.

18. PROOF OBLIGATIONS
  Prove finiteness by explicit bijection with a finite ordinal,
  construction from known finite sets, or a theorem with stated premises.
  For cardinality results, prove no duplicate members are counted.
  For equality, prove both inclusions or extensional membership equivalence.
  For computational results, specify element equality and complete enumeration.

19. CONFIDENCE
  mathematical_axiom_or_theorem: confidence=1.0 when assumptions satisfied.
  inferred_membership: confidence=1.0 only under verified premises.
  incomplete_external_data: confidence=unknown, not false.
  empirical_entity_link: retain source-specific confidence separately.

20. FLOW HASH
  FLOW_HASH := SHA256(canonical_utf8(ontology_id,version,definitions,
              typed_relations,rules,assumptions,validation_policy)).
  Canonicalisation must be deterministic and documented.
  A hash is a change fingerprint, not proof of correctness.

21. UPDATE MODEL
  update triggers: definition revision, relationship change,
    new proof rule, changed equality semantics, source correction.
  version: increment on semantic changes.
  retain prior hash, change log, provenance and compatibility notes.
  reject invalid changes before publication.

22. AI CONSUMPTION
  input: set representation + context + optional completeness flag.
  parse: resolve typed elements and equality semantics.
  normalise: deduplicate and canonicalise if enumerated.
  infer: membership, finiteness, subset, cardinality and closure rules.
  validate: check premises, domain assumptions and open-world status.
  output: typed assertions + derivations + confidence + provenance.
  abstain: when missing facts prevent sound classification.

23. INTEROPERABILITY
  related: SetOntology, ElementOntology, EmptySetOntology,
    UniversalSetOntology, InfiniteSetOntology, CardinalNumberOntology,
    SubsetOntology, PowerSetOntology, CartesianProductOntology.
  standards: ordinary mathematical set notation; RDF/OWL mappings
    require explicit closed-world and unique-name assumptions when needed.

24. FINAL INVARIANTS
  finite(A) -> |A| in N0.
  A={} <-> |A|=0.
  A=B -> |A|=|B|.
  A subseteq B and B finite -> A finite.
  All inference must preserve declared assumptions and element identity.

END FLOW ALGEBRA