THEOREMS FROM MEASURE AXIOMS, COUNTEREXAMPLES FROM DIAMOND(++)

被引：1
|
作者：
FLEISSNER, W
机构：
[1] Department of Mathematics, University of Kansas, Lawrence, Kansas
来源：
WORK OF MARY ELLEN RUDIN | 1993年 / 705卷
关键词：
MARY ELLEN RUDIN; NORMAL MOORE SPACE CONJECTURE; MOORE SPACE; K'-SPACE; NORMAL; COLLECTIONWISE NORMAL; V=L; DIAMOND DOUBLE PLUS; SHRINKING;
D O I：
10.1111/j.1749-6632.1993.tb12525.x
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Daniels' proof that after adding supercompact many random reals, normal k'-spaces are collectionwise normal is simplified. Examples of how to use diamond(++) to construct spaces are given. Question 36 of Watson is answered.
引用
收藏
页码：67 / 77
页数：11
相关论文
共 50 条
  • [41] TAMENESS FROM LARGE CARDINAL AXIOMS
    Boney, Will
    JOURNAL OF SYMBOLIC LOGIC, 2014, 79 (04) : 1092 - 1119
  • [42] From axioms to new insights into dandruff
    Piérard-Franchimont, C
    Hermanns, JF
    Degreef, H
    Piérard, GE
    DERMATOLOGY, 2000, 200 (02) : 93 - 98
  • [43] Axioms from interactions of actors theory
    Green, N
    KYBERNETES, 2004, 33 (9-10) : 1433 - 1462
  • [44] ON LEARNING FROM QUERIES AND COUNTEREXAMPLES IN THE PRESENCE OF NOISE
    SAKAKIBARA, Y
    INFORMATION PROCESSING LETTERS, 1991, 37 (05) : 279 - 284
  • [45] From Counterexamples to Incremental Interactive Tracing of Errors
    Weitl, Franz
    Nakajima, Shin
    Freitag, Burkhard
    IT-INFORMATION TECHNOLOGY, 2010, 52 (05): : 295 - 297
  • [46] LEARNING REGULAR SETS FROM QUERIES AND COUNTEREXAMPLES
    ANGLUIN, D
    INFORMATION AND COMPUTATION, 1987, 75 (02) : 87 - 106
  • [47] The inverse Sturm-Liouville problem: Uniqueness theorems and counterexamples
    Sadovnichii, V. A.
    Sultanaev, Ya. T.
    Akhtyamov, A. M.
    DOKLADY MATHEMATICS, 2006, 74 (03) : 889 - 892
  • [48] The inverse Sturm-Liouville problem: Uniqueness theorems and counterexamples
    V. A. Sadovnichii
    Ya. T. Sultanaev
    A. M. Akhtyamov
    Doklady Mathematics, 2006, 74 : 889 - 892
  • [49] Learning multiplicity automata from smallest counterexamples
    Forster, J
    COMPUTATIONAL LEARNING THEORY, 1999, 1572 : 79 - 90
  • [50] Generating Timed UI Tests from Counterexamples
    Diner, Dominik
    Fraser, Gordon
    Schweikl, Sebastian
    TESTS AND PROOFS (TAP 2021), 2021, 12740 : 53 - 71
12345