This paper examines the philosophical significance of the consequence relation defined in the $\Omega$-logic for set-theoretic languages. I argue that, as with second-order logic, the hyperintensional profile of validity in $\Omega$-Logic enables the property to be epistemically tractable. Because of the duality between coalgebras and algebras, Boolean-valued models of set theory can be interpreted as coalgebras. In Section \textbf{2}, I demonstrate how the hyperintensional profile of $\Omega$-logical validity can be countenanced within a coalgebraic logic. Finally, in Section \textbf{3}, the philosophical (...) significance of the characterization of the hyperintensional profile of $\Omega$-logical validity for the philosophy of mathematics is examined. I argue (i) that $\Omega$-logical validity is genuinely logical, and (ii) that it provides a hyperintensional account of formal grasp of the concept of `set'. Section \textbf{4} provides concluding remarks. (shrink)

This essay examines the philosophical significance of $\Omega$-logic in Zermelo-Fraenkel set theory with choice (ZFC). The categorical duality between coalgebra and algebra permits Boolean-valued algebraic models of ZFC to be interpreted as coalgebras. The hyperintensional profile of $\Omega$-logical validity can then be countenanced within a coalgebraic logic. I argue that the philosophical significance of the foregoing is two-fold. First, because the epistemic and modal and hyperintensional profiles of $\Omega$-logical validity correspond to those of second-order logical consequence, $\Omega$-logical validity is genuinely (...) logical. Second, the foregoing provides a hyperintensional account of the interpretation of mathematical and metamathematical vocabulary. (shrink)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

This dissertation concerns the foundations of epistemic modality. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The dissertation demonstrates how phenomenal consciousness and gradational possible-worlds models in Bayesian perceptual psychology relate to epistemic modal space. The dissertation demonstrates, then, how epistemic modality relates to the computational theory of mind; metaphysical modality; deontic modality; logical modality; the types of mathematical modality; to the (...) epistemic status of undecidable propositions and abstraction principles in the philosophy of mathematics; to the apriori-aposteriori distinction; to the modal profile of rational propositional intuition; and to the types of intention, when the latter is interpreted as a modal mental state. Examining the nature of epistemic logic itself, I develop a novel approach to conditions of self-knowledge in the setting of the modal μ-calculus, as well as novel epistemicist solutions to Curry's, the liar, and the knowability paradoxes. Solutions to previously intransigent issues concerning the first-person concept; the distinction between fundamental and derivative truths; and the unity of intention and its role in decision theory, are developed along the way. (shrink)

Putnam’s model-theoretic arguments for the indeterminacy of reference have been taken to pose a special problem for mathematical languages. In this paper, I argue that if one accepts that there are theory-external constraints on the reference of at least some expressions of ordinary language, then Putnam’s model-theoretic arguments for mathematical languages don’t go through. In particular, I argue for a kind of descriptivism about mathematical expressions according to which their reference is “anchored” in the reference of expressions of ordinary language. (...) These anchors add enough to the content of mathematical expressions to forestall the radical kind of indeterminacy that model-theoretic arguments are purported to show, while still leaving room for a plausible, moderate kind of indeterminacy. (shrink)

The purpose of this article is to explore the extent to which mathematics is subject to open texture and the extent to which mathematics resists open texture. The resistance is tied to the importance of proof and, in particular, rigor, in mathematics.

In this paper I discuss Ernst Zermelo’s ideas concerning the possibility of developing a system of infinitary logic that, in his opinion, should be suitable for mathematical inferences. The presentation of Zermelo’s ideas is accompanied with some remarks concerning the development of infinitary logic. I also stress the fact that the second axiomatization of set theory provided by Zermelo in 1930 involved the use of extremal axioms of a very specific sort.1.

Stephen Yablo [23,24] introduces a new informal paradox, constituted by an infinite list of semi-formalized sentences. It has been shown that, formalized in a first-order language, Yablo’s piece of reasoning is invalid, for it is impossible to derive falsum from the sequence, due mainly to the Compactness Theorem. This result casts doubts on the paradoxical character of the list of sentences. After identifying two usual senses in which an expression or set of expressions is said to be paradoxical, since second-order (...) languages are not compact, I study the paradoxicality of Yablo’s list within these languages. While non-paradoxical in the first sense, the second-order version of the list is a paradox in our second sense. I conclude that this suffices for regarding Yablo’s original list as paradoxical and his informal argument as valid. (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 “Models and Reality”, H. Putnam formulated his model-theoretic argument against “metaphysical realism”. The article proposes a meta-reconstruction of Putnam’s model-theoretic argument in the light of two mutually compatible interpretations of it–elaborated by Manuel Garcia-Carpintero and Igor van Douven. A critical reflection on these interpretations and their adequacy for Putnam’s argument allows us to expose new theses coherent with Putnam’s reasoning and indicate new paths to improve this argument for our reconstruction task. In particular, we show that Putnam’s position may (...) be coherent with van Douven’s versions of Global Descriptivism under some conditions, but Putnam cannot reject realism as quickly as Carpintero suggests. We show that Suszko’s canonic axiomatic system and Sneed’s concept of theory may provide valuable support for Putnam’s argument. Finally, we critically evaluate Carpintero’s theses about the genesis of unintended interpretations of our languages, adopting the machinery of the Upward Skolem–Loewenheim Theorem and Knight’s Theorem. (shrink)

In this paper an attempt is made to present Skolem's argument, for the relativity of some set-theoretical notions as a sensible one. Skolem's critique of set theory is seen as part of a larger argument to the effect that no conclusive evidence has been given for the existence of uncountable sets. Some replies to Skolem are discussed and are shown not to affect Skolem's position, since they all presuppose the existence of uncountable sets. The paper ends with an assessment of (...) the assumptions on which Skolem's argument rests from a present-day perspective. (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.

I discuss Skolem's own ideas on his ‘paradox’, some classical disputes between Skolemites and Antiskolemites, and the underlying notion of ‘informal mathematics’, from a point of view which I hope to be rather unusual. I argue that the Skolemite cannot maintain that from an absolute point of view everything is in fact denumerable; on the other hand, the Antiskolemite is left with the onus of explaining the notion of informal mathematical knowledge of the intended model of set theory. 1 conclude (...) that one must take seriously the embodiment of the uncountable into countable languages, as a symptom of some specific features which characterize mathematical languages with respect to other languages. (shrink)

I make an attempt at the description of the delicate role of the standard model of arithmetic for the syntax of formal systems. I try to assess whether the possible instability in the notion of finiteness deriving from the nonstandard interpretability of arithmetic affects the very notions of syntactic metatheory and of formal system. I maintain that the crucial point of the whole question lies in the evaluation of the phenomenon of formalization. The ideas of Skolem, Zermelo, Beth and Carnap (...) (among others) on the problem are discussed. ‘A tries to explain to B the meaning of negation. Finally A gives up, saying: “You don’t understand what I mean, and I am not going to explain any longer,” to which B replies: “Yes, I see what you mean, and I am glad you are willing to continue your explanations”’. G. Mannoury, reported by E. W. Beth (Beth, 1963, 489). (shrink)

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.

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)

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)

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