Mathematical Logic |
Contents
FirstOrder Theories | 9 |
Theorems in FirstOrder Theories | 26 |
5 | 36 |
Copyright | |
13 other sections not shown
Other editions - View all
Common terms and phrases
A₁ arithmetical axiom of constructibility axiom system axiomatized b₁ benign bijective mapping Card(x cardinal choose closed formula consistency proof constructible continuum hypothesis corollary countable decision method defining axiom E-interpretation element elementarily equivalent elementary extension equivalent explicit definition expression numbers extension by definitions F is defined F is recursive finite number follows function F function or predicate function symbol functions and predicates H-index Hence homomorphism hyperarithmetical implies induction hypothesis infinite interpretation introduce isomorphism J-forces L-set Lemma M-set n-ary function n-type natural numbers negation nonempty nonlogical axioms nonlogical symbols obtain ordinal partial functional predicate symbol provable prove quantifiers R-formula recursive extension recursive function recursive partial functional recursively enumerable set replace result rule strongly undecidable structure subgroup subset substructure suppose tautology tautology theorem theory transfinite induction true Un(x unary predicate valid variable-free Vy(y