# Category:Model theory

Computing portal |

Here is a list of articles in the Model theory category of the Computing portal that unifies foundations of mathematics and computations using computers.

In mathematics, **model theory** is the study of (classes of) mathematical structures such as groups, fields, graphs or even models of set theory using tools from mathematical logic. Model theory has close ties to algebra and universal algebra.

## Subcategories

This category has the following 5 subcategories, out of 5 total.

## Pages in category "Model theory"

The following 114 pages are in this category, out of 114 total.

- Finite model theory
*(computing)* - Model theory
*(computing)*

### A

- Abstract elementary class
*(computing)* - Tame abstract elementary class
*(computing)* - Age (model theory)
*(computing)* - Amalgamation property
*(computing)* - Atomic model (mathematical logic)
*(physics)* - Ax–Grothendieck theorem
*(computing)* - Ax–Kochen theorem
*(computing)*

### B

- Back-and-forth method
*(computing)* - Boolean-valued model
*(computing)* - Büchi arithmetic
*(computing)*

### C

- C-minimal theory
*(computing)* - Categorical theory
*(computing)* - Compactness theorem
*(computing)* - Complete theory
*(computing)* - Completeness (logic)
*(philosophy)* - Computable model theory
*(computing)* - Conservative extension
*(computing)*

### D

- Decidable sublanguages of set theory
*(computing)* - Definable set
*(computing)* - Diagram (mathematical logic)
*(computing)* - Differentially closed field
*(computing)*

### E

- Ehrenfeucht–Fraïssé game
*(computing)* - Ehrenfeucht–Mostowski theorem
*(computing)* - Elementary class
*(computing)* - Elementary diagram
*(computing)* - Elementary equivalence
*(computing)* - Embedding
*(computing)* - Equisatisfiability
*(computing)* - Existentially closed model
*(computing)* - Exponential field
*(computing)* - Exponentially closed field
*(computing)*

### F

- First-order logic
*(computing)* - List of first-order theories
*(computing)* - Forking extension
*(computing)* - Fraïssé's theorem
*(computing)* - Fraïssé limit
*(computing)* - Functional predicate
*(computing)*

### G

- General frame
*(computing)* - Original proof of Gödel's completeness theorem
*(computing)* - Gödel's completeness theorem
*(computing)* - Gödel's incompleteness theorems
*(computing)*

### H

- Hardy field
*(computing)* - Hereditary property
*(computing)* - Hrushovski construction
*(computing)*

### I

- Imaginary element
*(computing)* - Indiscernibles
*(computing)* - Institution (computer science)
*(computing)* - Institutional model theory
*(computing)* - International trade theory
*(computing)* - Interpretation (logic)
*(philosophy)* - Interpretation (model theory)
*(computing)*

### J

- Joint embedding property
*(computing)*

### K

- Kripke semantics
*(computing)*

### L

- Łoś–Tarski preservation theorem
*(computing)* - Łoś–Vaught test
*(computing)* - Löwenheim number
*(computing)* - Löwenheim–Skolem theorem
*(computing)*

### M

- Model complete theory
*(computing)* - Chang's conjecture
*(computing)* - Morley rank
*(computing)* - Morley's categoricity theorem
*(computing)*

### N

- NIP (model theory)
*(computing)* - Non-standard model
*(computing)* - Non-standard model of arithmetic
*(computing)*

### O

- O-minimal theory
*(computing)* - Omega-categorical theory
*(computing)* - Ordered exponential field
*(computing)*

### P

- Potential isomorphism
*(computing)* - Pregeometry (model theory)
*(computing)* - Presburger arithmetic
*(computing)* - Prime model
*(computing)* - Profit model
*(computing)* - Pseudo-finite field
*(computing)* - Pseudoelementary class
*(computing)* - Purnell Model for Cultural Competence
*(computing)*

### Q

- Quantifier elimination
*(computing)* - Quantifier rank
*(computing)*

### R

- Real closed ring
*(computing)* - Reduced product
*(computing)* - Reduct
*(computing)*

### S

- Satisfiability
*(computing)* - Saturated model
*(computing)* - Signature (logic)
*(philosophy)* - Skolem normal form
*(computing)* - Skolem's paradox
*(computing)* - Soundness
*(computing)* - Spectrum of a sentence
*(computing)* - Spectrum of a theory
*(computing)* - Stability spectrum
*(computing)* - Stable group
*(computing)* - Stable model semantics
*(computing)* - Stable theory
*(computing)* - Strength (mathematical logic)
*(computing)* - Strongly minimal theory
*(computing)* - Structural Ramsey theory
*(computing)* - Structure (mathematical logic)
*(computing)* - Substructure (mathematics)
*(computing)*

### T

- Tame group
*(computing)* - Tarski's exponential function problem
*(computing)* - Tennenbaum's theorem
*(computing)* - Transitive model
*(computing)* - True arithmetic
*(computing)* - Two-variable logic
*(computing)* - Type (model theory)
*(computing)*

### U

- U-rank
*(computing)* - Ultraproduct
*(computing)*

### V

- Valuation (logic)
*(philosophy)* - Vaught conjecture
*(computing)*

### W

- Weakly o-minimal structure
*(computing)* - Wilkie's theorem
*(computing)*

### Z

- Zariski geometry
*(computing)* - Ziegler spectrum
*(computing)*