Modal logic provides an elegant way to understand the notion of potential infinity. This raises the question of what the right modal logic is for reasoning about potential infinity. In this article I identify a choice point in determining the right modal logic: Can a potentially infinite collection ever be expanded in two mutually incompatible ways? If not, then the possible expansions are convergent; if so, then the possible expansions are branching. When possible expansions are convergent, the right modal logic (...) is S4.2, and a mirroring theorem due to Linnebo allows for a natural potentialist interpretation of mathematical discourse. When the possible expansions are branching, the right modal logic is S4. However, the usual box and diamond do not suffice to express everything the potentialist wants to express. I argue that the potentialist also needs an operator expressing that something will eventually happen in every possible expansion. I prove that the result of adding this operator to S4 makes the set of validities Pi-1-1 hard. This result makes it unlikely that there is any natural translation of ordinary mathematical discourse into the potentialist framework in the context of branching possibilities. (shrink)

Ignacio Jane has argued that second-order logic presupposes some amount of set theory and hence cannot legitimately be used in axiomatizing set theory. I focus here on his claim that the second-order formulation of the Axiom of Separation presupposes the character of the power set operation, thereby preventing a thorough study of the power set of infinite sets, a central part of set theory. In reply I argue that substantive issues often cannot be separated from a logic, but rather must (...) be presupposed. I call this the logic-metalogic link. There are two facets to the logic-metalogic link. First, when a logic is entangled with a substantive issue, the same position on that issue should be taken at the meta- level as at the object level; and second, if an expression has a clear meaning in natural language, then the corresponding concept can equally well be deployed in a formal language. The determinate nature of the power set operation is one such substantive issue in set theory. Whether there is a determinate power set of an infinite set can only be presupposed in set theory, not proved, so the use of second-order logic cannot be ruled out by virtue of presupposing one answer to this question. Moreover, the legitimacy of presupposing in the background logic that the power set of an infinite set is determinate is guaranteed by the clarity and definiteness of the notions of all and of subset. This is also exactly what is required for the same presupposition to be legitimately made in an axiomatic set theory, so the use of second-order logic in set theory rather than first-order logic does not require any new metatheoretic commitments. (shrink)

The problem of how mathematics and physics are related at a foundational level is of interest. The approach taken here is to work towards a coherent theory of physics and mathematics together by examining the theory experiment connection. The role of an implied theory hierarchy and use of computers in comparing theory and experiment is described. The main idea of the paper is to tighten the theory experiment connection by bringing physical theories, as mathematical structures over C, the complex numbers, (...) closer to what is actually done in experimental measurements and computations. The method replaces C by C n which is the set of pairs, R n,I n, of n figure rational numbers in some basis. The properties of these numbers are based on those of numerical measurement outcomes for continuous variables. A model of space and time based on R n is discussed. The model is scale invariant with regions of constant step size interrupted by exponential jumps. A method of taking the limit n→∞ to obtain locally flat continuum-based space and time is outlined. Also R n based space is invariant under scale transformations. These correspond to expansion and contraction of space relative to a flat background. The location of the origin, which is a space and time singularity, does not change under these transformations. Some properties of quantum mechanics, based on C n and on R n space are briefly investigated. (shrink)

Often philosophers, logicians, and mathematicians employ a notion of intended structure when talking about a branch of mathematics. In addition, we know that there are foundational mathematical theories that can find representatives for the objects of informal mathematics. In this paper, we examine how faithfully foundational theories can represent intended structures, and show that this question is closely linked to the decidability of the theory of the intended structure. We argue that this sheds light on the trade-off between expressive power (...) and meta-theoretic properties when comparing first-order and second-order logic. (shrink)

A part of relativistic dynamics is axiomatized by simple and purely geometrical axioms formulated within first-order logic. A geometrical proof of the formula connecting relativistic and rest masses of bodies is presented, leading up to a geometric explanation of Einstein's famous E = mc² . The connection of our geometrical axioms and the usual axioms on the conservation of mass, momentum and four-momentum is also investigated.

In this paper, I present a class of ‘structural’ abstraction principles, and describe how they are suggested by some features of Cantor's and Dedekind's approach to abstraction. Structural abstraction is a promising source of mathematically tractable new axioms for the neo-logicist. I illustrate this by showing, first, how a theorem of Shelah gives a sufficient condition for consistency in the structural setting, solving what neo-logicists call the ‘bad company’ problem for structural abstraction. Second, I show how, in the structural setting, (...) we can measure the logical strength of abstraction principles using categories of interpretations between theories. (shrink)

We study the foundation of space-time theory in the framework of first-order logic (FOL). Since the foundation of mathematics has been successfully carried through (via set theory) in FOL, it is not entirely impossible to do the same for space-time theory (or relativity). First we recall a simple and streamlined FOL-axiomatization Specrel of special relativity from the literature. Specrel is complete with respect to questions about inertial motion. Then we ask ourselves whether we can prove the usual relativistic properties of (...) accelerated motion (e.g., clocks in acceleration) in Specrel. As it turns out, this is practically equivalent to asking whether Specrel is strong enough to “handle” (or treat) accelerated observers. We show that there is a mathematical principle called induction (IND) coming from real analysis which needs to be added to Specrel in order to handle situations involving relativistic acceleration. We present an extended version AccRel of Specrel which is strong enough to handle accelerated motion, in particular, accelerated observers. Among others, we show that~the Twin Paradox becomes provable in AccRel, but it is not provable without IND. (shrink)

Both second-order logic and set theory can be used as a foundation for mathematics, that is, as a formal language in which propositions of mathematics can be expressed and proved. We take it upon ourselves in this paper to compare the two approaches, second-order logic on one hand and set theory on the other hand, evaluating their merits and weaknesses. We argue that we should think of first-order set theory as a very high-order logic.

The aim of this paper is to provide a logic-based conceptual analysis of the twin paradox (TwP) theorem within a first-order logic framework. A geometrical characterization of TwP and its variants is given. It is shown that TwP is not logically equivalent to the assumption of the slowing down of moving clocks, and the lack of TwP is not logically equivalent to the Newtonian assumption of absolute time. The logical connection between TwP and a symmetry axiom of special relativity is (...) also studied. (shrink)

On the basis of what I call physico-formalist philosophy of mathematics, I will develop an amended account of the Kantian–Reichenbachian conception of constitutive a priori. It will be shown that the features attributed to a real object are not possessed by the object as a “thing-in-itself”; they require a physical theory by means of which these features are constituted. It will be seen that the existence of such a physical theory implies that a physical object can possess a property only (...) if other contingently existing physical objects exist; therefore, the intrinsic–extrinsic distinction is flawed. (shrink)

Using Carnap’s concept explication, we propose a theory of concept formation in mathematics. This theory is then applied to the problem of how to understand the relation between the concepts formal proof and informal, mathematical proof.

This article provides a survey of key papers that characterise computable functions, but also provides some novel insights as follows. It is argued that the power of algorithms is at least as strong as functions that can be proved to be totally computable in type-theoretic translations of subsystems of second-order Zermelo Fraenkel set theory. Moreover, it is claimed that typed systems of the lambda calculus give rise naturally to a functional interpretation of rich systems of types and to a hierarchy (...) of ordinal recursive functionals of arbitrary type that can be reduced by substitution to natural number functions. (shrink)

In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in P can feasibly work as computational (...) models of human cognitive capacities. One interesting area of computational complexity theory is descriptive complexity, which connects the expressive strength of systems of logic with the computational complexity classes. In descriptive complexity theory, it is established that only first-order systems are connected to P, or one of its subclasses. Consequently, second-order systems of logic are considered to be computationally intractable, and may therefore seem to be unfit to model human cognitive capacities. This would be problematic when we think of the role of logic as the foundations of mathematics. In order to express many important mathematical concepts and systematically prove theorems involving them, we need to have a system of logic stronger than classical first-order logic. But if such a system is considered to be intractable, it means that the logical foundation of mathematics can be prohibitively complex for human cognition. In this paper I will argue, however, that this problem is the result of an unjustified direct use of computational complexity classes in cognitive modelling. Placing my account in the recent literature on the topic, I argue that the problem can be solved by considering computational complexity for humanly relevant problem solving algorithms and input sizes. (shrink)

I present a reconstruction of the logical system of the Tractatus, which differs from classical logic in two ways. It includes an account of Wittgenstein’s “form-series” device, which suffices to express some effectively generated countably infinite disjunctions. And its attendant notion of structure is relativized to the fixed underlying universe of what is named. -/- There follow three results. First, the class of concepts definable in the system is closed under finitary induction. Second, if the universe of objects is countably (...) infinite, then the property of being a tautology is \Pi^1_1-complete. But third, it is only granted the assumption of countability that the class of tautologies is \Sigma_1-definable in set theory. -/- Wittgenstein famously urges that logical relationships must show themselves in the structure of signs. He also urges that the size of the universe cannot be prejudged. The results of this paper indicate that there is no single way in which logical relationships could be held to make themselves manifest in signs, which does not prejudge the number of objects. (shrink)

In so-called full second-order logic, the second-order variables range over all subsets and relations of the domain in question. In so-called Henkin second-order logic, every model is endowed with a set of subsets and relations which will serve as the range of the second-order variables. In our Boolean-valued second-order logic, the second-order variables range over all Boolean-valued subsets and relations on the domain. We show that under large cardinal assumptions Boolean-valued second-order logic is more robust than full second-order logic. Its (...) validity is absolute under forcing, and its Hanf and Löwenheim numbers are smaller than those of full second-order logic. (shrink)

The conservativeness argument poses a dilemma to deflationism about truth, according to which a deflationist theory of truth must be conservative but no adequate theory of truth is conservative. The debate on the conservativeness argument has so far been framed in a specific formal setting, where theories of truth are formulated over arithmetical base theories. I will argue that the appropriate formal setting for evaluating the conservativeness argument is provided not by theories of truth over arithmetic but by those over (...) subject matters ‘richer’ than arithmetic, such as set theory. The move to this new formal setting provides deflationists with better defence and brings a broader perspective to the debate. (shrink)

There is an extensive literature related to the algebraization of first‐order logic. But the algebraization of full second‐order logic, or Henkin‐type second‐order logic, has hardly been researched. The question arises: what kind of set algebra is the algebraic version of a Henkin‐type model of second‐order logic? The question is investigated within the framework of the theory of cylindric algebras. The answer is: a kind of cylindric‐relativized diagonal restricted set algebra. And the class of the subdirect products of these set algebras (...) is the algebraization of Henkin‐type second‐order logic. It is proved that the algebraization of a complete calculus of the Henkin‐type second‐order logic is a class of a kind of diagonal restricted cylindric algebras. Furthermore, the connection with the non‐standard enlargements of standard complete second‐order structures is investigated. (shrink)

Set theory deals with the most fundamental existence questions in mathematics—questions which affect other areas of mathematics, from the real numbers to structures of all kinds, but which are posed as dealing with the existence of sets. Especially noteworthy are principles establishing the existence of some infinite sets, the so-called “arbitrary sets.” This paper is devoted to an analysis of the motivating goal of studying arbitrary sets, usually referred to under the labels of quasi-combinatorialism or combinatorial maximality. After explaining what (...) is meant by definability and by “arbitrariness,” a first historical part discusses the strong motives why set theory was conceived as a theory of arbitrary sets, emphasizing connections with analysis and particularly with the continuum of real numbers. Judged from this perspective, the axiom of choice stands out as a most central and natural set-theoretic principle (in the sense of quasi-combinatorialism). A second part starts by considering the potential mismatch between the formal systems of mathematics and their motivating conceptions, and proceeds to offer an elementary discussion of how far the Zermelo—Fraenkel system goes in laying out principles that capture the idea of “arbitrary sets”. We argue that the theory is rather poor in this respect. (shrink)

On the basis of what I call physico-formalist philosophy of mathematics, I will develop an amended account of the Kantian–Reichenbachian conception of constitutive a priori. It will be shown that the features attributed to a real object are not possessed by the object as a “thing-in-itself”; they require a physical theory by means of which these features are constituted. It will be seen that the existence of such a physical theory implies that a physical object can possess a property only (...) if other contingently existing physical objects exist; therefore, the intrinsic–extrinsic distinction is flawed. (shrink)