About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 119. Chapters: Model theory, Programming language semantics, First-order logic, Presburger arithmetic, Godel's completeness theorem, Soundness, Denotational semantics, Original proof of Godel's completeness theorem, Compactness theorem, Embedding, Truth value, Liskov substitution principle, Functional predicate, Godel's incompleteness theorems, List of first-order theories, Kripke semantics, Structure, Interpretation, Boolean-valued model, Lowenheim-Skolem theorem, Skolem's paradox, Type, Undecidable problem, Stable theory, General frame, Game semantics, Skolem normal form, Real closed ring, Normalisation by evaluation, Operational semantics, Ultraproduct, Elementary class, Differentially closed field, True arithmetic, O-minimal theory, Semantics of programming languages, Signature, Morley's categoricity theorem, Elementary equivalence, Definable set, Pseudoelementary class, Exponential field, Spectrum of a theory, Vaught conjecture, Ehrenfeucht-Fraisse game, Semantic theory of truth, Stable group, Substructure, Stability spectrum, Saturated model, Back-and-forth method, Institution, Non-standard model of arithmetic, Quantifier elimination, Ax-Kochen theorem, Ax-Grothendieck theorem, Wilkie's theorem, Morley rank, NIP, Conservative extension, Hrushovski construction, Zariski geometry, Pregeometry, Abstract elementary class, Existentially closed model, Omega-categorical theory, Satisfiability, Prime model, Weakly o-minimal structure, Truth-value semantics, Institutional model theory, Tarski's exponential function problem, Amalgamation property, Strongly minimal theory, Forking extension, Model complete theory, C-minimal theory, Atomic model, J operator, Proof-theoretic semantics, Imaginary element, Reduct, Reduced product, Observational equivalence, Chang's conjecture, Tennenbaum's theorem, Potential isomorphism, Elementary diagra...
