Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Saturation and solvability in abstract elementary classes with amalgamation

Saturation and solvability in abstract elementary classes with amalgamation Theorem 0.1 Let $$\mathbf {K}$$ K be an abstract elementary class (AEC) with amalgamation and no maximal models. Let $$\lambda > {LS}(\mathbf {K})$$ λ > LS ( K ) . If $$\mathbf {K}$$ K is categorical in $$\lambda $$ λ , then the model of cardinality $$\lambda $$ λ is Galois-saturated. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Archive for Mathematical Logic Springer Journals

Saturation and solvability in abstract elementary classes with amalgamation

Archive for Mathematical Logic , Volume 56 (6) – May 27, 2017

Loading next page...
 
/lp/springer-journals/saturation-and-solvability-in-abstract-elementary-classes-with-PT0weThfAN

References (37)

Publisher
Springer Journals
Copyright
Copyright © 2017 by Springer-Verlag Berlin Heidelberg
Subject
Mathematics; Mathematical Logic and Foundations; Mathematics, general; Algebra
ISSN
0933-5846
eISSN
1432-0665
DOI
10.1007/s00153-017-0561-8
Publisher site
See Article on Publisher Site

Abstract

Theorem 0.1 Let $$\mathbf {K}$$ K be an abstract elementary class (AEC) with amalgamation and no maximal models. Let $$\lambda > {LS}(\mathbf {K})$$ λ > LS ( K ) . If $$\mathbf {K}$$ K is categorical in $$\lambda $$ λ , then the model of cardinality $$\lambda $$ λ is Galois-saturated.

Journal

Archive for Mathematical LogicSpringer Journals

Published: May 27, 2017

There are no references for this article.