Foundations of Computing: System Development with Set Theory and Logic
Written for professionals learning the field of discrete mathematics, this book provides the necessary foundations of computer science without requiring excessive mathematical prerequisites. Using a balanced approach of theory and examples, software engineers will find it a refreshing treatment of applications in programming.
82 pages matching called in this book
Results 1-3 of 82
What people are saying - Write a review
We haven't found any reviews in the usual places.
Set Theory and Induction
Relations and Functions
16 other sections not shown
Alloc application arity axioms base set bijection Bool called cartesian product Chapter codomain computing condition Consequently Consider construction couple cursor deduction defined definition denoted described determined dictionary disjoint domain elements empty empty set equivalent establish example Exercise extension Feature Notation finite first-order logic Forest formal ForOrd ForOVl FPts function F function symbol given Gr(F Gr(R graph implies induction principle inductive set instance introduced isomorphism KReTypes KTasks L'Pts language ListPtd0 ListVl LPts n-ary n-ary function n-tuple natural numbers Note objects occur operations parse tree precondition predicate symbol proof propositional logic relation represented rule satisfied secondary features Section semantics set theory specified string structural induction subset substitutable successor function task tautology theorem total function TPts TreePtd0 true truth assignment truth table unary Vals variable features Wfes