- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Some remarks on the Open Coloring Axiom
Annals of Pure and Applied Logic 172 (5):102912 (2021)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Bounded forcing axioms and the continuum.David Asperó & Joan Bagaria - 2001 - Annals of Pure and Applied Logic 109 (3):179-203.
Japanese Coloring Materials of Sculptures in the 8th Century: Mainly Concerning the Problem about the Character and Aptitude of Material.Norifumi Kunimoto - 2006 - Bigaku 57 (3):1-14.
Proper forcing, cardinal arithmetic, and uncountable linear orders.Justin Tatch Moore - 2005 - Bulletin of Symbolic Logic 11 (1):51-60.
Reverse Mathematics and the Coloring Number of Graphs.Matthew Jura - 2016 - Notre Dame Journal of Formal Logic 57 (1):27-44.
The Axiom of Choice as Interaction Brief Remarks on the Principle of Dependent Choices in a Dialogical Setting.Shahid Rahman - 2018 - In Hassan Tahiri (ed.), The Philosophers and Mathematics: Festschrift for Roshdi Rashed. Cham: Springer Verlag. pp. 201-248.
Filters, Antichains and Towers in Topological Spaces and the Axiom of Choice.Kyriakos Keremedis - 1998 - Mathematical Logic Quarterly 44 (3):359-366.
A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids.James H. Schmerl - 2012 - Journal of Symbolic Logic 77 (4):1165-1183.
No decreasing sequence of cardinals.Paul Howard & Eleftherios Tachtsis - 2016 - Archive for Mathematical Logic 55 (3-4):415-429.
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.
Decidability and Completeness for Open Formulas of Membership Theories.Dorella Bellè & Franco Parlamento - 1995 - Notre Dame Journal of Formal Logic 36 (2):304-318.
Analytics
Added to PP
2020-10-14
Downloads
13 (#968,869)
6 months
5 (#510,007)
2020-10-14
Downloads
13 (#968,869)
6 months
5 (#510,007)
Historical graph of downloads
References found in this work
On the Consistency of Some Partition Theorems for Continuous Colorings, and the Structure of ℵ 1 -Dense Real Order Types.J. Steprans, Uri Abraham, Matatyahu Rubin & Saharon Shelah - 2002 - Bulletin of Symbolic Logic 8 (2):303.
On the consistency of some partition theorems for continuous colorings, and the structure of ℵ1-dense real order types.Uri Abraham, Matatyahu Rubin & Saharon Shelah - 1985 - Annals of Pure and Applied Logic 29 (2):123-206.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6d9b7f7c4c-tstkh uwo