History and Philosophy of Logic 30 (2):141-155 (2009)
|Abstract||On Zermelo's view, any mathematical theory presupposes a non-empty domain, the elements of which enjoy equal status; furthermore, mathematical axioms must be chosen from among those propositions that reflect the equal status of domain elements. As for which propositions manage to do this, Zermelo's answer is, those that are ?symmetric?, meaning ?invariant under domain permutations?. We argue that symmetry constitutes Zermelo's conceptual analysis of ?general proposition?. Further, although others are commonly associated with the extension of Klein's Erlanger Programme to logic, Zermelo's name has a place in that story|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Hans van Ditmarsch, Wiebe van der Hoek & Petar Iliev (2011). Everything is Knowable – How to Get to Know Whether a Proposition is True. Theoria 78 (2):93-114.
Gregory H. Moore (1978). The Origins of Zermelo's Axiomatization of Set Theory. Journal of Philosophical Logic 7 (1):307 - 329.
Heinz-Dieter Ebbinghaus (2003). Zermelo: Definiteness and the Universe of Definable Sets. History and Philosophy of Logic 24 (3):197-219.
Franca D.’Agostini (2003). The Epistemological Liar. Croatian Journal of Philosophy 3 (2):125-144.
Tadeusz Ciecierski (2009). The Multiple-Proposition Approach Reconsidered. Logique Et Analyse 208:423-440.
A. R. D. Mathias (2001). Slim Models of Zermelo Set Theory. Journal of Symbolic Logic 66 (2):487-496.
J. Todd Wilson (2001). An Intuitionistic Version of Zermelo's Proof That Every Choice Set Can Be Well-Ordered. Journal of Symbolic Logic 66 (3):1121-1126.
R. Gregory Taylor (1993). Zermelo, Reductionism, and the Philosophy of Mathematics. Notre Dame Journal of Formal Logic 34 (4):539--63.
Denis McManus (2009). The General Form of the Proposition: The Unity of Language and the Generality of Logic in the Early Wittgenstein. Philosophical Investigations 32 (4):295-318.
R. Gregory Taylor (2002). Zermelo's Cantorian Theory of Systems of Infinitely Long Propositions. Bulletin of Symbolic Logic 8 (4):478-515.
Added to index2010-08-10
Total downloads6 ( #154,676 of 722,780 )
Recent downloads (6 months)1 ( #60,541 of 722,780 )
How can I increase my downloads?