Morasses, square and forcing axioms

Annals of Pure and Applied Logic

Volumn 80, Issue 2, 1996, Pages 139-163

  Morgan, Charles ^a  

^a MERTON COLLEGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030570652     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(95)00060-7     Document Type: Article

References (27)

1. 1, Israel J. Math. 53 (1986) 1-51.
2. [2] J. Baumgartner and S. Shelah, Remarks on superatomic Boolean algebras, Ann. Pure App. Logic, 33 (1987) 109-129.
3. [3] A. Beller, R. Jensen and P. Welch, Coding the Universe, LMS Lecture Note Series, Vol. 47, C.U.P., 1982.
4. [4] Bilaniuk, Souslin trees with few automorphisms, preprint.
5. [5] H.-D. Donder, Coarse Morasses in L, in: R. Jensen and A. Prestel, eds., Set Theory and Model Theory, SLN 872 (Springer, Berlin, 1981).
6. [6] H.-D. Donder, Another Look at Gap-One Morasses, in: Recursion Theory, Proc. Symp. Pure Math., Vol. 42 (AMS, Providence, RI, 1985).
7. [7] R. Grossherg and S. Shelah, On the number of nonisomorphic models of an infinatory theory which has the infinatory order property, Part A, J. Symobolic Logic 51 (1986) 302-322.
8. [8] A. Hajnal, A remark on the homogeneity of infinite permutation groups, preprint.
9. 1, J. Symbolic Logic. 55 (1990) 466-477.
10. [10] C. Morgan, The equivalence of morasses and simplified morasses in the finite gap cases, Thesis, Oxford, 1989.
11. [11] C. Morgan, Higher gap morasses, I, preprint.
12. [12] C. Morgan, Pseudo-morasses, in preparation.
13. [13] S. Shelah, Vive la différence!, in preparation.
14. [14] S. Shelah. B. Hart and C. Laflamme, Models with second-order properties, V, in preparation.
15. [15] S. Shelah and L. Stanley. S-Forcing, I, Israel J. Math, 43 (1982) 185-224.
16. [16] S. Shelah and L. Stanley, A theorem and some consistency results in partition calculus, Ann. Pure Appl. Logic, 36 (1987) 119-152.
17. 2 requires an inaccessible, Proc. AMS 111 (1991) 1105-1118.
18. [18] S. Todorcevic, Trees, subtrees and order-types, Ann. Math. Logic 20 (1981) 233-268.
19. [19] S. Todorcevic, Aronszajn trees and partitions, Israel J. Math. 52 (1985) 53-58.
20. [20] S. Todorcevic, Partitioning pairs of countable ordinals, Acta Math. (1987).
21. [21] S. Todorcevic and B. Velickovic, Martin's axiom and partitions, Comp. Math. (1987) 391-408.
22. [22] B. Velickovic, Forcing axioms and stationary sets, Adv. Math., 94 (1992) 256-284.
23. [23] D. Velleman, Simplified morasses, J. Symbolic Logic 49 (1984), 257-271.
24. [24] D. Velleman, Simplified morasses with linear limits. J. Symbolic Logic 49 (1984) 1001-1021.
25. [25] D, Velleman, On a combinatorial principle of Hajnal and Kanjatt, J. Symbolic Logic 51 (1986) 1056-1060.
26. [26] D. Velleman, Gap-two simplified morasses, Ann. Pure Appl. Logic 34 (1987) 171-208.
27. [27] D. Velleman, Partitioning pairs of countable sets, J. Symbolic Logic 55 (1990) 1019-1021.