Our development of a formal definition of computability in the previous chapter might have seemed out of place. We used our generation template and some simple references to propositional connectives and (bounded) quantifiers, but otherwise there was seemingly little connection to logic. In this chapter, we establish that computability and logic are fundamentally intertwined.
Review the options below to login to check your access.
Log in with your Cambridge Higher Education account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.