Decidability of Logical Theories and Their Combination - Brossura

Rasga, Joo; Sernadas, Cristina

Brossura

ISBN 10: 3030565564 ISBN 13: 9783030565565

Casa editrice: Birkhauser, 2021

Riassunto

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.<div><br><div>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.&nbsp;</div><div><br></div><div>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.</div><div><br></div><div><i>Decidability of Logical Theories and their Combination</i>&nbsp;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.</div></div>

Su questo libro

Informazioni sull?autore

João Rasga is an Associate Professor and Cristina Sernadas is a Full Professor at the Mathematics Department of Instituto Superior Técnico

Dalla quarta di copertina

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.<div><br><div>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.&nbsp;</div><div><br></div><div>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.</div><div><br></div><div><i>Decidability of Logical Theories and their Combination</i> 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.</div><div><br></div></div>

Dettagli dell?edizione

• Editore: Birkhauser
• Data di pubblicazione: 2021
• Lingua: Inglese
• ISBN 10: 3030565564
• ISBN 13: 9783030565565
• Rilegatura: Copertina flessibile
• Numero di pagine: 178
• Contatto del produttore: non disponibile
• Persona responsabile: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Germania