Book contents
- Frontmatter
- Introduction
- Contents
- K. Jon Barwise (1942-2000)
- TUTORIALS
- PHOTOGRAPHS
- ARTICLES
- Bounded forcing axioms and the size of the continuum
- Hilbert's wide program
- Rigidity conjectures
- Metapredicative and explicit Mahlo: a proof-theoretic perspective
- A two-dimensional tree ideal
- Psychology looks hopefully to logic
- Russell's logics
- Partitioning pairs of uncountable sets
- Aspects of the Turing jump
- Liouville functions
- References
Partitioning pairs of uncountable sets
from ARTICLES
Published online by Cambridge University Press: 27 June 2017
Book contents
- Frontmatter
- Introduction
- Contents
- K. Jon Barwise (1942-2000)
- TUTORIALS
- PHOTOGRAPHS
- ARTICLES
- Bounded forcing axioms and the size of the continuum
- Hilbert's wide program
- Rigidity conjectures
- Metapredicative and explicit Mahlo: a proof-theoretic perspective
- A two-dimensional tree ideal
- Psychology looks hopefully to logic
- Russell's logics
- Partitioning pairs of uncountable sets
- Aspects of the Turing jump
- Liouville functions
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Logic Colloquium 2000 , pp. 350 - 364Publisher: Cambridge University PressPrint publication year: 2005
References
[1] and , Mutually stationary sequences of sets and the non-saturation of the non-stationary ideal on pκ (λ),Acta Mathematica, vol. 186 (2001), pp. 271–300.Google Scholar
[2] and , Set theory, London Mathematical Society Student Texts, vol. 48, Cambridge University Press, Cambridge, 1999.
[3] , The higher infinite, Perspectives in Mathematical Logic, Springer, 1994.
[4] , Was Sierpinski right? I, Israel Journal of Mathematics, vol. 62 (1988), pp. 355–380.Google Scholar
[5] , Advances in cardinal arithmetic, Finite and infinite combinatorics in sets and logic ( etal, editor),NATO Adv. Sci. Inst. Ser.CMath. Phys. Sci., no. 411, Kluwer, Dordrecht, 1993, pp. 355–383.
[6] , Nω+1 has a jonsson algebra, Cardinal arithmetic, Oxford University Press, New York, 1994, pp. 34–116.
[7] , There are jonsson algebras in many inaccessible cardinals, Cardinal arithmetic, Oxford University Press, New York, 1994, pp. 117–184.
[8] , Splitting Pκ into maximally many stationary sets, Israel Journal of Mathematics, vol. 114 (1999), pp. 347–357.Google Scholar
[9] , Partitioning pairs of countable ordinals, Acta Mathematica, vol. 159 (1987), pp. 261–294.Google Scholar
[10] , Partitioning pairs of countable sets, Proceedings of the AmerericanMathematical Society, vol. 111 (1991), pp. 841–844.Google Scholar
[11] , Partitioning pairs of countable sets of ordinals, The Journal of Symbolic Logic, vol. 55 (1990), pp. 1019–1021.Google Scholar