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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Dowek, G. (2011). Decidable Theories. In: Proofs and Algorithms. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-121-9_7
Download citation
DOI: https://doi.org/10.1007/978-0-85729-121-9_7
Publisher Name: Springer, London
Print ISBN: 978-0-85729-120-2
Online ISBN: 978-0-85729-121-9
eBook Packages: Computer ScienceComputer Science (R0)