Skip to content

Axiom Schema Catalog

Reference catalog — instantiates Formal Derivation System Design

Organizes the system's granted starting statements as parametrized schemas — templates standing for infinitely many concrete axioms — kept strictly apart from imported external facts.

Version
v1 · 2026-08-24 · History
Mechanism #
626
Type
Reference Catalog
Form family
Representation, Specification & Plan
Solution family
Representation & Modeling
Problem family
Correctness, Conformance & Formal Validity Failure
Problem subfamily
Logical Claim & Derivation Validity
Origin domain
Mathematics
Also from
Philosophy
Instantiates
Formal Derivation System Design

An Axiom Schema Catalog holds the statements a formal system grants for free — the starting points every derivation is entitled to assume without proof — and organizes them as schemas: templates with metavariables that stand in for any well-formed expression, so a single line can license infinitely many concrete axioms. Its defining commitment is a bookkeeping one: it is the register of what is granted, and it draws a hard line between genuine axioms and everything that merely looks axiomatic — definitions, temporary assumptions, and above all external facts imported from the world. It says nothing about how to move between statements; it only fixes where movement is allowed to begin.

Example

A logic tutor tool implements a Hilbert-style propositional calculus, and its axiom base is a catalog of exactly three schemas:

  1. A → (B → A)
  2. (A → (B → C)) → ((A → B) → (A → C))
  3. (¬B → ¬A) → (A → B)

Here A, B, C are metavariables ranging over any well-formed formula, so schema 1 alone stands for p → (q → p), (p∧q) → (r → (p∧q)), and endlessly many more — a finite catalog generating an infinite axiom base. The catalog does one more crucial thing: when a student tries to add it is Tuesday as an axiom, it refuses, tagging that as an external fact to be admitted, if at all, through the gateway as an explicit assumption — never quietly promoted into the granted base where every downstream theorem would silently inherit it.

How it works

  • State schemas, not just axioms. Each entry is a template over metavariables that range over well-formed expressions; any legal substitution instance is an axiom, giving a finite presentation of an infinite base.
  • Tag provenance. Every entry is marked as axiom, definition, standing assumption, or external fact, so the granted set is never confused with the merely stipulated or the empirically imported.
  • Gate external facts. Statements about the world enter only through an explicit gateway as flagged assumptions, keeping the axiom base pure and its commitments visible.
  • Note minimality and independence. The catalog records whether the base is intended to be minimal and whether any axiom is derivable from the others, so redundancy and hidden strength are visible.

Tuning parameters

  • Schema vs. enumeration — parametrized templates vs. an explicit finite list. Schemas are compact and general; enumerations are concrete and easier to inspect for a fixed vocabulary.
  • Minimality vs. convenience — a lean, independent base vs. extra "comfort" axioms that shorten proofs. Leanness eases metatheory; convenience eases day-to-day derivation.
  • Gateway strictness — how hard it is to admit an external fact into the working set. Strict gateways prevent contamination but slow modeling; loose ones invite smuggled assumptions.
  • Annotation depth — how much provenance, justification, and independence data each entry carries. Richer annotation aids review at the cost of maintenance.

When it helps, and when it misleads

Its strength is making the granted set explicit, finite, and auditable — you can point at exactly what the system assumes for free, and, via schemas, cover infinitely many cases without an infinite list. The provenance tags stop the most common corruption of a formal system: an assumption masquerading as a truth.

Its failure mode is that the base can be too strong in two ways. It may be inconsistent — a set of schemas that jointly derive a contradiction — in which case every downstream conclusion is worthless; or it may quietly smuggle a contingent fact in as an axiom, so that a merely local truth is granted universal, unquestioned status and every theorem inherits it invisibly.[n1] The classic misuse is adding one convenient axiom to make a proof go through, unaware it has made the whole system inconsistent or import-dependent. The guarding discipline is to keep the base minimal, route every worldly claim through the external-fact gateway, and hand the assembled base to a consistency check rather than trusting it on sight.

How it implements the components

  • axiom_base — it is the register of granted starting statements, presented as schemas so a finite catalog defines an infinite base.
  • external_fact_gateway — it enforces the boundary between axioms and imported worldly facts, admitting the latter only as explicitly tagged assumptions.

It fixes where derivation may begin, not how it proceeds: it does not license moves between statements (inference_rule_set — that is its nearest twin, the Inference Rule Calculus, which supplies rules while this catalog supplies the starting points) and it does not decide which strings are legal (well_formed_expression_grammar — the Formal Grammar Specification).

Editorial Notes

Form Classification

Form family: Representation, Specification & Plan

Rationale: Organizes the system's granted starting statements as parametrized schemas — templates standing for infinitely many concrete axioms — kept strictly apart from imported external facts, making its operative form a non-executable information artifact that externalizes static or prospective structure.

Independent corroboration: The frozen evidence defines Axiom Schema Catalog as 'Organizes the system's granted starting statements as parametrized schemas — templates standing for infinitely many concrete axioms — kept strictly apart from imported external facts', so its operative form is Representation, Specification & Plan.

Review outcome: Independent reviewer agreement; high confidence.

Origin Attribution

Primary origin: Mathematics

Origin pattern: Single lineage

Present-day reach: Specialized

Rationale: Mathematical logic uses axiom schemata as parametrized templates representing infinitely many formal axioms.

Related originating lineages:

  • Philosophy — Philosophy of logic distinguishes internal formal grants from imported factual premises.

Review resolution: Mathematics is the agreed primary lineage through formal logic and axiom schemata. Philosophy materially examines the status of primitives, but cataloging schema instances is established formal-method practice rather than a synthesis.

Review outcome: Reconciled after independent review; high confidence.

Notes

[n1] An axiom schema is a single template with metavariables that denotes the (usually infinite) set of its substitution instances — for example, ZFC's schema of separation is one schema standing for one axiom per formula. Schemas give a finite system infinite granted content, which is powerful and exactly why the base must be checked for consistency.