Saturated models in institutions

Archive for Mathematical Logic 49 (6):693-723 (2010)
  Copy   BIBTEX

Abstract

Saturated models constitute one of the powerful methods of conventional model theory, with many applications. Here we develop a categorical abstract model theoretic approach to saturated models within the theory of institutions. The most important consequence is that the method of saturated models becomes thus available to a multitude of logical systems from logic or from computing science. In this paper we define the concept of saturated model at an abstract institution-independent level and develop the fundamental existence and uniqueness theorems. As an application we prove a general institution-independent version of the Keisler–Shelah isomorphism theorem “any two elementarily equivalent models have isomorphic ultrapowers” (assuming Generalized Continuum Hypothesis)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
Remarks on Structure Theorems for -Saturated Models.Tapani Hyttinen - 1995 - Notre Dame Journal of Formal Logic 36 (2):269-278.
Abstract Beth Definability in Institutions.Marius Petria & Răzvan Diaconescu - 2006 - Journal of Symbolic Logic 71 (3):1002 - 1028.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
A Silver-like Perfect Set Theorem with an Application to Borel Model Theory.Joël Combase - 2011 - Notre Dame Journal of Formal Logic 52 (4):415-429.
Elementary Cuts in Saturated Models of Peano Arithmetic.James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (1):1-13.
Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
Resplendent models and $${\Sigma_1^1}$$ -definability with an oracle.Andrey Bovykin - 2008 - Archive for Mathematical Logic 47 (6):607-623.

Analytics

Added to PP
2013-11-23

Downloads
81 (#203,004)

6 months
6 (#512,819)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Birkhoff Completeness in Institutions.Mihai Codescu & Daniel Găină - 2008 - Logica Universalis 2 (2):277-309.

Add more citations

References found in this work

[Omnibus Review].H. Jerome Keisler - 1970 - Journal of Symbolic Logic 35 (2):342-344.
Model Theory.Gebhard Fuhrken - 1976 - Journal of Symbolic Logic 41 (3):697-699.
Universal Algebra.George Grätzer - 1982 - Studia Logica 41 (4):430-431.

View all 10 references / Add more references