A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Model Instantiation and Structure Realization

Graduate Depth 84 in the knowledge graph ☐ I know this ☆ Set as goal
71topics build on this
430prerequisites beneath it
See this on the map →
Model Interpretation and SatisfactionSet Theory Fundamentals+2 more→→Complete Theory and Consequence RelationsDiagram and Expansion by Constants+1 more
instantiation realization semantic-interpretation universe

Core Idea

A structure M (or model) in a signature σ assigns to each symbol in σ a concrete mathematical object: constants become elements, function symbols become operations, and relation symbols become sets of tuples. The universe (domain) of M is the non-empty set over which these interpretations are defined.

How It's Best Learned

Work through explicit examples: the group (Z, +) as a model of the group signature, or (R, 0, 1, +, ·, <) as a model of the ordered field signature. Verify satisfaction of key axioms.

Common Misconceptions

A structure is not an abstract syntax tree—it is a concrete assignment. Distinct structures can satisfy the same theory but differ in their interpretations of function/relation symbols.

Explainer

You have already studied signatures and satisfaction at an abstract level. Model instantiation is the process of making this abstract machinery concrete: given a signature σ (a list of constant, function, and relation symbols), you choose an actual mathematical object — a set, a group, a graph, the integers — and specify what each symbol in σ means within that object. The result is a σ-structure M, also called a realization of σ.

Let's trace through a specific example. The group signature σ_G contains one binary function symbol · (multiplication) and one constant symbol e (identity). To instantiate σ_G as the integers under addition, you set: the domain (universe) of M to be ℤ, the interpretation of · to be ordinary integer addition +, and the interpretation of e to be the integer 0. Now M = (ℤ, +, 0) is a σ_G-structure. Separately, M' = (ℝ*, ×, 1) — the nonzero reals under multiplication — is *also* a σ_G-structure. Both M and M' are instantiations of the same signature, and both satisfy the group axioms, but they are structurally very different: ℤ under + has no element of order 2 except... actually it does: (-1) has order 2 in (ℤ,+) since -1 + -1 = -2 ≠ 0. Point being: same signature, same theory satisfied, but the two structures have different internal properties.

The universe of a structure is the set over which all variables range and all functions operate — it must be non-empty by definition. This is why structures are sometimes called *interpretations*: every symbol in the signature gets interpreted as something specific in the universe. A relation symbol R of arity k gets interpreted as a subset RM ⊆ Mk (the set of k-tuples satisfying R). A function symbol f of arity k gets interpreted as a total function fM : Mk → M. A constant symbol c gets interpreted as a specific element cM ∈ M. This three-way assignment is the complete definition of a structure.

Why does this matter? Because satisfaction is defined over structures, not over abstract symbols. When you ask "does the group axiom ∀x∀y (x·y = y·x) hold?", the answer depends entirely on which structure you're looking at. For (ℤ, +, 0) the answer is yes (integers commute). For (GL₂(ℝ), ×, I) — 2×2 invertible matrices — the answer is no (matrix multiplication does not commute). The same sentence, opposite truth values, in two different structures over the same signature. Instantiation is what transforms syntactic symbols into mathematical entities that can be true or false of, and this is the bridge between logic and mathematics.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Model Instantiation and Structure Realization

Longest path: 85 steps · 430 total prerequisite topics

Prerequisites (4)

Leads To (3)