Research

Effective Set Membership in Computer Algebra and Beyond


Reference:

Davenport, J. H., 2008. Effective Set Membership in Computer Algebra and Beyond. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M. and Wiedijk, F., eds. Intelligent Computer Mathematics: Proc. AISC/Calculemus/MKM 2008. Vol. 5144. Berlin, Heidelberg: Springer, pp. 266-280. (Lecture Notes in Computer Science)

Related documents:

This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.

Official URL:

http://dx.doi.org/10.1007/978-3-540-85110-3_22

Abstract

In previous work, we showed the importance of distinguishing “I know that X ≠ Y" from “I don’t know that X = Y”. In this paper we look at effective set membership, starting with Gröbner bases, where the issues are well-expressed in algebra systems, and going on to integration and other questions of ‘computer calculus’. In particular, we claim that a better recognition of the role of set membership would clarify some features of computer algebra systems, such as ‘what does an integral mean as output’.

Details

Item Type Book Sections
CreatorsDavenport, J. H.
EditorsAutexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M. and Wiedijk, F.
DOI10.1007/978-3-540-85110-3_22
DepartmentsFaculty of Science > Computer Science
StatusPublished
ID Code12356
Additional InformationProceedings of the 9th International Conference, AISC 2008, 15th Symposium, Calculemus 2008, 7th International Conference, MKM 2008, Birmingham, UK, July 28 - August 1, 2008. ID number: 5144

Export

Actions (login required)

View Item