𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large cardinals and iteration trees of height ω

✍ Scribed by Alessandro Andretta

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
906 KB
Volume
54
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strong Cardinals and Sets of Reals in Lω
Strong Cardinals and Sets of Reals in Lω1(ℝ)
✍ Ralf-Dieter Schindler 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 598 KB

## Abstract We generalize results of [3] and [1] to hyperprojective sets of reals, viz. to more than finitely many strong cardinals being involved. We show, for example, that if every set of reals in L~ω~ (ℝ) is weakly homogeneously Souslin, then there is an inner model with an inaccessible limit o

Agent searching in a tree and the optima
Agent searching in a tree and the optimality of iterative deepening
✍ Pallab Dasgupta; P.P. Chakrabarti; S.C. DeSarkar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 695 KB

The agent searching framework models the effort of a search strategy in terms of the distance traversed by an agent while exploring the search space. The framework has been found to be useful in modeling search problems where the cost of backtracking and retracing search paths is important in determ

Induced trees in graphs of large chromat
Induced trees in graphs of large chromatic number
✍ Scott, A. D. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB 👁 2 views

Gyárfás and Sumner independently conjectured that for every tree T and integer k there is an integer f (k, T ) such that every graph G with χ(G) > f(k, t) contains either K k or an induced copy of T . We prove a `topological´version of the conjecture: for every tree T and integer k there is g(k, T )