Editing Model Theory

<div style="background-color: #4B0082; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
{{BloomIntro}}
Model Theory is the study of the relationship between formal languages and their interpretations (models). While '''Proof Theory''' focuses on the ''rules'' of the language, Model Theory focuses on what the language is ''talking about''. It is the study of "Mathematical Reality." A "Model" is a specific mathematical structure (like the set of all integers) that makes a set of logical statements true. By studying these models, we can understand the limits of what a language can describe and discover deep connections between different areas of math like algebra and geometry.
</div>

__TOC__

<div style="background-color: #000080; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Remembering</span> ==
* '''Model Theory''' — The study of the classes of mathematical structures from the perspective of mathematical logic.
* '''Language ($L$)''' — A set of symbols (constants, functions, relations) used to build statements.
* '''Structure ($\mathcal{M}$)''' — A "World" consisting of a set of objects and definitions for the symbols in the language.
* '''Model''' — A structure that makes all the axioms of a theory true ($\mathcal{M} \models T$).
* '''Satisfaction ($\models$)''' — The relationship between a structure and a statement (e.g., "The integers satisfy the statement 1+1=2").
* '''Isomorphism''' — A mapping between two models showing they are identical in structure even if their labels are different.
* '''Elementary Equivalence''' — Two models are equivalent if they satisfy all the same statements in a given language.
* '''Löwenheim–Skolem Theorem''' — A theorem showing that if a theory has an infinite model, it must have models of every possible infinite size.
* '''Categoricity''' — A property where a theory has only one possible model (up to isomorphism).
* '''Stability Theory''' — A branch of model theory that classifies models based on how many "types" of elements they contain.
* '''Quantifier Elimination''' — A method to simplify statements by removing "For all" or "There exists" symbols.
* '''Ultraproduct''' — A way to combine an infinite number of models into one "Super-model."
* '''Non-Standard Model''' — A model that satisfies a theory but looks very different from the "usual" one (e.g., a model of arithmetic with "infinite" numbers).
</div>

<div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Understanding</span> ==
Model Theory is about the '''Flexibility of Language'''.

'''1. Language vs. World''':
Imagine the statement: "Everyone has a father."
* In the '''Model''' of "Family Tree," this statement might be true.
* In the '''Model''' of "Single-celled Organisms," this statement is false.
Model theory studies which "Worlds" (Models) make which "Sentences" true.

'''2. The Power of Löwenheim–Skolem''':
This is a shocking finding. It says that no matter how hard you try to describe the "Whole Numbers" (1, 2, 3...), you can never write enough rules to prevent "Giant" models from existing. There are "Models" of arithmetic that contain "Numbers" larger than every whole number, yet they still follow all the rules of math perfectly. These are called '''Non-Standard Models'''.

'''3. Categoricity''':
A "Categorical" theory is a perfect description. It only allows for one type of world.
* Basic arithmetic is '''Not Categorical''' (as shown above).
* Some advanced theories (like "Dense Linear Orders") are '''$\aleph_0$-categorical''', meaning they have only one countable model.

'''Non-Standard Analysis''': By creating a model of math that includes "Infinite" and "Infinitesimal" (infinitely small) numbers, mathematicians can solve calculus problems much more simply than with standard limits. This shows that "The Truth" depends on which model you choose to live in.
</div>

<div style="background-color: #8B0000; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Applying</span> ==
'''Modeling 'Satisfiability' (The Truth Checker):'''
<syntaxhighlight lang="python">
def is_model_valid(domain, relation_func, statement):
    """
    Checks if a 'World' satisfies a 'Sentence'.
    Sentence: 'For all x, x is even'
    """
    for x in domain:
        if not relation_func(x):
            print(f"Counter-example found: {x}")
            return False
    return True

# World: The set {2, 4, 6}
# Relation: Is even?
print(f"Does the world satisfy 'All Even'? {is_model_valid([2,4,6], lambda x: x%2==0, 'All Even')}")
# Model theory is the basis for 'Formal Verification' 
# in chip design and software.
</syntaxhighlight>

; Model Theory Milestones
: '''The Compactness Theorem''' → If every finite subset of a theory has a model, then the whole theory has a model. (The "Bridge" to infinity).
: '''Robinson's Non-Standard Analysis''' → Using model theory to bring back "Infinitesimals" and prove they are logically sound.
: '''Ax-Kochen Theorem''' → A famous proof in algebra that was solved using model theory, showing that logic can solve "Pure" math problems.
: '''O-Minimality''' → A modern branch of model theory used to study geometry and tame "chaotic" functions.
</div>

<div style="background-color: #8B4500; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Analyzing</span> ==
{| class="wikitable"
|+ Proof Theory vs. Model Theory
! Feature !! Proof Theory (Syntax) !! Model Theory (Semantics)
|-
| Focus || The rules of the language || The objects being talked about
|-
| Tool || Proof Trees / Inference Rules || Sets / Mappings / Ultraproducts
|-
| Goal || To show what is 'Provable' || To show what is 'Possible'
|-
| Analogy || The Grammar of a sentence || The Meaning of a sentence
|}

'''The Concept of "Definability"''': A set is "Definable" in a model if you can write a formula that describes exactly that set and nothing else. Model theorists analyze which sets are "Invisible" to certain languages. For example, in the language of addition, you can define "Even numbers," but in some languages, you can't. Analyzing "What can be said" is a core task of model theory.
</div>

<div style="background-color: #483D8B; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Evaluating</span> ==
Evaluating a mathematical model:
# '''Completeness''': Does the model satisfy every statement that can be proven from the axioms?
# '''Categoricity''': Is the model unique, or are there "weird" alternative worlds that satisfy the same rules?
# '''Complexity''': How much "Information" is needed to describe the model?
# '''Algebraic Closure''': Is the model "Complete" in the sense that all its equations have solutions inside the model?
</div>

<div style="background-color: #2F4F4F; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Creating</span> ==
Future Frontiers:
# '''Finite Model Theory''': The study of models with a limited number of objects, used to understand the complexity of computer databases (SQL).
# '''Model-Theoretic AI''': Building AI that can "Internalize" a model of the world and check its own reasoning for consistency.
# '''Topos Theory''': A "Higher-level" model theory that uses Category Theory to study the "Shapes" of logic.
# '''The Quest for Categoricity''': Trying to find new axioms that finally give us a "Unique" description of the numbers we use every day.

[[Category:Mathematics]]
[[Category:Logic]]
[[Category:Philosophy]]
</div>