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)

Stewart Shapiro’s ante rem structuralism recognizes the structural or ‘algebraic’ aspects of mathematical practice while still offering a face-value semantics. Fictionalism, as a purely ‘algebraic’ approach, is held to be at a disadvantage, as compared with Shapiro’s structuralism, in not interpreting mathematics at face value. However, the face-value reading of mathematical singular terms has difficulty explaining how we can use such terms to pick out a unique referent in cases where the relevant mathematical structures admit non-trivial automorphisms. Shapiro offers a (...) solution to this difficulty, but his solution, I argue, evens the score between Shapiro’s structuralism and fictionalism. (shrink)

The paper discusses Husserl’s notion of definiteness as presented in his Göttingen Mathematical Society Double Lecture of 1901 as a defense of two, in many cases incompatible, ideals, namely full characterizability of the domain, i.e., categoricity, and its syntactic completeness. These two ideals are manifest already in Husserl’s discussion of pure logic in the Prolegomena: The full characterizability is related to Husserl’s attempt to capture the interconnection of things, whereas syntactic completeness relates to the interconnection of truths. In the Prolegomena (...) Husserl argues that an ideally complete theory gives an independent norm for objectivity for logic and experiential sciences, hence the notion is central to his argument against psychologism. In the Double Lecture the former is captured by non-extendibility, that is, categoricity of the domain, from which, so Husserl assumes, syntactic completeness is thought to follow. In the so-called ‘mathematical manifolds’ the expressions of the theory are equations that are reducible to equations between elements of the theory. With such an equational reduction structure individual elements of the domain are given criteria of identity and hence they are fully determined. (shrink)

This paper is the second in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic semantics (...) so as to shed new light on the relevant strengths and limits of higher-order logic. (shrink)

In his Doppelvortrag, Edmund Husserl introduced two concepts of “definiteness” which have been interpreted as a vindication of his role in the history of completeness. Some commentators defended that the meaning of these notions should be understood as categoricity, while other scholars believed that it is closer to syntactic completeness. A detailed study of the early twentieth-century axiomatics and Husserl’s Doppelvortrag shows, however, that many concepts of completeness were conflated as equivalent. Although “absolute definiteness” was principally an attempt to characterize (...) non-extendible manifolds and axiom systems, an absolutely definite theory has a unique model and, thus, it is non-forkable and semantically complete. Non-forkability and decidability were formally delimited by Fraenkel and Carnap almost three decades later and, in fact, they mentioned Husserl as precursor of the latter. Therefore, this paper contributes to a reassessment of Husserl’s place in the history of logic. (shrink)

Our regimentation of Goodman and Myhill’s proof of Excluded Middle revealed among its premises a form of Choice and an instance of Separation.Here we revisit Zermelo’s requirement that the separating property be definite. The instance that Goodman and Myhill used is not constructively warranted. It is that principle, and not Choice alone, that precipitates Excluded Middle.Separation in various axiomatizations of constructive set theory is examined. We conclude that insufficient critical attention has been paid to how those forms of Separation fail, (...) in light of the Goodman–Myhill result, to capture a genuinely constructive notion of set. (shrink)

Defines and examines a notion of logical friendliness, a broadening of the familiar notion of classical consequence. Also reviews familiar notions and operations with which friendliness makes contact, providing a new light in which they may be seen.

This study examines how the Gödel phenomena are to be treated in core logic. We show in formal detail how one can use core logic in the metalanguage to prove Gödel’s incompleteness theorems for arithmetic even when classical logic is used for logical closure in the object language.

Husserl's two notions of "definiteness" enabled him to clarify the problem of imaginary numbers. The exact meaning of these notions is a topic of much controversy. A "definite" axiom system has been interpreted as a syntactically complete theory, and also as a categorical one. I discuss whether and how far these readings manage to capture Husserl's goal of elucidating the problem of imaginary numbers, raising objections to both positions. Then, I suggest an interpretation of "absolute definiteness" as semantic completeness and (...) argue that this notion does not suffice to explain Husserl's solution to the problem of imaginary numbers. (shrink)

It is often remarked that first-order Peano Arithmetic is non-categorical but deductively well-behaved, while second-order Peano Arithmetic is categorical but deductively ill-behaved. This suggests that, when it comes to axiomatizations of mathematical theories, expressive power and deductive power may be orthogonal, mutually exclusive desiderata. In this paper, I turn to Hintikka’s :69–90, 1989) distinction between descriptive and deductive approaches in the foundations of mathematics to discuss the implications of this observation for the first-order logic versus second-order logic divide. The descriptive (...) approach is illustrated by Dedekind’s ‘discovery’ of the need for second-order concepts to ensure categoricity in his axiomatization of arithmetic; the deductive approach is illustrated by Frege’s Begriffsschrift project. I argue that, rather than suggesting that any use of logic in the foundations of mathematics is doomed to failure given the impossibility of combining the descriptive approach with the deductive approach, what this apparent predicament in fact indicates is that the first-order versus second-order divide may be too crude to investigate what an adequate axiomatization of arithmetic should look like. I also conclude that, insofar as there are different, equally legitimate projects one may engage in when working on the foundations of mathematics, there is no such thing as the One True Logic for this purpose; different logical systems may be adequate for different projects. (shrink)