Over the years, Skolem’s Paradox has generated a fairly steady stream of philosophical discussion; nonetheless, the overwhelming consensus among philosophers and logicians is that the paradox doesn’t constitute a mathematical problem (i.e., it doesn’t constitute a real contradiction). Further, there’s general agreement as to why the paradox doesn’t constitute a mathematical problem. By looking at the way firstorder structures interpret quantifiers—and, in particular, by looking at how this interpretation changes as we move from structure to structure—we can give a technically (...) adequate “solution” to Skolem’s Paradox. So, whatever the philosophical upshot of Skolem’s Paradox may be, the mathematical side of Skolem’s Paradox seems to be relatively straightforward. (shrink)

According to the semantic view, a theory is characterized by a class of models. In this paper, we examine critically some of the assumptions that underlie this approach. First, we recall that models are models of something. Thus we cannot leave completely aside the axiomatization of the theories under consideration, nor can we ignore the metamathematics used to elaborate these models, for changes in the metamathematics often impose restrictions on the resulting models. Second, based on a parallel between van Fraassen’s (...) modal interpretation of quantum mechanics and Skolem’s relativism regarding set-theoretic concepts, we introduce a distinction between relative and absolute concepts in the context of the models of a scientific theory. And we discuss the significance of that distinction. Finally, by focusing on contemporary particle physics, we raise the question: since there is no general accepted unification of the parts of the standard model (namely, QED and QCD), we have no theory, in the usual sense of the term. This poses a difficulty: if there is no theory, how can we speak of its models? What are the latter models of? We conclude by noting that it is unclear that the semantic view can be applied to contemporary physical theories. (shrink)

Graham Priest 2002 argues that all logical paradoxes that include set-theoretic paradoxes and semantic paradoxes share a common structure, the Inclosure Schema, so they should be treated as one family. Through a discussion of Berry's Paradox and the semantic notion ?definable?, I argue that (i) the Inclosure Schema is not fine-grained enough to capture the essential features of semantic paradoxes, and (ii) the traditional separation of the two groups of logical paradoxes should be retained.

Turing computation over a non-linguistic domain presupposes a notation for the domain. Accordingly, computability theory studies notations for various non-linguistic domains. It illuminates how different ways of representing a domain support different finite mechanical procedures over that domain. Formal definitions and theorems yield a principled classification of notations based upon their computational properties. To understand computability theory, we must recognize that representation is a key target of mathematical inquiry. We must also recognize that computability theory is an intensional enterprise: it (...) studies entities as represented in certain ways, rather than entities detached from any means of representing them. (shrink)

On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order PA and Zermelo’s quasi-categoricity (...) theorem for second-order ZFC—these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic. (shrink)

In this paper, elementary but hitherto overlooked connections are established between Wittgenstein's remarks on mathematics, written during his transitional period, and free-variable finitism. After giving a brief description of theTractatus Logico-Philosophicus on quantifiers and generality, I present in the first section Wittgenstein's rejection of quantification theory and his account of general arithmetical propositions, to use modern jargon, as claims (as opposed to statements). As in Skolem's primitive recursive arithmetic and Goodstein's equational calculus, Wittgenstein represented generality by the use of free (...) variables. This has the effect that negation of unbounded universal and existential propositions cannot be expressed. This is claimed in the second section to be the basis for Wittgenstein's criticism of the universal validity of the law of excluded middle. In the last section, there is a brief discussion of Wittgenstein's remarks on real numbers. These show a preference, in line with finitism, for a recursive version of the continuum. (shrink)

It is argued that mathematical statements are "a posteriori synthetic" statements of a very special sort, To be called "structure-Analytic" statements. They follow logically from the axioms defining the mathematical structure they are describing--Provided that these axioms are "consistent". Yet, Consistency of these axioms is an empirical claim: it may be "empirically verifiable" by existence of a finite model, Or may have the nature of an "empirically falsifiable hypothesis" that no contradiction can be derived from the axioms.

Discussion of new axioms for set theory has often focused on conceptions of maximality, and how these might relate to the iterative conception of set. This paper provides critical appraisal of how certain maximality axioms behave on different conceptions of ontology concerning the iterative conception. In particular, we argue that forms of multiversism (the view that any universe of a certain kind can be extended) and actualism (the view that there are universes that cannot be extended in particular ways) face (...) complementary problems. The latter view is unable to use maximality axioms that make use of extensions, where the former has to contend with the existence of extensions violating maximality axioms. An analysis of two kinds of multiversism, a Zermelian form and Skolemite form, leads to the conclusion that the kind of maximality captured by an axiom differs substantially according to background ontology. (shrink)

According to the iterative conception of set, each set is a collection of sets formed prior to it. The notion of priority here plays an essential role in explanations of why contradiction-inducing sets, such as the Russell set, do not exist. Consequently, these explanations are successful only to the extent that a satisfactory priority relation is made out. I argue that attempts to do this have fallen short: understanding priority in a straightforwardly constructivist sense threatens the coherence of the empty (...) set and raises serious epistemological concerns; but the leading realist interpretations---ontological and modal interpretations of priority---are deeply problematic as well. I conclude that the purported explanatory virtues of the iterative conception are, at present, unfounded. (shrink)

Two of Hilary Putnam's model-theoretic arguments against metaphysical realism are examined in detail. One of them is developed as an extension of a model-theoretic argument against mathematical realism based on considerations concerning the so-called Skolem-Paradox in set theory. This argument against mathematical realism is also treated explicitly. The article concentrates on the fine structure of the arguments because most commentators have concentrated on the major premisses of Putnam's argument and especially on his treatment of metaphysical realism. It is shown that (...) the validity of Putnam's arguments is doubtful and that realists are by no means forced to accept the theses Putnam ascribes to them. It is concluded that Putnam fails to give convincing arguments for rejecting mathematical or metaphysical realism. Furthermore, Putnam's internal realism is discussed critically. (shrink)

Putnam famously attempted to use model theory to draw metaphysical conclusions. His Skolemisation argument sought to show metaphysical realists that their favourite theories have countable models. His permutation argument sought to show that they have permuted models. His constructivisation argument sought to show that any empirical evidence is compatible with the Axiom of Constructibility. Here, I examine the metamathematics of all three model-theoretic arguments, and I argue against Bays (2001, 2007) that Putnam is largely immune to metamathematical challenges.

The property of being the implementation of a computational structure has been argued to be vacuously instantiated. This claim provides the basis for most antirealist arguments in the field of the philosophy of computation. Standard manoeuvres for combating these antirealist arguments treat the problem as endogenous to computational theories. The contrastive analysis of computational and other mathematical representations put forward here reveals that the problem should instead be treated within the more general framework of the Newman problem in structuralist accounts (...) of mathematical representation. It is argued that purely structuralist and purely functionalist accounts of implementation are inadequate to tackle the problem. An extensive evaluation of semantic accounts is provided, arguing that semantic properties are, unlike structural and functional ones, suitable to restrict the intended domain of implementation of computational properties in such a way as to block the Newman problem. The semantic hypothesis is defended from a number of recent objections. (shrink)

In this paper (a sequel to [4]) I put forward a "local" interpretation of mathematical concepts based on notions derived from category theory. The fundamental idea is to abandon the unique absolute universe of sets central to the orthodox set-theoretic account of the foundations of mathematics, replacing it by a plurality of local mathematical frameworks - elementary toposes - defined in category-theoretic terms.

This paper concerns Tarski’s use of the term “model” in his 1936 paper “On the Concept of Logical Consequence.” Against several of Tarski’s recent defenders, I argue that Tarski employed a non-standard conception of models in that paper. Against Tarski’s detractors, I argue that this non-standard conception is more philosophically plausible than it may appear. Finally, I make a few comments concerning the traditionally puzzling case of Tarski’s ω-rule example.

This paper is a step toward showing what is achievable using non-classical metatheory—particularly, a substructural paraconsistent framework. What standard results, or analogues thereof, from the classical metatheory of first order logic can be obtained? We reconstruct some of the originals proofs for Completeness, Löwenheim-Skolem and Compactness theorems in the context of a substructural logic with the naive comprehension schema. The main result is that paraconsistent metatheory can ‘re-capture’ versions of standard theorems, given suitable restrictions and background assumptions; but the shift (...) to non-classical logic may recast the meanings of these apparently ‘absolute’ theorems. (shrink)

In this paper we study the axiomatic system proposed by Bourbaki for the Theory of Sets in the Éléments de Mathématique. We begin by examining the role played by the sign \(\uptau \) in the framework of its formal logical theory and then we show that the system of axioms for set theory is equivalent to Zermelo–Fraenkel system with the axiom of choice but without the axiom of foundation. Moreover, we study Grothendieck’s proposal of adding to Bourbaki’s system the axiom (...) of universes for the purpose of considering the theory of categories. In this regard, we make some historical and epistemological remarks that could explain the conservative attitude of the Group. (shrink)

This study looks to the work of Tarski's mentors Stanislaw Lesniewski and Tadeusz Kotarbinski, and reconsiders all of the major issues in Tarski scholarship in light of the conception of Intuitionistic Formalism developed: semantics, truth, paradox, logical consequence.

I argue that absolutism, the view that absolutely unrestricted quantification is possible, is to blame for both the paradoxes that arise in naive set theory and variants of these paradoxes that arise in plural logic and in semantics. The solution is restrictivism, the view that absolutely unrestricted quantification is not possible. -/- It is generally thought that absolutism is true and that restrictivism is not only false, but inexpressible. As a result, the paradoxes are blamed, not on illicit quantification, but (...) on the logical conception of set which motivates naive set theory. The accepted solution is to replace this with the iterative conception of set. -/- I show that this picture is doubly mistaken. After a close examination of the paradoxes in chapters 2--3, I argue in chapters 4 and 5 that it is possible to rescue naive set theory by restricting quantification over sets and that the resulting restrictivist set theory is expressible. In chapters 6 and 7, I argue that it is the iterative conception of set and the thesis of absolutism that should be rejected. (shrink)

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...) The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (shrink)

What is the source of logical and mathematical truth? This book revitalizes conventionalism as an answer to this question. Conventionalism takes logical and mathematical truth to have their source in linguistic conventions. This was an extremely popular view in the early 20th century, but it was never worked out in detail and is now almost universally rejected in mainstream philosophical circles. Shadows of Syntax is the first book-length treatment and defense of a combined conventionalist theory of logic and mathematics. It (...) argues that our conventions, in the form of syntactic rules of language use, are perfectly suited to explain the truth, necessity, and a priority of logical and mathematical claims, as well as our logical and mathematical knowledge. (shrink)

Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer might (...) implement the idea of "infinite calculation" is the main subject. (shrink)

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...) The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (shrink)

Prolegomena It is fitting to begin this book on intuitionistic type theory by putting the subject matter into perspective. The purpose of this chapter is to ...

Added by a category editor--not an official abstract. -/- Discusses the history (and reasons for the history) implicit in the title, as well as the author's view on same.

We show how removing faith-based beliefs in current philosophies of classical and constructive mathematics admits formal, evidence-based, definitions of constructive mathematics; of a constructively well-defined logic of a formal mathematical language; and of a constructively well-defined model of such a language. -/- We argue that, from an evidence-based perspective, classical approaches which follow Hilbert's formal definitions of quantification can be labelled `theistic'; whilst constructive approaches based on Brouwer's philosophy of Intuitionism can be labelled `atheistic'. -/- We then adopt what may (...) be labelled a finitary, evidence-based, `agnostic' perspective and argue that Brouwerian atheism is merely a restricted perspective within the finitary agnostic perspective, whilst Hilbertian theism contradicts the finitary agnostic perspective. -/- We then consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary, evidence-based, definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways. -/- We show that the two definitions correspond to two distinctly different---not necessarily evidence-based but complementary---assignments of satisfaction and truth to the compound formulas of PA over N. -/- We further show that the PA axioms are true over N, and that the PA rules of inference preserve truth over N, under both the complementary interpretations; and conclude some unsuspected constructive consequences of such complementarity for the foundations of mathematics, logic, philosophy, and the physical sciences. -/- . (shrink)

A new form of skepticism is described, which holds that objectivity and understanding are incompossible ideals of modern science. This is attributed to Weyl, hence its name: Weylean skepticism. Two general defeat strategies are then proposed, one of which is rejected.

Ontology played a very large role in Quine’s philosophy and was one of his major preoccupations from the early 30’s to the end of his life. His work on ontology provided a basic framework for most of the discussions of ontology in analytic philosophy in the second half of the Twentieth Century. There are three main themes (and several sub-themes) that Quine developed in his work. The first is ontological commitment: What are the existential commitments of a theory? The second (...) is ontological reduction: How can an ontology be reduced to (or substituted by) another? And what is the most economical ontology that can be obtained for certain given purposes? The third is criteria of identity: When are entities of some kind (sets, properties, material objects, propositions, meanings, etc.) the same or different? In this paper I discuss Quine’s development of these three themes and some of the problems that were aised in connection with his work. (shrink)

ریاضیدانان هرروز با مجموعههای ناشمارا، مجموعهی توانی، خوشترتیبی، تناهی و ... سروکار دارند و با این تصور که این مفاهیم همان چیزهایی هستند که در ذهن دارند، کتابها و اثباتهای ریاضی را میخوانند و میفهمند و درمورد آنها صحبت میکنند. اما آیا این مفاهیم همان چیزهایی هستند که ریاضیدانان تصور میکنند؟ اولینبار اسکولم با بیان یک پارادوکس شک خود را به این موضوع ابراز کرد. بنابر قضیهی لوونهایم اسکولم رو به پایین، نظریه مجموعهها مدلی شمارا دارد. این مدل قضیهی کانتور (...) را که بیان میکند مجموعهای ناشمارا وجود دارد برآورده میکند؛ ولی مدل شمارا دارای دامنهای شامل شمارا عضو است. پس برای بیان وجود مجموعهای ناشمارا مانند ℝ تنها شمارا عضو داریم. این جمالت به پارادوکس اسکولم مشهور شدند. بنابرین مجموعهی ناشمارایمان در واقع شمارا بهنظر میرسد. از زمانی که پارادوکس فهمیده شد تا به امروز بحث های زیادی در رد و تایید آن بوده است. گروهی تا آنجا پیش رفتند که ادعا کردند همهی مجموعهها شمارا هستند. در این پایان نامه پرسش های مقابل بررسی شدهاند: آیا مجموعههای ناشمارا واقعا وجود دارند؟ آیا پارادوکس اسکولم نشان میدهد که نظریههای مرتبه دوم برای مدل کردن کاربرد ریاضیات مناسبتر هستند؟ پارادوکس اسکولم درمورد درک ما از نظریه مجموعهها و سمانتیک آن چه نتیجهای دارد؟ خواهیم دید بهتر است درمورد وجود مجموعههای ناشمارا، موضع الادری را برگزینیم، پارادوکس اسکولم نتیجه نمیدهد نظریههای مرتبه دوم برای مدل کردن کاربرد ریاضیات مناسب هستند و درمورد درک ما از نظریه مجموعهها نتیجهای نخواهد داشت. (shrink)

Conventional wisdom dictates that proofs of mathematical propositions should be treated as necessary, and sufficient, for entailing `significant' mathematical truths only if the proofs are expressed in a---minimally, deemed consistent---formal mathematical theory in terms of: * Axioms/Axiom schemas * Rules of Deduction * Definitions * Lemmas * Theorems * Corollaries. Whilst Andrew Wiles' proof of Fermat's Last Theorem FLT, which appeals essentially to geometrical properties of real and complex numbers, can be treated as meeting this criteria, it nevertheless leaves two (...) questions unanswered: (i) Why is x^n +y^n = z^n solvable only for n < 3 if x, y, z, n are natural numbers? (ii) What technique might Fermat have used that led him to, even if only briefly, believe he had `a truly marvellous demonstration' of FLT? Prevailing post-Wiles wisdom---leaving (i) essentially unaddressed---dismisses Fermat's claim as a conjecture without a plausible proof of FLT. -/- However, we posit that providing evidence-based answers to both queries is necessary not only for treating FLT as significant, but also for understanding why FLT can be treated as a true arithmetical proposition. We thus argue that proving a theorem formally from explicit, and implicit, premises/axioms using rules of deduction---as currently accepted---is a meaningless game, of little scientific value, in the absence of evidence that has already established---unambiguously---why the premises/axioms and rules of deduction can be treated, and categorically communicated, as pre-formal truths in Marcus Pantsar's sense. Consequently, only evidence-based, pre-formal, truth can entail formal provability; and the formal proof of any significant mathematical theorem cannot entail its pre-formal truth as evidence-based. It can only identify the explicit/implicit premises that have been used to evidence the, already established, pre-formal truth of a mathematical proposition. Hence visualising and understanding the evidence-based, pre-formal, truth of a mathematical proposition is the only raison d'etre for subsequently seeking a formal proof of the proposition within a formal mathematical language (whether first-order or second order set theory, arithmetic, geometry, etc.) By this yardstick Andrew Wiles' proof of FLT fails to meet the required, evidence-based, criteria for entailing a true arithmetical proposition. -/- Moreover, we offer two scenarios as to why/how Fermat could have laconically concluded in his recorded marginal noting that FLT is a true arithmetical proposition---even though he either did not (or could not to his own satisfaction) succeed in cogently evidencing, and recording, why FLT can be treated as an evidence-based, pre-formal, arithmetical truth (presumably without appeal to properties of real and complex numbers). It is primarily such a putative, unrecorded, evidence-based reasoning underlying Fermat's laconic assertion which this investigation seeks to reconstruct; and to justify by appeal to a plausible resolution of some philosophical ambiguities concerning the relation between evidence-based, pre-formal, truth and formal provability. (shrink)

It is commonly held that the natural numbers sequence 0, 1, 2,... possesses a unique structure. Yet by a well known model theoretic argument, there exist non-standard models of the formal theory which is generally taken to axiomatize all of our practices and intentions pertaining to use of the term “natural number.” Despite the structural similarity of this argument to the influential set theoretic indeterminacy argument based on the downward L ̈owenheim-Skolem theorem, most theorists agree that the number theoretic version (...) does not have skeptical consequences about the reference of “natural number” analogous to the ‘relativity’ Skolem claimed pertains to notions such as “uncountable” and “cardinal.” In this paper I argue that recent proposals by Shapiro, Lavine, McGee and Field which aim to distinguish the number and set theoretic indeterminacy arguments by locating extra-mathematical constraints on the interpretation of our number theoretic vocabulary are inadequate. I then suggest that if we consider the manner in which the natural numbers figure in our computational practices – e.g. in characterizing how we compute sums and products or determine prime factorizations – it follows that our application of computational terms such as “computable function” and “tractable computational problem” indirectly uniquely determines their structure. (shrink)

Some of the forerunners of quantum theory regarded the basic entities of such theories as 'non-individuals'. One of the problems is to treat collections of such 'things', for they do not obey the axioms of standard set theories like Zermelo- Fraenkel. In this paper, collections of objects to which the standard concept of identity does not apply are termed 'quasi-sets'. The motivation for such a theory, linked to what we call 'the Manin problem', is presented, so as its specific axioms. (...) At the end, it is shown how quantum statistics can be obtained within quasi-set thbeory. (shrink)