Smooth Infinitesimals in the Metaphysical Foundation of Spacetime Theories

I propose a theory of space with infinitesimal regions called \textit{smooth infinitesimal geometry} (SIG) based on certain algebraic objects (i.e., rings), which regiments a mode of reasoning heuristically used by geometricists and physicists (e.g., circle is composed of infinitely many straight lines). I argue that SIG has the following utilities. (1) It provides a simple metaphysics of vector fields and tangent space that are otherwise perplexing. A tangent space can be considered an infinitesimal region of space. (2) It generalizes a standard implementation of spacetime algebraicism (according to which physical fields exist fundamentally without an underlying manifold) called \textit{Einstein algebras}. (3) It solves the long-standing problem of interpreting \textit{smooth infinitesimal analysis} (SIA) realistically, an alternative foundation of spacetime theories to real analysis (Lawvere 1980). SIA is formulated in intuitionistic logic and is thought to have no classical reformulations (Hellman 2006). Against this, I argue that SIG is (part of) such a reformulation. But SIG has an unorthodox mereology, in which the principle of supplementation fails

The Structure of Gunk: Adventures in the Ontology of Space

Could space consist entirely of extended regions, without any regions shaped like points, lines, or surfaces? Peter Forrest and Frank Arntzenius have independently raised a paradox of size for space like this, drawing on a construction of Cantor’s. I present a new version of this argument and explore possible lines of response

Mereology then and now

This paper offers a critical reconstruction of the motivations that led to the development of mereology as we know it today, along with a brief description of some questions that define current research in the field

Intuitionistic Mereology

Two mereological theories are presented based on a primitive apartness relation along with binary relations of mereological excess and weak excess, respectively. It is shown that both theories are acceptable from the standpoint of constructive reasoning while remaining faithful to the spirit of classical mereology. The two theories are then compared and assessed with regard to their extensional import

Is Weak Supplementation analytic?

The research and writing of this paper was supported in part by a 2017-2018 Leverhulme Research Fellowship from the Leverhulme Trust.Mereological principles are often controversial; perhaps the most stark contrast is between those who claim that Weak Supplementation is analytic—constitutive of our notion of proper parthood—and those who argue that the principle is simply false, and subject to many counterexamples. The aim of this paper is to diagnose the source of this dispute. I’ll suggest that the dispute has arisen by participants failing to be sensitive to two different conceptions of proper parthood: the outstripping conception and the non-identity conception. I’ll argue that the outstripping conception (together with a specific set of definitions for other mereological notions), can deliver the analyticity of Weak Supplementation on at least one sense of ‘analyticity’. I’ll also suggest that the non-identity conception cannot do so independently of considerations to do with mereological extensionality.Publisher PDFPeer reviewe

Boundary Algebra: A Simple Notation for Boolean Algebra and the Truth Functors

Boundary algebra [BA] is a simpler notation for Spencer-Brown’s (1969) primary algebra [pa], the Boolean algebra 2, and the truth functors. The primary arithmetic [PA] consists of the atoms ‘()’ and the blank page, concatenation, and enclosure between ‘(‘ and ‘)’, denoting the primitive notion of distinction. Inserting letters denoting the presence or absence of () into a PA formula yields a BA formula. The BA axioms are "()()=()" (A1), and "(()) [=?] may be written or erased at will” (A2). Repeated application of these axioms to a PA formula yields a member of B= {(),?} called its simplification. (a) has two intended interpretations: (a) ? a? (Boolean algebra 2), and (a) ? ~a (sentential logic). BA is self-dual: () ? 1 [dually 0] so that B is the carrier for 2, ab ? a?b [a?b], and (a)b [(a(b))] ? a=b, so that ?=() [()=?] follows trivially and B is a poset. The BA basis abc= bca (Dilworth 1938), a(ab)= a(b), and a()=() (Bricken 2002) facilitates clausal reasoning and proof by calculation. BA also simplifies normal forms and Quine’s (1982) truth value analysis. () ? true [false] yields boundary logic.G. Spencer Brown; boundary algebra; boundary logic; primary algebra; primary arithmetic; Boolean algebra; calculation proof; C.S. Peirce; existential graphs.

Boundary Algebra: A Simpler Approach to Boolean Algebra and the Sentential Connectives

Boundary algebra [BA] is a algebra of type , and a simplified notation for Spencer-Brown’s (1969) primary algebra. The syntax of the primary arithmetic [PA] consists of two atoms, () and the blank page, concatenation, and enclosure between ‘(‘ and ‘)’, denoting the primitive notion of distinction. Inserting letters denoting, indifferently, the presence or absence of () into a PA formula yields a BA formula. The BA axioms are A1: ()()= (), and A2: “(()) [abbreviated ‘⊥’] may be written or erased at will,” implying (⊥)=(). The repeated application of A1 and A2 simplifies any PA formula to either () or ⊥. The basis for BA is B1: abc=bca (concatenation commutes & associates); B2, ⊥a=a (BA has a lower bound, ⊥); B3, (a)a=() (BA is a complemented lattice); and B4, (ba)a=(b)a (implies that BA is a distributive lattice). BA has two intended models: (1) the Boolean algebra 2 with base set B={(),⊥}, such that () ⇔ 1 [dually 0], (a) ⇔ a′, and ab ⇔ a∪b [a∩b]; and (2) sentential logic, such that () ⇔ true [false], (a) ⇔ ~a, and ab ⇔ a∨b [a∧b]. BA is a self-dual notation, facilitates a calculational style of proof, and simplifies clausal reasoning and Quine’s truth value analysis. BA resembles C.S. Peirce’s graphical logic, the symbolic logics of Leibniz and W.E. Johnson, the 2 notation of Byrne (1946), and the Boolean term schemata of Quine (1982).Boundary algebra; boundary logic; primary algebra; primary arithmetic; Boolean algebra; calculation proof; G. Spencer-Brown; C.S. Peirce; existential graphs