國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Decidability of logical theories and...

Rasga, Joao.

Decidability of logical theories and their combination

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Decidability of logical theories and their combinationby Joao Rasga, Cristina Sernadas.
作者:	Rasga, Joao.
其他作者:	Sernadas, Cristina.
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	xiii, 178 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	First-order logic.
電子資源:	https://doi.org/10.1007/978-3-030-56554-1
ISBN:	9783030565541$q(electronic bk.)

Decidability of logical theories and their combination
Rasga, Joao.

Decidability of logical theories and their combination[electronic resource] /by Joao Rasga, Cristina Sernadas. - Cham :Springer International Publishing :2020. - xiii, 178 p. :ill., digital ;24 cm. - Studies in universal logic,2297-0282. - Studies in universal logic..

Chapter 1: First Order Logic -- Chapter 2: Reasoning with Theories -- Chapter 3: Decidability Results on Theories -- Chapter 4: Quantifier Elimination -- Chapter 5: Combination of Theories -- Appendix: Basics of Computability -- Bibliography -- Table of Symbols -- Subject Index.

This textbook provides a self-contained introduction to decidability of first-order theories and their combination. The technical material is presented in a systematic and universal way and illustrated with plenty of examples and a range of proposed exercises. After an overview of basic first-order logic concepts, the authors discuss some model-theoretic notions like embeddings, diagrams, and elementary substructures. The text then goes on to explore an applicable way to deduce logical consequences from a given theory and presents sufficient conditions for a theory to be decidable. The chapters that follow focus on quantifier elimination, decidability of the combination of first-order theories and the basics of computability theory. The inclusion of a chapter on Gentzen calculus, cut elimination, and Craig interpolation, as well as a chapter on combination of theories and preservation of decidability, help to set this volume apart from similar books in the field. Decidability of Logical Theories and their Combination is ideal for graduate students of Mathematics and is equally suitable for Computer Science, Philosophy and Physics students who are interested in gaining a deeper understanding of the subject. The book is also directed to researchers that intend to get acquainted with first-order theories and their combination.

ISBN: 9783030565541$q(electronic bk.)

Standard No.: 10.1007/978-3-030-56554-1doiSubjects--Topical Terms:

466481
First-order logic.

LC Class. No.: QA9

Dewey Class. No.: 511.3

Decidability of logical theories and their combination
LDR:02686nmm a2200349 a 4500 001 588990
003 DE-He213
005 20210204133421.0
006 m d
007 cr nn 008maaau
008 210525s2020 sz s 0 eng d
020 $a 9783030565541$q(electronic bk.)
020 $a 9783030565534$q(paper)
024 7 $a 10.1007/978-3-030-56554-1 $2 doi
035 $a 978-3-030-56554-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9
072 7 $a PBC $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a PBC $2 thema
072 7 $a PBCD $2 thema
082 0 4 $a 511.3 $2 23
090 $a QA9 $b .R224 2020
100 1 $a Rasga, Joao. $3 880675
245 1 0 $a Decidability of logical theories and their combination $h [electronic resource] / $c by Joao Rasga, Cristina Sernadas.
260 $a Cham : $b Springer International Publishing : $b Imprint: Birkhauser, $c 2020.
300 $a xiii, 178 p. : $b ill., digital ; $c 24 cm.
490 1 $a Studies in universal logic, $x 2297-0282
505 0 $a Chapter 1: First Order Logic -- Chapter 2: Reasoning with Theories -- Chapter 3: Decidability Results on Theories -- Chapter 4: Quantifier Elimination -- Chapter 5: Combination of Theories -- Appendix: Basics of Computability -- Bibliography -- Table of Symbols -- Subject Index.
520 $a This textbook provides a self-contained introduction to decidability of first-order theories and their combination. The technical material is presented in a systematic and universal way and illustrated with plenty of examples and a range of proposed exercises. After an overview of basic first-order logic concepts, the authors discuss some model-theoretic notions like embeddings, diagrams, and elementary substructures. The text then goes on to explore an applicable way to deduce logical consequences from a given theory and presents sufficient conditions for a theory to be decidable. The chapters that follow focus on quantifier elimination, decidability of the combination of first-order theories and the basics of computability theory. The inclusion of a chapter on Gentzen calculus, cut elimination, and Craig interpolation, as well as a chapter on combination of theories and preservation of decidability, help to set this volume apart from similar books in the field. Decidability of Logical Theories and their Combination is ideal for graduate students of Mathematics and is equally suitable for Computer Science, Philosophy and Physics students who are interested in gaining a deeper understanding of the subject. The book is also directed to researchers that intend to get acquainted with first-order theories and their combination.
650 0 $a First-order logic. $3 466481
650 1 4 $a Mathematical Logic and Foundations. $3 274479
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Philosophy of Mathematics. $3 745264
700 1 $a Sernadas, Cristina. $3 276665
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Studies in universal logic. $3 563590
856 4 0 $u https://doi.org/10.1007/978-3-030-56554-1
950 $a Mathematics and Statistics (SpringerNature-11649)