language-icon Old Web
English
Sign In

Axiom schema

In mathematical logic, an axiom schema (plural: axiom schemata or axiom schemas) generalizes the notion of axiom. In mathematical logic, an axiom schema (plural: axiom schemata or axiom schemas) generalizes the notion of axiom. An axiom schema is a formula in the metalanguage of an axiomatic system, in which one or more schematic variables appear. These variables, which are metalinguistic constructs, stand for any term or subformula of the system, which may or may not be required to satisfy certain conditions. Often, such conditions require that certain variables be free, or that certain variables not appear in the subformula or term. Given that the number of possible subformulas or terms that can be inserted in place of a schematic variable is countably infinite, an axiom schema stands for a countably infinite set of axioms. This set can usually be defined recursively. A theory that can be axiomatized without schemata is said to be finitely axiomatized. Theories that can be finitely axiomatized are seen as a bit more metamathematically elegant, even if they are less practical for deductive work.

[ "Axiom of choice", "Axiom of projective determinacy", "Kripke–Platek set theory", "Action axiom", "S", "Axiom of regularity" ]
Parent Topic
Child Topic
    No Parent Topic