|
|
Re: Brainstorming about STEM (was About Functions)
Posted:
Dec 12, 2011 1:10 AM
|
|
Using another kind of computer-like language, DC Proof, we can represent a function f mapping set A to set B as follows:
ALL(x):[x in A => f(x) in B] (replace "in" by epsilon)
In words: For all x, if x is an element of A, then f(x) is an element B.
This simple notation completely characterizes all functions of 1 variable.
In the tutorial included with my program is a worked example (#6) illustrating the composition of functions, e.g. f(g(x)), along with suitable exercises with hints and full solutions.
Dan
Download my DC Proof 2.0 freeware at http://www.dcproof.com
|
|
