Corrigendum to our paper: ``A theorem on $n$-tuples which is equivalent to the well-ordering theorem''
Notre Dame Journal of Formal Logic 11 (2):220-220 (1970)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links |
|
| Through your library | Configure |
H. Rubin & J. E. Rubin (1967). A Theorem on $N$-Tuples Which is Equivalent to the Well-Ordering Theorem. Notre Dame Journal of Formal Logic 8 (1-2):48-50.
Helen Billinge (1997). A Constructive Formulation of Gleason's Theorem. Journal of Philosophical Logic 26 (6):661-670.
Robert Goldblatt (1985). On the Role of the Baire Category Theorem and Dependent Choice in the Foundations of Logic. Journal of Symbolic Logic 50 (2):412-422.
Jeffry L. Hirst (2004). Hindman's Theorem, Ultrafilters, and Reverse Mathematics. Journal of Symbolic Logic 69 (1):65-72.
Pilar Dellunde (2000). A Preservation Theorem for Equality-Free Horn Sentences. Theoria 15 (3):517-530.
Paul E. Howard, Arthur L. Rubin & Jean E. Rubin (1978). Independence Results for Class Forms of the Axiom of Choice. Journal of Symbolic Logic 43 (4):673-684.
FangWen Yuan (2008). Query the Triple Loophole of the Proof of Gödel Incompleteness Theorem. Proceedings of the Xxii World Congress of Philosophy 41:77-94.
Victor Harnik & Michael Makkai (1976). Applications of Vaught Sentences and the Covering Theorem. Journal of Symbolic Logic 41 (1):171-187.
Mark Howard (1988). A Proofless Proof of the Barwise Compactness Theorem. Journal of Symbolic Logic 53 (2):597-602.
Douglas N. Hoover (1982). A Normal Form Theorem for Lω 1p, with Applications. Journal of Symbolic Logic 47 (3):605 - 624.
Josef Berger, Douglas Bridges & Peter Schuster (2006). The Fan Theorem and Unique Existence of Maxima. Journal of Symbolic Logic 71 (2):713 - 720.
Jarosław Achinger (1986). Generalization of Scott's Formula for Retractions From Generalized Alexandroff's Cube. Studia Logica 45 (3):281 - 292.
H. Andréka, Á Kurucz & I. Németi (1994). Connections Between Axioms of Set Theory and Basic Theorems of Universal Algebra. Journal of Symbolic Logic 59 (3):912-923.
Stephen G. Simpson (1984). Which Set Existence Axioms Are Needed to Prove the Cauchy/Peano Theorem for Ordinary Differential Equations? Journal of Symbolic Logic 49 (3):783-802.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-24Total downloads1 ( #275,053 of 549,682 )Recent downloads (6 months)0How can I increase my downloads? |

