Mostrar el registro sencillo del ítem
Axiomatic Set Theory à la Dijkstra and Scholten
dc.contributor.author | Acosta Gempeler, Ernesto | |
dc.contributor.author | Aldana Gomez, Bernarda | |
dc.contributor.author | Bohorquez Villamizar, Jaime Alejandro | |
dc.contributor.author | Rocha Niño, Hernan Camilo | |
dc.date.accessioned | 2021-05-05T21:39:52Z | |
dc.date.accessioned | 2021-10-01T17:20:51Z | |
dc.date.available | 2021-05-05 | |
dc.date.available | 2021-10-01T17:20:51Z | |
dc.date.issued | 2017 | |
dc.identifier.issn | 1865-0929 | |
dc.identifier.uri | https://repositorio.escuelaing.edu.co/handle/001/1394 | |
dc.description.abstract | The algebraic approach by E. W. Dijkstra and C. S. Scholten to formallogic is a proof calculus, where the notion of proof is a sequence of equivalencesproved – mainly – by using substitution of ‘equals for equals’. This paper presentsSet, a first-order logic axiomatization for set theory using the approach of Dijk-stra and Scholten. The approach is novel in that the symbolic manipulation offormulas is shown to be an eective tool for teaching axiomatic set theory tosophomore students in mathematics. This paper contains many examples on howargumentative proofs can be easily expressed inSetand points out howSetcanenrich the learning experience of students. These results are part of a larger ef-fort to formally study and mechanize topics in mathematics and computer sciencewith the algebraic approach of Dijkstra and Scholten. | eng |
dc.description.abstract | El enfoque algebraico de E. W. Dijkstra y C. S. Scholten para la lógica formal es un cálculo de pruebas, en el que la noción de prueba es una secuencia de equivalencias demostradas -principalmente- mediante la sustitución de "iguales por iguales". Este artículo presentaSet, una axiomatización de la lógica de primer orden para la teoría de conjuntos que utiliza el enfoque de Dijk-stra y Scholten. El enfoque es novedoso en el sentido de que la manipulación simbólica de las fórmulas se muestra como una herramienta eficaz para enseñar la teoría de conjuntos axiomática a los estudiantes de matemáticas. Este trabajo contiene muchos ejemplos sobre cómo las pruebas argumentativas pueden expresarse fácilmente enSet y señala cómoSet puede enriquecer la experiencia de aprendizaje de los estudiantes. Estos resultados forman parte de un esfuerzo mayor para estudiar y mecanizar formalmente temas de matemáticas y ciencias de la computación con el enfoque algebraico de Dijkstra y Scholten. | spa |
dc.format.extent | 16 páginas | spa |
dc.format.mimetype | application/pdf | spa |
dc.language.iso | eng | spa |
dc.publisher | Springer Verlag | spa |
dc.source | https://link.springer.com/chapter/10.1007/978-3-319-66562-7_55 | spa |
dc.title | Axiomatic Set Theory à la Dijkstra and Scholten | spa |
dc.type | Artículo de revista | spa |
dc.description.notes | The first three authors have been supported in part by grant DII/C004/2015 funded by Escuela Colombiana de Ingeniería. | eng |
dc.type.version | info:eu-repo/semantics/publishedVersion | spa |
oaire.accessrights | http://purl.org/coar/access_right/c_16ec | spa |
oaire.version | http://purl.org/coar/version/c_970fb48d4fbd8a85 | spa |
dc.contributor.researchgroup | Matemáticas | spa |
dc.publisher.place | Alemania | spa |
dc.relation.citationedition | Communications in Computer and Information Science, vol 735 (2017). | eng |
dc.relation.citationendpage | 790 | spa |
dc.relation.citationstartpage | 775 | spa |
dc.relation.citationvolume | 735 | spa |
dc.relation.indexed | N/A | spa |
dc.relation.ispartofjournal | Communications in Computer and Information Science | eng |
dc.relation.references | Dijkstra, E.W., Scholten, C.S.: Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer, New York (1990) | eng |
dc.relation.references | Halmos, P.R.: Naive Set Theory. Undergraduate Texts in Mathematics. Springer, New York (1974) | eng |
dc.relation.references | Hodel, R.E.: An Introduction to Mathematical Logic. Dover Publications Inc., New York (2013) | eng |
dc.relation.references | 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 | eng |
dc.relation.references | Hsiang, J.: Refutational theorem proving using term-rewriting systems. Artif. Intell. 25(3), 255–300 (1985) | eng |
dc.relation.references | Jech, T.J.: Set Theory. Pure and Applied Mathematics, a Series of Monographs and Textbooks, vol. 79. Academic Press, New York (1978) | eng |
dc.relation.references | Kunen, K.: Set Theory. Studies in Logic, vol. 34. College Publications, London (2013). Revised edition | eng |
dc.relation.references | 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 | eng |
dc.relation.references | Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci. 96(1), 73–155 (1992) | eng |
dc.relation.references | 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 | eng |
dc.relation.references | 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) | eng |
dc.relation.references | 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 | eng |
dc.relation.references | Tourlakis, G.J.: Lectures in Logic and Set Theory. Cambridge Studies in Advanced Mathematics, vol. 82–83. Cambridge University Press, Cambridge (2003) | eng |
dc.rights.accessrights | info:eu-repo/semantics/closedAccess | spa |
dc.subject.armarc | Teoría axiomática de los conjuntos | |
dc.subject.armarc | Manipulación simbólica | |
dc.subject.proposal | Axiomatic set theory Dijkstra | spa |
dc.subject.proposal | Scholten logic Derivation Formal system Zermelo | spa |
dc.subject.proposal | Fraenkel (ZF) Symbolic manipulation Undergraduate | spa |
dc.subject.proposal | level course | spa |
dc.subject.proposal | Teoría axiomática de conjuntos Lógica de Dijkstra | spa |
dc.subject.proposal | cholten Derivación Sistema formal Zermelo | spa |
dc.subject.proposal | Fraenkel (ZF) Manipulación simbólica Curso de pregrado | spa |
dc.subject.proposal | Curso de nivel universitario | spa |
dc.type.coar | http://purl.org/coar/resource_type/c_2df8fbb1 | spa |
dc.type.content | Text | spa |
dc.type.driver | info:eu-repo/semantics/article | spa |
dc.type.redcol | http://purl.org/redcol/resource_type/ART | spa |
Ficheros en el ítem
Este ítem aparece en la(s) siguiente(s) colección(ones)
-
AC - GIMATH: Grupo de investigación en Matemáticas de la Escuela Colombiana de Ingeniería [29]
Clasificación C- Convocatoria 2018