2012 Fiscal Year Final Research Report
Omitting types theorem and its application
| Project/Area Number |
22540110
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | University of Tsukuba |
|---|
Principal Investigator |
TSUBOI Akito 筑波大学, 数理物質系, 教授 (30180045)
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Keywords | モデル理論 / 安定性理論 |
|---|
| Research Abstract |
We introduced several new notions concerning indiscernibility of trees. A tree is by definition an ordered set (O,<) such that, for any $a ￥in O$, the initial segment $￥{b ￥in O: b<a￥}$ determined by a is a linearly ordered set.A typical example of tree is the set $￥omega^{<￥omega}$ of finite $￥omega$-sequences with the order relation $<_{￥rm ini}$, where $￥eta <_{￥rm ini} ￥nu$ means that $￥eta$ is a proper initial segment of $￥nu$.In this study, we worked in some structure $M$ in the language $L$. A subset $A$ of the form $(a_￥eta)_{￥eta ￥in O}$, where $O$ is a tree, and $a_￥eta$ is an element in $M$ labeled by $￥eta$, is also called a tree. We studied the indiscernibility of such trees $A$ in general settings and then applied the obtained results to the study of unstable theories. Among others, we proved that if $￥Gamma$ (a set of conditions described by formulas) has the strong subtree property then $￥Gamma$ is realized by a strongly indiscernible tree.
|
Research Products
(18 results)
-
-
-
-
-
-
-
-
[Presentation] On Indiscernible Trees2012
Author(s)
Akito Tsuboi
Organizer
American Mathematical Society, 2012 Spring Western Section Meeting
Place of Presentation
University of Hawaii at Manoa, USA
Year and Date
2012-03-04
-
-
-
-
-
-
-
-
-
-
