Abstract
In mathematics statements about mathematical objects are formulated and proved. In logics the formulation of statements (the syntax), the meaning of statements (the semantics), truth, proofs,etc. are studied. In this chapter we shall exhibit some applications of recursion theory to logics. Decidability, productivity, and effective inseparability will play an important role.
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
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Weihrauch, K. (1987). Some Applications to Logic. In: Computability. EATCS Monographs on Theoretical Computer Science, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69965-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-69965-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-69967-2
Online ISBN: 978-3-642-69965-8
eBook Packages: Springer Book Archive