東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

A model-theoretic approach to proof ...

Kotlarski, Henryk.

Linked to FindBook

Google Book

Amazon

博客來

A model-theoretic approach to proof theory

Record Type:	Electronic resources : Monograph/item
Title/Author:	A model-theoretic approach to proof theory/ by Henryk Kotlarski ; edited by Zofia Adamowicz, Teresa Bigorajska, Konrad Zdanowski.
Author:	Kotlarski, Henryk.
other author:	Adamowicz, Zofia.
Published:	Cham :Springer International Publishing : : 2019.,
Description:	xviii, 109 p. :ill., digital ;24 cm.
[NT 15003449]:	Chapter 1. Some combinatorics -- Chapter 2. Some model theory -- Chapter 3. Incompleteness -- Chapter 4. Transﬁnite induction -- Chapter 5. Satisfaction classes.
Contained By:	Springer eBooks
Subject:	Proof theory. -
Online resource:	https://doi.org/10.1007/978-3-030-28921-8
ISBN:	9783030289218

A model-theoretic approach to proof theory
Kotlarski, Henryk.

A model-theoretic approach to proof theory[electronic resource] /by Henryk Kotlarski ; edited by Zofia Adamowicz, Teresa Bigorajska, Konrad Zdanowski. - Cham :Springer International Publishing :2019. - xviii, 109 p. :ill., digital ;24 cm. - Trends in logic, studia logica library,v.511572-6126 ;. - Trends in logic, studia logica library ;v.51..

Chapter 1. Some combinatorics -- Chapter 2. Some model theory -- Chapter 3. Incompleteness -- Chapter 4. Transﬁnite induction -- Chapter 5. Satisfaction classes.

This book presents a detailed treatment of ordinal combinatorics of large sets tailored for independence results. It uses model theoretic and combinatorial methods to obtain results in proof theory, such as incompleteness theorems or a description of the provably total functions of a theory. In the first chapter, the authors first discusses ordinal combinatorics of finite sets in the style of Ketonen and Solovay. This provides a background for an analysis of subsystems of Peano Arithmetic as well as for combinatorial independence results. Next, the volume examines a variety of proofs of Godel's incompleteness theorems. The presented proofs differ strongly in nature. They show various aspects of incompleteness phenomena. In additon, coverage introduces some classical methods like the arithmetized completeness theorem, satisfaction predicates or partial satisfaction classes. It also applies them in many contexts. The fourth chapter defines the method of indicators for obtaining independence results. It shows what amount of transfinite induction we have in fragments of Peano arithmetic. Then, it uses combinatorics of large sets of the first chapter to show independence results. The last chapter considers nonstandard satisfaction classes. It presents some of the classical theorems related to them. In particular, it covers the results by S. Smith on definability in the language with a satisfaction class and on models without a satisfaction class. Overall, the book's content lies on the border between combinatorics, proof theory, and model theory of arithmetic. It offers readers a distinctive approach towards independence results by model-theoretic methods.

ISBN: 9783030289218

Standard No.: 10.1007/978-3-030-28921-8doiSubjects--Topical Terms:

543782
Proof theory.

LC Class. No.: QA9.54 / .K685 2019

Dewey Class. No.: 511.36

A model-theoretic approach to proof theory
LDR:02944nmm a2200337 a 4500 001 2193323
003 DE-He213
005 20191223164841.0
006 m d
007 cr nn 008maaau
008 200514s2019 gw s 0 eng d
020 $a 9783030289218 $q (electronic bk.)
020 $a 9783030289201 $q (paper)
024 7 $a 10.1007/978-3-030-28921-8 $2 doi
035 $a 978-3-030-28921-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.54 $b .K685 2019
072 7 $a HPL $2 bicssc
072 7 $a PHI011000 $2 bisacsh
072 7 $a QDTL $2 thema
082 0 4 $a 511.36 $2 23
090 $a QA9.54 $b .K87 2019
100 1 $a Kotlarski, Henryk. $3 3414423
245 1 2 $a A model-theoretic approach to proof theory $h [electronic resource] / $c by Henryk Kotlarski ; edited by Zofia Adamowicz, Teresa Bigorajska, Konrad Zdanowski.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xviii, 109 p. : $b ill., digital ; $c 24 cm.
490 1 $a Trends in logic, studia logica library, $x 1572-6126 ; $v v.51
505 0 $a Chapter 1. Some combinatorics -- Chapter 2. Some model theory -- Chapter 3. Incompleteness -- Chapter 4. Transﬁnite induction -- Chapter 5. Satisfaction classes.
520 $a This book presents a detailed treatment of ordinal combinatorics of large sets tailored for independence results. It uses model theoretic and combinatorial methods to obtain results in proof theory, such as incompleteness theorems or a description of the provably total functions of a theory. In the first chapter, the authors first discusses ordinal combinatorics of finite sets in the style of Ketonen and Solovay. This provides a background for an analysis of subsystems of Peano Arithmetic as well as for combinatorial independence results. Next, the volume examines a variety of proofs of Godel's incompleteness theorems. The presented proofs differ strongly in nature. They show various aspects of incompleteness phenomena. In additon, coverage introduces some classical methods like the arithmetized completeness theorem, satisfaction predicates or partial satisfaction classes. It also applies them in many contexts. The fourth chapter defines the method of indicators for obtaining independence results. It shows what amount of transfinite induction we have in fragments of Peano arithmetic. Then, it uses combinatorics of large sets of the first chapter to show independence results. The last chapter considers nonstandard satisfaction classes. It presents some of the classical theorems related to them. In particular, it covers the results by S. Smith on definability in the language with a satisfaction class and on models without a satisfaction class. Overall, the book's content lies on the border between combinatorics, proof theory, and model theory of arithmetic. It offers readers a distinctive approach towards independence results by model-theoretic methods.
650 0 $a Proof theory. $3 543782
650 1 4 $a Logic. $3 529544
650 2 4 $a Mathematical Logic and Foundations. $3 892656
700 1 $a Adamowicz, Zofia. $3 3414424
700 1 $a Bigorajska, Teresa. $3 3414425
700 1 $a Zdanowski, Konrad. $3 3414426
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Trends in logic, studia logica library ; $v v.51. $3 3414427
856 4 0 $u https://doi.org/10.1007/978-3-030-28921-8
950 $a Mathematics and Statistics (Springer-11649)