Abstract
The method of arithmetization of syntax described in Secton 2.3 can be applied not only to Peano arithmetic but also to any formalized theory in a first-order language.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
Comprehensive information on decidability and undecidability of theories as well as on the classical decision problem (Entscheidungsproblem) can be found, e.g., in Ershov et al. (1965) and in the monograph by Börger et al. (1997).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Murawski, R. (1999). Decidability Theory. In: Recursive Functions and Metamathematics. Synthese Library, vol 286. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2866-9_4
Download citation
DOI: https://doi.org/10.1007/978-94-017-2866-9_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5298-8
Online ISBN: 978-94-017-2866-9
eBook Packages: Springer Book Archive