Abstract
What is the relation of the ordinary first-order logic and the general theory of computation? A hoped-for connection would be to interpret a computation of the value b of a function f(x) for the argument a as a deduction of the equation (b = f(a)) in a suitable elementary number theory. This equation may be thought of as being obtained by a computation in an equation calculus from a set of defining equations plus propositional logic plus substitution of terms for variables and substitution of identicals. Received first-order logic can be made commensurable with this equation calculus by eliminating predicates in terms of their characteristic functions and eliminating existential quantifiers in terms of Skolem functions. It turns out that not all sets of defining equations can be obtained in this way if the received first-order logic is used. However, they can all be obtained if independence-friendly logic is used. This turns all basic problems of computation theory into problems of logical theory.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hintikka, J.: The Principles of Mathematics Revisited. Cambridge University Press, Cambridge (1996)
Hintikka, J., Sandu, G.: What is the logic of parallel processing? International Journal of Foundations of Computer Science 6, 27–49 (1995)
Phillips, I.C.C.: Recursion theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 1, pp. 79–187. Clarendon Press, Oxford (1992)
Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)
Sandu, G.: Independence-Friendly Logic. Cambridge Unversity Press, Cambridge (forthcoming)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hintikka, J. (2010). Does Logic Count?. In: Magnani, L., Carnielli, W., Pizzi, C. (eds) Model-Based Reasoning in Science and Technology. Studies in Computational Intelligence, vol 314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15223-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-15223-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15222-1
Online ISBN: 978-3-642-15223-8
eBook Packages: EngineeringEngineering (R0)