The Peircean Continuum

2020 ◽  
pp. 328-346
Author(s):  
Francisco Vargas ◽  
Matthew E. Moore

Charles Sanders Peirce’s views on continuity, the concept he lionized as “the master-key which … unlocks the arcana of philosophy”, are of vital importance for students of his philosophy, but have received much less attention from historians and philosophers of continuity. This is partly because Peirce’s mathematics of continuity was still very much a work in progress when he died over a century ago. In the first and principal section of this chapter, the first author summarizes the defining features of the theory of continuity that Peirce made the most progress on, and constructs a model for that theory as a proper class in Zermelo-Fraenkel Set Theory with Choice. This model provides a fuller mathematical vindication of Peirce’s conception than any reconstruction offered to date. The second section is an historical appendix, in which the second author briefly summarizes Peirce’s own attempts to put his conception into a rigorous form.

2005 ◽  
Vol 70 (3) ◽  
pp. 969-978 ◽  
Author(s):  
Laura Crosilla ◽  
Hajime Ishihara ◽  
Peter Schuster

AbstractThe Dedekind cuts in an ordered set form a set in the sense of constructive Zermelo–Fraenkel set theory. We deduce this statement from the principle of refinement, which we distill before from the axiom of fullness. Together with exponentiation, refinement is equivalent to fullness. None of the defining properties of an ordering is needed, and only refinement for two–element coverings is used.In particular, the Dedekind reals form a set: whence we have also refined an earlier result by Aczel and Rathjen, who invoked the full form of fullness. To further generalise this, we look at Richman's method to complete an arbitrary metric space without sequences, which he designed to avoid countable choice. The completion of a separable metric space turns out to be a set even if the original space is a proper class: in particular, every complete separable metric space automatically is a set.


2017 ◽  
Vol 10 (4) ◽  
pp. 651-662 ◽  
Author(s):  
SAM ROBERTS

AbstractThis article introduces a new reflection principle. It is based on the idea that whatever is true in all entities of some kind is also true in a set-sized collection of them. Unlike standard reflection principles, it does not re-interpret parameters or predicates. This allows it to be both consistent in all higher-order languages and remarkably strong. For example, I show that in the language of second-order set theory with predicates for a satisfaction relation, it is consistent relative to the existence of a 2-extendible cardinal (Theorem 7.12) and implies the existence of a proper class of 1-extendible cardinals (Theorem 7.9).


1985 ◽  
Vol 50 (4) ◽  
pp. 1002-1019 ◽  
Author(s):  
Sy D. Friedman

In the wake of Silver's breakthrough on the Singular Cardinals Problem (Silver [74]) followed one of the landmark results in set theory, Jensen's Covering Lemma (Devlin-Jensen [74]): If 0# does not exist then for every uncountable x ⊆ ORD there exists a constructible Y ⊇ X, card(Y) = card(X). Thus it is fair to say that in the absence of large cardinals, V is “close to L”.It is natural to ask, as did Solovay, if we can fairly interpret the phrase “close to L” to mean “generic over L”. For example, if V = L[a], a ⊆ ω and if 0# does not exist then is V-generic over L for some partial ordering ∈ L? Notice that an affirmative answer implies that in the absence of 0#, no real can “code” a proper class of information.Jensen's Coding Theorem provides a negative answer to Solovay's question, in a striking way: Any class can be “coded” by a real without introducing 0#. More precisely, if A ⊆ ORD then there is a forcing definable over 〈L[A], A〉 such that ⊩ V = L[a], a ⊆ ω, A is definable from a. Moreover if 0# ∉ L[A] then ⊩ 0# does not exist. Now as any M ⊨ ZFC can be generically extended to a model of the form L[A] (without introducing 0#) we obtain: For any 〈M, A〉 ⊨ ZFC (that is, M ⊨ ZFC and M obeys Replacement for formulas mentioning A as a predicate) there is an 〈M, A〉-definable forcing such that ⊩ V = L[a], a ⊆ ω, 〈M, A〉 is definable from a. Moreover if 0# ∉ M then ⊩ 0# does not exist.


1976 ◽  
Vol 32 ◽  
pp. 109-116 ◽  
Author(s):  
S. Vauclair

This paper gives the first results of a work in progress, in collaboration with G. Michaud and G. Vauclair. It is a first attempt to compute the effects of meridional circulation and turbulence on diffusion processes in stellar envelopes. Computations have been made for a 2 Mʘstar, which lies in the Am - δ Scuti region of the HR diagram.Let us recall that in Am stars diffusion cannot occur between the two outer convection zones, contrary to what was assumed by Watson (1970, 1971) and Smith (1971), since they are linked by overshooting (Latour, 1972; Toomre et al., 1975). But diffusion may occur at the bottom of the second convection zone. According to Vauclair et al. (1974), the second convection zone, due to He II ionization, disappears after a time equal to the helium diffusion time, and then diffusion may happen at the bottom of the first convection zone, so that the arguments by Watson and Smith are preserved.


2007 ◽  
Vol 38 (3) ◽  
pp. 1-92
Author(s):  
CHRISTINE KILGORE
Keyword(s):  

2007 ◽  
Vol 40 (7) ◽  
pp. 16-17
Author(s):  
CHRISTINE KILGORE
Keyword(s):  

Author(s):  
Ernest Schimmerling
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document