Skip to main content
Birkhäuser

Decidability of Logical Theories and Their Combination

  • Textbook
  • © 2020

Overview

  • Provides a comprehensive, self-contained introduction to decidability of first-order theories, using detailed proofs and examples to illustrate and clarify complex concepts
  • Incorporates computability theory and reduction techniques to determine the decidability of theories
  • Illustrates a variety of ways to deduce logical consequences from a theory, including the use of Gentzen calculus for first-order logic

Part of the book series: Studies in Universal Logic (SUL)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 64.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

Keywords

About this book

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.

Authors and Affiliations

  • Department of Mathematics, Instituto Superior Técnico, Universidade de Lisboa and Instituto de Telecomunicações, Lisboa, Portugal

    João Rasga, Cristina Sernadas

About the authors

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

Bibliographic Information

Publish with us