Misplaced Pages

This page is about the concept in mathematical logic. For the concepts in sociology, see Institutional theory and Institutional logic.

This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (February 2022) (Learn how and when to remove this message)

In mathematical logic, institutional model theory generalizes a large portion of first-order model theory to an arbitrary logical system.

Overview

The notion of "logical system" here is formalized as an institution. Institutions constitute a model-oriented meta-theory on logical systems similar to how the theory of rings and modules constitute a meta-theory for classical linear algebra. Another analogy can be made with universal algebra versus groups, rings, modules etc. By abstracting away from the realities of the actual conventional logics, it can be noticed that institution theory comes in fact closer to the realities of non-conventional logics.

Institutional model theory analyzes and generalizes classical model-theoretic notions and results, like

• elementary diagrams
• elementary embeddings
• ultraproducts, Los' theorem
• saturated models
• axiomatizability
• varieties, Birkhoff axiomatizability
• Craig interpolation
• Robinson consistency
• Beth definability
• Gödel's completeness theorem

For each concept and theorem, the infrastructure and properties required are analyzed and formulated as conditions on institutions, thus providing a detailed insight to which properties of first-order logic they rely on and how much they can be generalized to other logics.

References

• Răzvan Diaconescu: Institution-Independent Model Theory. Birkhäuser, 2008. ISBN 978-3-7643-8707-5.
• Răzvan Diaconescu: Jewels of Institution-Independent Model Theory. In: K. Futatsugi, J.-P. Jouannaud, J. Meseguer (eds.): Algebra, Meaning and Computation. Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday. Lecture Notes in Computer Science 4060, p. 65-98, Springer-Verlag, 2006.
• Marius Petria and Rãzvan Diaconescu: Abstract Beth definability in institutions. Journal of Symbolic Logic 71(3), p. 1002-1028, 2006.
• Daniel Gǎinǎ and Andrei Popescu: An institution-independent generalisation of Tarski's elementary chain theorem, Journal of Logic and Computation 16(6), p. 713-735, 2006.
• Till Mossakowski, Joseph Goguen, Rãzvan Diaconescu, Andrzej Tarlecki: What is a Logic?. In Jean-Yves Beziau, editor, Logica Universalis, pages 113-133. Birkhauser, 2005.
• Andrzej Tarlecki: Quasi-varieties in abstract algebraic institutions. Journal of Computer and System Sciences 33(3), p. 333-360, 1986.

External links

• Răzvan Diaconescu's publication list - contains recent work on institutional model theory

v t e Mathematical logic
General	Axiom list Cardinality First-order logic Formal proof Formal semantics Foundations of mathematics Information theory Lemma Logical consequence Model Theorem Theory Type theory
Theorems (list)  and paradoxes	Gödel's completeness and incompleteness theorems Tarski's undefinability Banach–Tarski paradox Cantor's theorem, paradox and diagonal argument Compactness Halting problem Lindström's Löwenheim–Skolem Russell's paradox
Logics	Traditional Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram Propositional Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞ Predicate First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus
Set theory	Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities Types of sets Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps and cardinality Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary Set theories Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive
Formal systems (list), language and syntax	Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list Example axiomatic systems (list) of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica
Proof theory	Formal proof Natural deduction Logical consequence Rule of inference Sequent calculus Theorem Systems axiomatic deductive Hilbert list Complete theory Independence (from ZFC) Proof of impossibility Ordinal analysis Reverse mathematics Self-verifying theories
Model theory	Interpretation function of models Model equivalence finite saturated spectrum submodel Non-standard model of arithmetic Diagram elementary Categorical theory Model complete theory Satisfiability Semantics of logic Strength Theories of truth semantic Tarski's Kripke's T-schema Transfer principle Truth predicate Truth value Type Ultraproduct Validity
Computability theory	Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision problem decidable undecidable P NP P versus NP problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory
Related	Abstract logic Algebraic logic Automated theorem proving Category theory Concrete/Abstract category Category of sets History of logic History of mathematical logic timeline Logicism Mathematical object Philosophy of mathematics Supertask
Mathematics portal

• Mathematical logic
• Model theory
• Theoretical computer science