Abstract
A computer can give a lot of help to a mathematician struggling with a conjecture which he desires to turn into a theorem. A computer scientist who wants to certify the correctness of some very detailed design with respect to not-so-stringent specifications needs aid of essentially the same kind. Since these activities are very fundamental, computer assistance should not be supplied on an ad hoc and irregular basis, but should come in a systematic and utterly reliable form. A broad-spectrum proof development environment presupposes a flexible formalism within which proofs are caxried out partly by man and partly by sophisticated symbolic manipulation algorithms.
One main trend since about 1880 has been the interplay of the predicate calculus with set theory.
—From [Wan93, 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). Logical Background. In: Set Theory for Computing. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3452-2_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3452-2_2
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