Abstract
As a particular interpretation, this problem contains the decision problem for first-order logic (that is, the problem of algorithmically deciding whether a first-order formula is universally valid). A negative answer to the Entscheidungsproblem was given by Church and Turing, who proved that it is impossible to decide algorithmically whether statements in arithmetic are true or false.
Check the model without a serial number.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nešetřil, J., de Mendez, P.O. (2012). Algorithmic Applications. In: Sparsity. Algorithms and Combinatorics, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27875-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-27875-4_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27874-7
Online ISBN: 978-3-642-27875-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)