## Logic Colloquium: Proceedings of the Summer School and Colloquium in Mathematical LogicAssociation for Symbolic Logic, 1998 - Logic, Symbolic and mathematical |

### From inside the book

Results 1-3 of 23

Page 523

If we are restricting ourselves to premice below O^, then the

of the following simple kind: Definition 9. An

linear if for any a < /? < 6 T-pred(fi + 1) = a => /? = a + n for some n < co A VA: ...

If we are restricting ourselves to premice below O^, then the

**iterations**arising areof the following simple kind: Definition 9. An

**iteration**tree T of length 9 is almostlinear if for any a < /? < 6 T-pred(fi + 1) = a => /? = a + n for some n < co A VA: ...

Page 524

This results in

common final inner model, W = M^ = MŁ say. (By "universality" we cannot have

any truncation of any model occurring in these trees, and the final models on T, ...

This results in

**iteration**trees, call them, T on Mj = K\ and U on Mtf = K2, with acommon final inner model, W = M^ = MŁ say. (By "universality" we cannot have

any truncation of any model occurring in these trees, and the final models on T, ...

Page 530

Let W be the "very soundness" witness for /* obtained by

measure A > k' (cf. [23] Ch. 8). Let X -< {Vn, EW,D, €) where r\ is some sufficiently

large cardinal, card(X) = k, but X n k ^ k. X exists by the Jonsson property at k.

Let W be the "very soundness" witness for /* obtained by

**iterating**each order zeromeasure A > k' (cf. [23] Ch. 8). Let X -< {Vn, EW,D, €) where r\ is some sufficiently

large cardinal, card(X) = k, but X n k ^ k. X exists by the Jonsson property at k.

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Collapsing PolynomialTime Degrees | 1 |

Qualitative and Probabilistic Models of Full Belief | 25 |

Relative Splittings of 0 in the A Enumeration Degrees | 51 |

Copyright | |

24 other sections not shown

### Other editions - View all

### Common terms and phrases

admissible set algebra analytic arithmetic Artin Approximation assume automorphism axioms Baire belief base Boolean bounded Claim closed complete condition construction contains core Corollary countable defined definition denote distributive lattice e-degrees elements embedding entailment relation entrenchment equivalent exists extender finite fixed point formula function fuzzy logic given Godel logic Hajek hence holds homomorphism ideal implies induction infinite initial segment inner model isomorphism iteration Jonsson KPMr Lecture Notes Lemma length Logic Colloquium 98 Math Mathematics measurable cardinal natural numbers normal notation Notes in Logic notion o-minimal obtain Peano arithmetic polynomial predicate primitive recursive problem proof theory Proposition prove quantifier quantifier elimination quotients reduction result ring rule satisfies semi-Thue system sequence set theory space strings strong cardinals structure subset Symbolic Logic tp(A transfinite tree trivial Turing Turing degrees type theory universe variables well-ordering