Abstract
Logical systems such as Q ∞0 have infinitely many theorems—indeed, infinitely many essentially different theorems—but these theorems are finitely generated. There may be infinitely many axioms, but a finite description in the meta-language suffices to specify them. Wffs are finite, and proofs are finite. Such features seem to be inescapable characteristics of logical systems which can actually be used by finite, mortal men.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Peter B. Andrews
About this chapter
Cite this chapter
Andrews, P.B. (2002). Incompleteness and Undecidability. In: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Applied Logic Series, vol 27. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9934-4_8
Download citation
DOI: https://doi.org/10.1007/978-94-015-9934-4_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-6079-2
Online ISBN: 978-94-015-9934-4
eBook Packages: Springer Book Archive