東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Complexity Classifications in Model ...

Makuluni, Tamvana P.

FindBook

Google Book

Amazon

博客來

Complexity Classifications in Model Theory and Computable Structures.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Complexity Classifications in Model Theory and Computable Structures./
作者:	Makuluni, Tamvana P.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:	66 p.
附註:	Source: Dissertation Abstracts International, Volume: 79-09(E), Section: A.
Contained By:	Dissertation Abstracts International79-09A(E).
標題:	Logic. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10822060
ISBN:	9780355947755

Complexity Classifications in Model Theory and Computable Structures.
Makuluni, Tamvana P.

Complexity Classifications in Model Theory and Computable Structures. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 66 p.

Source: Dissertation Abstracts International, Volume: 79-09(E), Section: A.

Thesis (Ph.D.)--The University of Wisconsin - Madison, 2018.

We explore various questions of complexity in model theory and computable structures. Part I focuses on computable complexity. In Chapter 2, we show that the theory of the collection of isomorphism classes of at-most countable groups pre-ordered by embedability is 1-reducible to the true theory of second-order arithmetic. In Chapter 3, we show that uncountable categoricity is a 0'-d.c.e. property, work previously published with Uri Andrews. Part II focuses on one specific dividing line in model theory called convex orderability. We show that convexly orderable linear orders can be divided into dense and discrete orders. We show that definable sets in a convexly orderable discrete orders are piecewise periodic, and that convexly orderable dense orders have the nowhere dense graph property.

ISBN: 9780355947755Subjects--Topical Terms:

529544
Logic.

Complexity Classifications in Model Theory and Computable Structures.
LDR:01747nmm a2200301 4500 001 2202725
005 20190513114839.5
008 201008s2018 ||||||||||||||||| ||eng d
020 $a 9780355947755
035 $a (MiAaPQ)AAI10822060
035 $a (MiAaPQ)wisc:15310
035 $a AAI10822060
040 $a MiAaPQ $c MiAaPQ
100 1 $a Makuluni, Tamvana P. $3 3429495
245 1 0 $a Complexity Classifications in Model Theory and Computable Structures.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 66 p.
500 $a Source: Dissertation Abstracts International, Volume: 79-09(E), Section: A.
500 $a Adviser: Uri Andrews.
502 $a Thesis (Ph.D.)--The University of Wisconsin - Madison, 2018.
520 $a We explore various questions of complexity in model theory and computable structures. Part I focuses on computable complexity. In Chapter 2, we show that the theory of the collection of isomorphism classes of at-most countable groups pre-ordered by embedability is 1-reducible to the true theory of second-order arithmetic. In Chapter 3, we show that uncountable categoricity is a 0'-d.c.e. property, work previously published with Uri Andrews. Part II focuses on one specific dividing line in model theory called convex orderability. We show that convexly orderable linear orders can be divided into dense and discrete orders. We show that definable sets in a convexly orderable discrete orders are piecewise periodic, and that convexly orderable dense orders have the nowhere dense graph property.
590 $a School code: 0262.
650 4 $a Logic. $3 529544
650 4 $a Mathematics. $3 515831
690 $a 0395
690 $a 0405
710 2 $a The University of Wisconsin - Madison. $b Mathematics. $3 2101076
773 0 $t Dissertation Abstracts International $g 79-09A(E).
790 $a 0262
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10822060