Saturated models in institutions
type: Item
instance of: scholarly article
title: Saturated models in institutions
zbMATH Open document ID: 1208.03040
author: Răzvan Diaconescu
author: Marius Petria
published in: Archive for Mathematical Logic
publication date: 2010-09-08T00:00:00Z
review text: In this paper the authors define the concept of saturated model at an abstract institution-independent level and develop the fundamental existence and uniqueness theorems. As an application they prove a general institution-independent version of the Keisler-Shelah isomorphism theorem, ``any two elementarily equivalent models have isomorphic ultrapowers'' (assuming the Generalized Continuum Hypothesis).
Mathematics Subject Classification ID: 03C50
Mathematics Subject Classification ID: 03C95
Mathematics Subject Classification ID: 18C50
zbMATH DE Number: 5781209
zbMATH Keywords: saturated models
zbMATH Keywords: institutions
zbMATH Keywords: institution-independent model theory
reviewed by: Dimitru Buşneag
describes a project that uses: CASL
describes a project that uses: CafeOBJ
MaRDI profile type: Publication
full work available at URL: s00153-010-0193-8
OpenAlex ID: W2141883919
cites work: CASL: the Common Algebraic Specification Language.
cites work: Q4738215
cites work: Q2722041
cites work: An institution of modal logics for coalgebras
cites work: Birkhoff completeness in institutions
cites work: Q4432964
cites work: Elementary Diagrams in Institutions
cites work: An institution-independent proof of Craig interpolation theorem
cites work: Jewels of Institution-Independent Model Theory
cites work: Proof Systems for Institutional Logic
cites work: A categorical study on the finiteness of specifications
cites work: Institution-independent model theory
cites work: CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
cites work: Mirror, mirror in my hand: a duality between specifications and models of process behaviour
cites work: Institutions: abstract model theory for specification and programming
cites work: Q4942101
cites work: Q4200260
cites work: Completeness by Forcing
cites work: An Institution-independent Generalization of Tarski's Elementary Chain Theorem
cites work: An institution-independent proof of the Robinson consistency theorem
cites work: Q4258066
cites work: Q3727946
cites work: Q4215784
cites work: Regular and Strongly Finitary Structures Over Strongly Algebroidal Categories
cites work: Conditional rewriting logic as a unified model of concurrency
cites work: Homogeneous Universal Models.
cites work: Relating CASL with other specification languages: the institution level.
cites work: Distributive-lattice semantics of sequent calculi with structural rules
cites work: Q5311059
cites work: Abstract Beth definability in institutions
cites work: Specifications in an arbitrary institution
cites work: Recent Trends in Algebraic Development Techniques
cites work: Every two elementarily equivalent models have isomorphic ultrapowers
cites work: Q3776610
cites work: On the existence of free models in abstract algebraic institutions
cites work: Quasi-varieties in abstract algebraic institutions
cites work: Towards heterogeneous specifications
DOI: 10.1007/S00153-010-0193-8
description: scientific article; zbMATH DE number 5781209