東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Infinitary Limits of Finite Structures.

Kruckman, Alex.

FindBook

Google Book

Amazon

博客來

Infinitary Limits of Finite Structures.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Infinitary Limits of Finite Structures./
作者:	Kruckman, Alex.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2016,
面頁冊數:	157 p.
附註:	Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
Contained By:	Dissertation Abstracts International78-10B(E).
標題:	Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10189549
ISBN:	9781369841305

Infinitary Limits of Finite Structures.
Kruckman, Alex.

Infinitary Limits of Finite Structures. - Ann Arbor : ProQuest Dissertations & Theses, 2016 - 157 p.

Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.

Thesis (Ph.D.)--University of California, Berkeley, 2016.

We study three distinct ways of assigning infinitary limits to classes of finite structures. We are primarily concerned with logically motivated questions about these limit objects and their theories, as well as connections and analogies between them.

ISBN: 9781369841305Subjects--Topical Terms:

515831
Mathematics.

Infinitary Limits of Finite Structures.
LDR:03379nmm a2200325 4500 001 2122520
005 20170922124923.5
008 180830s2016 ||||||||||||||||| ||eng d
020 $a 9781369841305
035 $a (MiAaPQ)AAI10189549
035 $a AAI10189549
040 $a MiAaPQ $c MiAaPQ
100 1 $a Kruckman, Alex. $3 3284492
245 1 0 $a Infinitary Limits of Finite Structures.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2016
300 $a 157 p.
500 $a Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
500 $a Adviser: Thomas Scanlon.
502 $a Thesis (Ph.D.)--University of California, Berkeley, 2016.
520 $a We study three distinct ways of assigning infinitary limits to classes of finite structures. We are primarily concerned with logically motivated questions about these limit objects and their theories, as well as connections and analogies between them.
520 $a In the first part, we consider limits of sequences of finite structures which converge with respect to densities of quantifier-free formulas, generalizing the dense graph limits and similar structural limits studied in combinatorics. A convergent sequence determines, as a limit object, a certain kind of probability measure on the space of countable structures with domain o, which we call an ergodic structure. After developing the background theory, we take up the case of properly ergodic structures, which do not assign full measure to any single isomorphism class. The main result is a purely logical characterization of those theories in countable fragments of Lo1,o which arise as the theories of properly ergodic structures.
520 $a In the second part, we study categories consisting of finite structures and certain "strong" embeddings between them. We identify a necessary and sufficient condition for the well-definedness of strong embeddings between infinite direct limits from the category. This allows us to develop the natural generalization of classical Fraisse theory in this context, with a focus on topology and genericity, in the sense of Baire category, in the space of direct limits with domain o. We elaborate on an analogy between these generic limits and the measure limits in the first part, and we examine model-theoretic properties of generic limits.
520 $a In the third part, we take up logical limits, in the sense of ultraproducts and zero-one laws. In contrast to the first two parts, the limit theories here are always pseudofinite. We focus on countably categorical theories, which are essentially generic theories of small Fraisse classes, and we show that higher amalgamation properties (disjoint n-amalgamation for all n) are sufficient to prove pseudofiniteness by a probabilistic argument. We examine relationships between pseudofiniteness, higher amalgamation, and model theoretic dividing lines, especially simplicity and NSOP1. Our hope is that in "purely combinatorial" situations, pseudofiniteness should always be explained by randomness, via higher amalgamation; in an attempt to isolate these situations, we define the class of primitive combinatorial theories.
590 $a School code: 0028.
650 4 $a Mathematics. $3 515831
650 4 $a Logic. $3 529544
690 $a 0405
690 $a 0395
710 2 $a University of California, Berkeley. $b Mathematics. $3 1685396
773 0 $t Dissertation Abstracts International $g 78-10B(E).
790 $a 0028
791 $a Ph.D.
792 $a 2016
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10189549