Hyperarithmetical Relations and Existentially Decidable Models in Recursive Model TheoryUniversity of Wisconsin--Madison, 1992 - 194 Seiten |
Inhalt
On Possible Strengthenings of a Theorem by Barker | 21 |
Recursive Models for Model Completions | 51 |
An Almost Recursively 1categorical Model | 74 |
Urheberrecht | |
1 weitere Abschnitte werden nicht angezeigt.
Häufige Begriffe und Wortgruppen
1-decidable 1-recursive a-ovoid model Aa,k assume atomic diagram atomic formulas binary relation C. J. ASH compute corresponding countable model counterexamples define Definition denote disjoint disjunctive normal form elements encoding equivalence classes equivalence relation existential formulas family of sets finite sequences formally formula with parameters free variables given Gödel numbers Goncharov's hold hyperarithmetical hierarchy infinitary formulas infinitely intrinsically recursive K₁ language limit ordinal M-set Mf(n Mƒ(n Mj,s Model Completion Lemma model isomorphic model theory natural numbers non-empty notation Note odd numbers oracle order type Prolegomena Proof quantifier free formulas r.e. sets recursive categoricity recursive function recursive infinitary recursive isomorphism recursive models recursive ordinals recursive set recursive structure recursively equivalent Sat(a satisfaction relation satisfy sentences signature simply split stage standard enumeration Sublemma subset TD,E Theorem transfinite recursion tuples unary predicates uniformly recursive