Douglas Ensley
Abstract
Abstraction is an important part of mathematics and computer science, and it is a common stumbling point for students learning how to write mathematical proofs. This article outlines simple strategies for making mathematical proof less abstract in the context of the discrete mathematics course.
- Ensley, D., and Crawley, W. Discrete Mathematics: Mathematical Reasoning and Proof through Puzzles, Patterns and Games, John Wiley & Sons, 2006.Google Scholar
- Ensley, D., and Crawley, W. Flash activities for discrete mathematics, linked from http://webspace.ship.edu/deensley/DiscreteMath/Google Scholar
- Ensley, D. and Kaskosz, B. Tutorials for creating mathematics applets in Flash, at http://www.flashandmath.com/Google Scholar
Index Terms
- A hands-on approach to proof and abstraction
Recommendations
Query evaluation in deductive databases with alternating fixpoint semantics
First-order formulas allow natural descriptions of queries and rules. Van Gelder's alternating fixpoint semantics extends the well-founded semantics of normal logic programs to general logic programs with arbitrary first-order formulas in rule bodies. ...
An algebraic approach to intuitionistic modal logics in connection with intermediate predicate logics
AbstractModal counterparts of intermediate predicate logics will be studied by means of algebraic devise. Our main tool will be a construction of algebraic semantics for modal logics from algebraic frames for predicate logics. Uncountably many examples of ...
Hintikka's Independence-Friendly Logic Meets Nelson's Realizability
Inspired by Hintikka's ideas on constructivism, we are going to `effectivize' the game-theoretic semantics (abbreviated GTS) for independence-friendly first-order logic (IF-FOL), but in a somewhat different way than he did in the monograph `The ...
Comments