Abstract
The algebraic approach by E.W. Dijkstra and C.S. Scholten to formal logic is a proof calculus, where the notion of proof is a sequence of equivalences proved – mainly – by using substitution of ‘equals for equals’. This paper presents \(\mathsf {Set}\), a first-order logic axiomatization for set theory using the approach of Dijkstra and Scholten. What is novel about the approach presented in this paper is that symbolic manipulation of formulas is an effective tool for teaching an axiomatic set theory course to sophomore-year undergraduate students in mathematics. This paper contains many examples on how argumentative proofs can be easily expressed in \(\mathsf {Set}\) and points out how the rigorous approach of \(\mathsf {Set}\) can enrich the learning experience of students. The results presented in this paper are part of a larger effort to formally study and mechanize topics in mathematics and computer science with the algebraic approach of Dijkstra and Scholten.
E. Acosta et al.—Supported in part by grant DII/C004/2015 funded by Escuela Colombiana de Ingeniería.
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
References
Dijkstra, E.W., Scholten, C.S.: Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer, New York (1990)
Halmos, P.R.: Naive Set Theory. Undergraduate Texts in Mathematics. Springer, New York (1974)
Hodel, R.E.: An Introduction to Mathematical Logic. Dover Publications Inc., New York (2013)
Hrbacek, K., Jech, T.J.: Introduction to Set Theory. Monographs and Textbooks in Pure and Applied Mathematics, vol. 220, 3rd edn. M. Dekker, New York (1999). Rev. and expanded edition
Hsiang, J.: Refutational theorem proving using term-rewriting systems. Artif. Intell. 25(3), 255–300 (1985)
Jech, T.J.: Set Theory. Pure and Applied Mathematics, a Series of Monographs and Textbooks, vol. 79. Academic Press, New York (1978)
Kunen, K.: Set Theory. Studies in Logic, vol. 34. College Publications, London (2013). Revised edition
Meseguer, J.: General logics. In: Logic Colloquium 1987: Proceedings. Studies in Logic and the Foundations of Mathematics, 1st edn., vol. 129, pp. 275–330. Elsevier, Granada, August 1989
Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci. 96(1), 73–155 (1992)
Rocha, C.: The formal system of Dijkstra and Scholten. In: Martí-Oliet, N., Ölveczky, P.C., Talcott, C. (eds.) Logic, Rewriting, and Concurrency. LNCS, vol. 9200, pp. 580–597. Springer, Cham (2015). doi:10.1007/978-3-319-23165-5_27
Rocha, C., Meseguer, J.: A rewriting decision procedure for Dijkstra-Scholten’s syllogistic logic with complements. Revista Colombiana de Computación 8(2), 101–130 (2007)
Rocha, C., Meseguer, J.: Theorem proving modulo based on boolean equational procedures. In: Berghammer, R., Möller, B., Struth, G. (eds.) RelMiCS 2008. LNCS, vol. 4988, pp. 337–351. Springer, Heidelberg (2008). doi:10.1007/978-3-540-78913-0_25
Tourlakis, G.J.: Lectures in Logic and Set Theory. Cambridge Studies in Advanced Mathematics, vol. 82–83. Cambridge University Press, Cambridge (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Acosta, E., Aldana, B., Bohórquez, J., Rocha, C. (2017). Axiomatic Set Theory à la Dijkstra and Scholten. In: Solano, A., Ordoñez, H. (eds) Advances in Computing. CCC 2017. Communications in Computer and Information Science, vol 735. Springer, Cham. https://doi.org/10.1007/978-3-319-66562-7_55
Download citation
DOI: https://doi.org/10.1007/978-3-319-66562-7_55
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66561-0
Online ISBN: 978-3-319-66562-7
eBook Packages: Computer ScienceComputer Science (R0)