Development of Mathematical Logic |
Contents
NOTES ON CHAPTER | 14 |
NOTES ON CHAPTER 2 | 35 |
RECURSIVE FUNCTIONS | 37 |
Copyright | |
7 other sections not shown
Other editions - View all
Common terms and phrases
addition argument arithmetic assigned associated axioms belongs bound called chapter consider consistent constructive contains contradiction course decidable decision defined definition denote derived determine disjunction domain elements equality equation equivalent example existence expressed fact false finite follows formalisation formulation free variables further give given height holds implication individuals induction inference infinite instance integer introduced intuitionist intuitionist logic machine mathematical method natural numbers observe obtained occur operation pair particular polynomials possible predicate logic prime primitive recursive primitive recursive function problem procedure proof provable prove quantifiers readily recursively enumerable relation remaining remarkable replace representing respectively result rules of inference satisfiable sentence sentence logic sequence shown signs single spread subset substitution suppose tautology term theorem theory true unique universally valid variables write zero