Advertisement

Decidable Theories

  • Gilles Dowek
Part of the Undergraduate Topics in Computer Science book series (UTICS)

Abstract

This chapter presents another positive result: if undecidable in general, provability may be decidable in some particular theories. This is illustrated with the example of linear arithmetic.

Copyright information

© Springer-Verlag London Limited 2011

Authors and Affiliations

  1. 1.École PolytechniquePalaiseauFrance

Personalised recommendations