Abstract
Set theory, conceived toward the end of the nineteenth century, shaped the language of today’s mathematics. It should provide, essentially for the same reasons, the standard ingredients for the language of computer science as that discipline progresses out of its own infancy. This book aims to bring to light evidence that such a task can indeed be rewarding, by developing tools (algorithmic, as well as conceptual) for better and deeper exploitation of Set theory in computer science.
My intention was not to represent an abstract logic in formulas, but to express a content through written signs in a more precise and clear way than it is possible to do through words. In fact, what I wanted to create was not a mere calculus ratiocinator but a lingua characterica in Leibniz’s sense.
—Gottlob Frege, 1882, from [Hei77, p. 2]
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
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cantone, D., Omodeo, E., Policriti, A. (2001). What Is Computable Set Theory?. In: Set Theory for Computing. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3452-2_1
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3452-2_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2905-1
Online ISBN: 978-1-4757-3452-2
eBook Packages: Springer Book Archive