arXiv math/05097072005-09-29math.LO

Abstract decomposition theorem and applications

Rami Grossberg, Olivier Lessmann

备注：: 36 pages
发表信息：: Contemporary Mathematics, Vol 380, (2005), pp. 73--108

英文摘要：

Let K be an Abstract Elementary Class. Under the asusmptions that K has a nicely behaved forking-like notion, regular types and existence of some prime models we establish a decomposition theorem for such classes. The decomposition implies a main gap result for the class K. The setting is general enough to cover \aleph_0-stable first-order theories (proved by Shelah in 1982), Excellent Classes of atomic models of a first order tehory (proved Grossberg and Hart 1987) and the class of submodels of a large sequentially homogenuus \aleph_0-stable model (which is new).

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

From abstract alpha-Ramsey theory to abstract ultra-Ramsey theory

We work within the framework of the Alpha-Theory introduced by Benci and Di Nasso. The Alpha-Theory postulates a few natural properties for an infinite "ideal" number $α$. The formulation provides an elementary axiomatics for the methods of abstract ultra-Ramsey theory. The main results are Theorem 10, Theorem 57, Theorem 67 and Theorem 73. Theorem 10 is an infinite-dimensional extension of the celebrated Ramsey's Theorem. We show that corollaries of this result include the Galvin-Pirky Theorem, the Silver Theorem and the $\vecα$-Ellentuck Theorem. We prove that, under the assumption of the $\…

2016-01-15math.LO

A presentation theorem for continuous logic and Metric Abstract Elementary Classes

We give a presentation theorem for continuous first-order logic and Metric Abstract Elementary classes in terms of $L_{ω_1, ω}$ and Abstract Elementary Classes, respectively. This presentation is accomplished by analyzing dense subsets that are closed under functions. We extend this correspondence to types and saturation.

2016-09-12math.LO

A stability transfer theorem in d-tame Metric Abstract Elementary Classes

In this paper, we study a stability transfer theorem in d-tame Metric Abstract Elementary classes, in a similar way as in [BaKuVa], but using superstability-like assumptions which involves a new independence notion (Tame Independence) instead of $\aleph_0$-locality.

2011-08-01math.LO

Parametrizing the abstract Ellentuck theorem

We give a parametrization with perfect sets of the abstract Ellentuck theorem. The main tool for achieving this goal is a sort of parametrization of an abstract version of the Nash-Williams theorem. As corollaries, we obtain some known classical results like the parametrized version of the Galvin-Prikry theorem due to Miller and Todorcevic, and the parametrized version of Ellentuck's theorem due to Pawlikowski. Also, we obtain parametized vesions of nonclassical results such as Milliken's theorem.

2005-10-21math.LO

Towards a proof of the Shelah Presentation Theorem in Metric Abstract Elementary Classes

In my PhD thesis a version of Shelah's Presentation Theorem in the setting of Metric Abstract Elementary Classes was proved, where we claimed that the new function symbols are not necessarily uniformly continuous. In this paper we provide a proof they are in fact uniformly continuous.

2015-04-21math.LO

Some abstract versions of Gödel's second incompleteness theorem based on non-classical logics

We study abstract versions of Gödel's second incompleteness theorem and formulate generalizations of Löb's derivability conditions that work for logics weaker than the classical one. We isolate the role of contraction rule in Gödel's theorem and give a (toy) example of a system based on modal logic without contraction invalidating Gödel's argument.

2016-02-18math.LO

更多相关论文收起更多论文

An abstract approach to Glivenko's theorem

The aim of this work is to provide a special kind of conservative translation between abstract logics, namely an \textit{abstract Glivenko's theorem}. Firstly we define institutions on the categories of logic, algebraizable logics, and Lindenbaum algebraizable logic. In the sequel, we introduce the notion os Glivenko's context relating two algebraizable logics (respectively, Lindenbaum algebraizable logics) and we prove that for each Glivenko's context can be associated an institutions morphism between the corresponding logical institutions. As a consequence of the existence of such institutio…

2016-12-11math.LO

抽象模型结构与紧致性定理

Abstract Model Structures and Compactness Theorems

National Research University Higher School of Economics（国立高等经济大学）；Indraprastha Institute of Information Technology-Delhi（德里印度普拉斯塔信息理工学院）；Jadavpur University（贾达普尔大学）

本文基于抽象模型结构提出不依赖特定逻辑句法/语义特性的广义紧致性概念，并证明一类紧致抽象模型结构的若干刻画定理，拓展了紧致性定理的适用范围。

2026-08-11math.LO

Abstraction Principles and the Classification of Second-Order Equivalence Relations

This paper improves two existing theorems of interest to neo-logicist philosophers of mathematics. The first is a classification theorem due to Fine for equivalence relations between concepts definable in a well-behaved second-order logic. The improved theorem states that if an equivalence relation $E$ is defined without non-logical vocabulary, then the bicardinal slice of any equivalence class---those equinumerous elements of the equivalence class with equinumerous complements---can have one of only three profiles. The improvements to Fine's theorem allow for an analysis of the well-behaved m…

2018-03-06math.LO

Abstract approach to Ramsey theory and Ramsey theorems for finite trees

I will give a presentation of an abstract approach to finite Ramsey theory found in an earlier paper of mine. I will prove from it a common generalization of Deuber's Ramsey theorem for regular trees and a recent Ramsey theorem of Jasinski for boron tree structures. This generalization appears to be new. I will also show, in exercises, how to deduce from it the Milliken Ramsey theorem for strong subtrees.

2012-10-02math.COmath.LO

Categoricity from one successor cardinal in Tame Abstract Elementary Classes

Let K be an abstract elementary classes which has arbitrarily large models and satisfies the amalgamation and joint embedding properties. Theorem 1. Suppose K is χ-tame. If K is categorical in some λ^+ >LS(K) then it is categorical in all μ\geq (λ+χ)^+. Theorem 2. If K is LS(K)-tame and is categorical both in LS(K) and in LS(K)^+ then K is categorical in all μ\geq LS(K).

2005-09-30math.LO

Horn公式方程的抽象不动点定理

An abstract fixed-point theorem for Horn formula equations

针对计算机科学多应用中重要的Horn公式方程，本文在带最小不动点算子的一阶逻辑中证明了适用于抽象语义的抽象不动点定理，并阐述其在程序验证逻辑基础等计算逻辑领域的推论。

2025-11-11cs.LOmath.LO

Measurable realizations of abstract systems of congruences

An abstract system of congruences describes a way of partitioning a space into finitely many pieces satisfying certain congruence relations. Examples of abstract systems of congruences include paradoxical decompositions and $n$-divisibility of actions. We consider the general question of when there are realizations of abstract systems of congruences satisfying various measurability constraints. We completely characterize which abstract systems of congruences can be realized by nonmeager Baire measurable pieces of the sphere under the action of rotations on the $2$-sphere. This answers a questi…

2020-01-17math.COmath.DSmath.LO

The Kim-Pillay theorem for Abstract Elementary Categories

We introduce the framework of AECats (abstract elementary categories), generalising both the category of models of some first-order theory and the category of subsets of models. Any AEC and any compact abstract theory ("cat", as introduced by Ben-Yaacov) forms an AECat. In particular, we find applications in positive logic and continuous logic: the category of (subsets of) models of a positive or continuous theory is an AECat. The Kim-Pillay theorem for first-order logic characterises simple theories by the properties dividing independence has. We prove a version of the Kim-Pillay theorem for …

2020-10-29math.CTmath.LO

The Rado Path Decomposition Theorem

We discuss a theorem of Rado: Every r-coloring of the pairs of natural numbers has a path decomposition.

2018-12-18math.COmath.LO