Predicate Calculus

Nancy Baxter, Ed Dubinsky and Gary Levin
Additional contact information
Nancy Baxter: Dickinson College, Department of Mathematical Sciences
Ed Dubinsky: Purdue University, Departments of Education and Mathematics
Gary Levin: Clarkson University, Department of Mathematics and Computer Science

Chapter Chapter 5 in Learning Discrete Mathematics with ISETL, 1989, pp 225-263 from Springer

Abstract: Abstract In this chapter, our method of using ISETL to learn Mathematics begins to produce benefits. Predicate calculus refers to the study of quantified logical statements and various operations that can be performed on them. This topic is critical for understanding most of the important concepts in Mathematics. For example, it is hard to imagine how anyone could master the notions of limit and continuity in calculus, linear independence in algebra, or compactness in topology without a solid foundation in working with quantifications.

Keywords: Mathematical Notation; Boolean Function; Binary Operation; Predicate Calculus; Nest Loop (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3592-7_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461235927

DOI: 10.1007/978-1-4612-3592-7_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().