We provide a framework for understanding agnosticism. The framework accounts for the varieties of agnosticism while vindicating the unity of the phenomenon. This combination of unity and plurality is achieved by taking the varieties of agnosticism to be represented by several agnostic stances, all of which share a common core provided by what we call the minimal agnostic attitude. We illustrate the fruitfulness of the framework by showing how it can be applied to several philosophical debates. In particular, several philosophical (...) positions can be aptly conceived of as instances of agnosticism whilst retaining their differences and distinguishing features. (shrink)

We present an inferentialist account of the epistemic modal operator might. Our starting point is the bilateralist programme. A bilateralist explains the operator not in terms of the speech act of rejection ; we explain the operator might in terms of weak assertion, a speech act whose existence we argue for on the basis of linguistic evidence. We show that our account of might provides a solution to certain well-known puzzles about the semantics of modal vocabulary whilst retaining classical logic. (...) This demonstrates that an inferentialist approach to meaning can be successfully extended beyond the core logical constants. (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 and Zermelo’s quasi-categoricity theorem (...) for second-order —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)

I identify two reasons for believing in the objectivity of mathematical knowledge: apparent objectivity and applications in science. Focusing on arithmetic, I analyze platonism and cognitive nativism in terms of explaining these two reasons. After establishing that both theories run into difficulties, I present an alternative epistemological account that combines the theoretical frameworks of enculturation and cumulative cultural evolution. I show that this account can explain why arithmetical knowledge appears to be objective and has scientific applications. Finally, I will argue (...) that, while this account is compatible with platonist metaphysics, it does not require postulating mind-independent mathematical objects. (shrink)

Semantic dispositionalism is roughly the view that meaning a certain thing by a word, or possessing a certain concept, consists in being disposed to do something, e.g., infer a certain way. Its main problem is that it seems to have so many and disparate exceptions. People can fail to infer as required due to lack of logical acumen, intoxication, confusion, deviant theories, neural malfunctioning, and so on. I present a theory stating possession conditions of concepts that are counterfactuals, rather than (...) disposition attributions, but which is otherwise similar to inferentialist versions of dispositionalism. I argue that it can handle all the exceptions discussed in the literature without recourse to ceteris paribus clauses. Psychological exceptions are handled by suitably undemanding requirements (unlike that of giving the sum of any two numbers) and by setting the following two preconditions upon someone’s making the inference: that she considers the inference and has no motivating reason against it. The non-psychological exceptions, i.e., cases of neural malfunctioning, are handled by requiring that the counterfactuals be true sufficiently often during the relevant interval. I argue that this accommodates some important intuitions about concept possession, in particular, the intuition that concept possession is vague along a certain dimension. (shrink)

According to the species of neo-logicism advanced by Hale and Wright, mathematical knowledge is essentially logical knowledge. Their view is found to be best understood as a set of related though independent theses: (1) neo-fregeanism-a general conception of the relation between language and reality; (2) the method of abstraction-a particular method for introducing concepts into language; (3) the scope of logic-second-order logic is logic. The criticisms of Boolos, Dummett, Field and Quine (amongst others) of these theses are explicated and assessed. (...) The issues discussed include reductionism, rejectionism, the Julius Caesar problem, the Bad Company objections, and the charge that second-order logic is set theory in disguise. (shrink)

This essay argues that the main lesson of Lewis Carroll's Regress is that arguments are constitutively presuppositional.

How should we understand validity? A standard way to characterize validity is in terms of the preservation of truth (or truth in a model). But there are several problems facing such characterizations. An alternative approach is to characterize validity epistemically, for instance in terms of the preservation of an epistemic status. In this paper, I raise a problem for such views. First, I argue that if the relevant epistemic status is factive, such as being in a position to know or (...) having conclusive evidence for, then the account runs into trouble if we endorse certain familiar logical principles. Second, I argue that if the relevant epistemic status is non-factive, such as is rationally committed to or has justification for believing, then a similar problem arises if we endorse the logical principles as well as a sufficiently strong epistemic “level-bridging” principle. Finally, I argue that an analogous problem arises for the most natural characterization of validity in terms of rational credence. (shrink)

I present two arguments that aim to establish logical limits on what we can know. More specifically, I argue for two results concerning what we can know about questions that we cannot answer. I also discuss a line of thought, found in the writings of Pierce and of Rescher, in support of the idea that we cannot identify specific scientific questions that will never be answered.

Public announcement logic is an extension of multiagent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: after which , does it hold that Kφ? We give various semantic results and show completeness for a Hilbert-style axiomatization of this logic. There is a natural generalization to a logic for arbitrary events.

This paper draws out and connects two neglected issues in Kant’s conception of a priori knowledge. Both concern topics that have been important to contemporary epistemology and to formal epistemology in particular: knowability and luminosity. Does Kant commit to some form of knowability principle according to which certain necessary truths are in principle knowable to beings like us? Does Kant commit to some form of luminosity principle according to which, if a subject knows a priori, then they can know that (...) they know a priori? I defend affirmative answers to both of these questions, and by considering the special kind of modality involved in Kant’s conceptions of possible experience and the essential completability of metaphysics, I argue that his combination of knowability and luminosity principles leads Kant into difficulty. (shrink)

A novel solution to the knowability paradox is proposed based on Kant’s transcendental epistemology. The ‘paradox’ refers to a simple argument from the moderate claim that all truths are knowable to the extreme claim that all truths are known. It is significant because anti-realists have wanted to maintain knowability but reject omniscience. The core of the proposed solution is to concede realism about epistemic statements while maintaining anti-realism about non-epistemic statements. Transcendental epistemology supports such a view by providing for a (...) sharp distinction between how we come to understand and apply epistemic versus non-epistemic concepts, the former through our capacity for a special kind of reflective self-knowledge Kant calls ‘transcendental apperception’. The proposal is a version of restriction strategy: it solves the paradox by restricting the anti-realist’s knowability principle. Restriction strategies have been a common response to the paradox but previous versions face serious difficulties: either they result in a knowability principle too weak to do the work anti-realists want it to, or they succumb to modified forms of the paradox, or they are ad hoc. It is argued that restricting knowability to non-epistemic statements by conceding realism about epistemic statements avoids all versions of the paradox, leaves enough for the anti-realist attack on classical logic, and, with the help of transcendental epistemology, is principled in a way that remains compatible with a thoroughly anti-realist outlook. (shrink)

The motivation for Core Logic is explained. Its system of proof is set out. It is then shown that, although the system has no Cut rule, its relation of deducibility obeys Cut with epistemic gain.

Anti-realism is plagued by Fitch’s paradox: the remarkable result that if one accepts that all truths are knowable, minimal assumptions about the nature of knowledge entail that every truth is known. Dorothy Edgington suggests to address this problem by understanding p is knowable to be a counterfactual claim, but her proposal must contend with a forceful objection by Timothy Williamson. I revisit Edgington’s basic idea and find that Williamson’s objection is obviated by a refined understanding of counterfactual knowability that is (...) grounded in possible courses of inquiry. I arrive at a precise definition of knowability that is not just a technical avoidance of paradox, but is metaphysically sound and does justice to the anti-realist idea. (shrink)

In this paper I examine a neglected question concerning the centerpiece of Carnap's philosophy: the principle of tolerance. The principle of tolerance states that we are free to devise and adopt any well-defined form of language or linguistic framework we please. A linguistic framework defines framework-internal standards of correct reasoning that guide us in our first-order scientific pursuits. The choice of a linguistic framework, on the other hand, is an ‘external’ question to be settled on pragmatic grounds and so not (...) itself constrained by these standards. However, even if choosing a framework is a practical matter, we would nevertheless expect the process of framework selection to be subject to rational norms. But which norms might those be? And where do they come from? I begin by showing that these questions are crucial to the success of Carnap's entire philosophical project. I then offer a response on behalf of the Carnapian which guarantees the rationality of the process of framework selection, while remaining true to Carnap's firm commitment to tolerance. (shrink)

Neo‐Aristotelian Plenitude is the thesis that, necessarily, any property that could be had essentially by something or other is had essentially by something or other if and only if and because it is instantiated; any essentializable property is essentialized iff and because it is instantiated. In this paper, I develop a partial nonmodal characterization of ‘essentializable' and show it cannot be transformed into a full characterization. There are several seemingly insurmountable obstacles that any full characterization of essentializability must overcome. Moreover, (...) these obstacles threaten other views in the conceptual neighborhood such as Counterpart Theoretic Plenitude and Conceptualist Plenitude. (shrink)

§1. Overview. Philosophers and mathematicians have drawn lots of conclusions from Gödel's incompleteness theorems, and related results from mathematical logic. Languages, minds, and machines figure prominently in the discussion. Gödel's theorems surely tell us something about these important matters. But what?A descriptive title for this paper would be “Gödel, Lucas, Penrose, Turing, Feferman, Dummett, mechanism, optimism, reflection, and indefinite extensibility”. Adding “God and the Devil” would probably be redundant. Despite the breath-taking, whirlwind tour, I have the modest aim of forging (...) connections between different parts of this literature and clearing up some confusions, together with the less modest aim of not introducing any more confusions.I propose to focus on three spheres within the literature on incompleteness. The first, and primary, one concerns arguments that Gödel's theorem refutes the mechanistic thesis that the human mind is, or can be accurately modeled as, a digital computer or a Turing machine. The most famous instance is the much reprinted J. R. Lucas [18]. To summarize, suppose that a mechanist provides plans for a machine,M, and claims that the output ofMconsists of all and only the arithmetic truths that a human, or the totality of human mathematicians, will ever or can ever know. We assume that the output ofMis consistent. (shrink)

Dave Ripley has recently argued against the plausibility of multiset consequence relations and of contraction-free approaches to paradox. For Ripley, who endorses a nontransitive theory, the best arguments that buttress transitivity also push for contraction—whence it is wiser for the substructural logician to go nontransitive from the start. One of Ripley’s allegations is especially insidious, since it assumes the form of a trivialisation result: it is shown that if a multiset consequence relation can be associated to a closure operator in (...) the expected way, then it necessarily contracts. We counter Ripley’s objection by presenting an approach to multiset consequence that escapes this trap. This approach is multiple-conclusioned in a heterodox way, for multiple succedents are given a conjunctive, rather than a disjunctive reading. Finally, we address a further objection by French and Ripley to the effect that the informational interpretation of sequents in linear logic does not motivate cut. (shrink)

Logical inferentialism claims that the meaning of the logical constants should be given, not model-theoretically, but by the rules of inference of a suitable calculus. It has been claimed that certain proof-theoretical systems, most particularly, labelled deductive systems for modal logic, are unsuitable, on the grounds that they are semantically polluted and suffer from an untoward intrusion of semantics into syntax. The charge is shown to be mistaken. It is argued on inferentialist grounds that labelled deductive systems are as syntactically (...) pure as any formal system in which the rules define the meanings of the logical constants. (shrink)

We outline an intuitionistic view of knowledge which maintains the original Brouwer–Heyting–Kolmogorov semantics for intuitionism and is consistent with the well-known approach that intuitionistic knowledge be regarded as the result of verification. We argue that on this view coreflectionA→KAis valid and the factivity of knowledge holds in the formKA→ ¬¬A‘known propositions cannot be false’.We show that the traditional form of factivityKA→Ais a distinctly classical principle which, liketertium non datur A∨ ¬A, does not hold intuitionistically, but, along with the whole of (...) classical epistemic logic, is intuitionistically valid in its double negation form ¬¬(KA¬A).Within the intuitionistic epistemic framework the knowability paradox is resolved in a constructive manner. We argue that this paradox is the result of an unwarranted classical reading of constructive principles and as such does not have the consequences for constructive foundations traditionally attributed it. (shrink)

A logical constant is weakly disharmonious if its elimination rules are weaker than its introduction rules. Substructural weak disharmony is the weak disharmony generated by structural restrictions on the eliminations. I argue that substructural weak disharmony is not a defect of the constants which exhibit it. To the extent that it is problematic, it calls into question the structural properties of the derivability relation. This prompts us to rethink the issue of controlling the structural properties of a logic by means (...) of harmony. I argue that such a control is possible and desirable. Moreover, it is best achieved by global tests of harmony. (shrink)

Marton ( 2019 ) argues that that it follows from the standard antirealist theory of truth, which states that truth and possible knowledge are equivalent, that knowing possibilities is equivalent to the possibility of knowing, whereas these notions should be distinct. Moreover, he argues that the usual strategies of dealing with the Church–Fitch paradox of knowability are either not able to deal with his modal-epistemic collapse result or they only do so at a high price. Against this, I argue that (...) Marton’s paper does not present any seriously novel challenge to anti-realism not already found in the Church–Fitch result. Furthermore, Edgington ( 1985 ) reformulated antirealist theory of truth can deal with his modal-epistemic collapse argument at no cost. (shrink)

Fitch showed that not every true proposition can be known in due time; in other words, that not every proposition is knowable. Moore showed that certain propositions cannot be consistently believed. A more recent dynamic phrasing of Moore-sentences is that not all propositions are known after their announcement, i.e., not every proposition is successful. Fitch's and Moore's results are related, as they equally apply to standard notions of knowledge and belief (S 5 and KD45, respectively). If we interpret ‘successful’ as (...) ‘known after its announcement’ and ‘knowable’ as ‘known after some announcement’, successful implies knowable. Knowable does not imply successful: there is a proposition ϕ that is not known after its announcement but there is another announcement after which ϕ is known. We show that all propositions are knowable in the more general sense that for each proposition, it can become known or its negation can become known. We can get to know whether it is true: ◊(Kϕ ∨ K¬ϕ). This result comes at a price. We cannot get to know whether the proposition was true. This restricts the philosophical relevance of interpreting ‘knowable’ as ‘known after an announcement’. (shrink)

Starting from a proof-theoretic perspective, where meaning is determined by the inference rules governing logical operators, in this paper we primarily aim at developing a proof-theoretic alternative to the model-theoretic meaning-invariant logical pluralism discussed in Beall and Restall. We will also outline how this framework can be easily extended to include a form of meaning-variant logical pluralism. In this respect, the framework developed in this paper—which we label two-level proof-theoretic pluralism—is much broader in scope than the one discussed in Beall (...) and Restall’s book. (shrink)

Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in his strict finitistic metatheory, of equations between numerals on which concrete arithmetical sentences are evaluated. As a first step towards classical formalisation of strict finitism, we propose their counterparts in the classical metatheory with one additional assumption, and then extract the propositional part of ‘strict finitistic (...) logic’ from it and investigate. We will provide a sound and complete pair of a Kripke-style semantics and a sequent calculus, and compare with other logics. The logic lacks the law of excluded middle and Modus Ponens and is weaker than classical logic, but stronger than any proper intermediate logics in terms of theoremhood. In fact, all the other well-known classical theorems are found to be theorems. Finally, we will make an observation that models of this semantics can be seen as nodes of an intuitionistic model. (shrink)

The resemblance is plain to see between Kripke’s Wittgenstein introducing bizarre rules such as quaddition (in illustrating the sceptical paradox against theories of meaning) and Goodman’s introducing the equally bizarre grue (in generating the new riddle of induction). But the two sorts of bizarre cases also differ in interesting respects. For those familiar with Goodman’s case, this similarity sparks a strong temptation to enlist to the meaning sceptic’s cause key elements of Goodman’s new riddle, which are missing from Kripke’s case. (...) In this essay, I characterize a natural way of doing just this, which targets dispositionalist solutions to the sceptical paradox. I also show that, despite initial appearances, this new objection to dispositionalism (the symmetry problem) is not nearly as worrisome as originally thought. The solution offered on behalf of semantic dispositionalists does require a trade-off, though, from the severe form of indeterminacy advanced by the meaning sceptic to a much milder thesis. (shrink)

In philosophical logic and proof theory, we often find multiple-conclusion systems that induce a conjunctive reading of premises and a disjunctive reading of conclusions. In mathematical logic, in contrast, we often find multiple-conclusion systems that induce a conjunctive reading of both premises and conclusions. This paper studies some technical and philosophical aspects of this latter approach to multiple-conclusion consequence. The takeaway is that, while the importance of disjunctive multiple conclusions is beyond doubt, conjunctive multiple conclusions also have philosophical interest. First, (...) because there is some evidence that there are arguments with conjunctive multiple conclusions in natural language. Second, because conjunctive multiple conclusions are compatible with the reflexivity and transitivity of logical consequence, and this allows them to cohere better with some of our best accounts of what logical consequence is. (shrink)

European Journal of Philosophy, Volume 30, Issue 3, Page 1010-1027, September 2022.

As introduction to the special issue on the semantics of cardinals, we offer some background on the relevant literature, and an overview of the contributions to this volume. Most of these papers were presented in earlier form at an interdisciplinary workshop on the topic at The Ohio State University, and the contributions to this issue reflect that interdisciplinary character: the authors represent both fields in the title of this journal.

Two proofs are given which show that if some set of truths fall under finitely many concepts (so-called Collectivity), then they all fall under at least one of them even if we do not know which one. Examples are given in which the result seems paradoxical. The first proof crucially involves Moorean propositions while the second is a reconstruction and generalization of a proof due to Humberstone free from any reference to such propositions. We survey a few solution routes including (...) Tennant-style restriction strategies. It is concluded that accepting Collectivity for some set of truths while also denying that any of the involved concepts in isolation capture all of them requires that one of these concepts cannot be closed under conjunction elimination. This is surprising since the paper surveys several applications in which Collectivity and the latter closure condition seemed jointly satisfiable for concepts of actual philosophical interest. (shrink)

Peter Milne (2007) poses two challenges to the inferential theorist of meaning. This study responds to both. First, it argues that the method of natural deduction idealizes the essential details of correct informal deductive reasoning. Secondly, it explains how rules of inference in free logic can determine unique senses for the existential quantifier and the identity predicate. The final part of the investigation brings out an underlying order in a basic family of free logics.

Antirealists who hold the knowability thesis, namely that all truths are knowable, have been put on the defensive by the Church-Fitch paradox of knowability. Rejecting the non-factivity of the concept of knowability used in that paradox, Edgington has adopted a factive notion of knowability, according to which only actual truths are knowable. She has used this new notion to reformulate the knowability thesis. The result has been argued to be immune against the Church-Fitch paradox, but it has encountered several other (...) triviality objections. Schlöder in a forthcoming paper defends the general approach taken by Edgington, but amends it to save it in turn from the triviality objections. In this paper I will argue, first, that Schlöder's justification for the factivity of his version of the concept of knowability is vulnerable to criticism, but I will also offer an improved justification that is in the same spirit as his. To the extent that some philosophers are right about our intuitive concept of knowability being a factive one, it is important to explore factive concepts of knowability that are made formally precise. I will subsequently argue that Schlöder's version of the knowability thesis overgenerates knowledge or, in other words, it leads to attributions of knowledge where there is ignorance. This fits a general pattern for the research programme initiated by Edgington. This paper also contains preliminary investigations into the internal and logical structure of lines of inquiries, which raise interesting research questions. (shrink)

Theoria, Volume 88, Issue 4, Page 829-849, August 2022.

claims that constructive mathematics is inadequate for spacetime physics and hence that constructive mathematics cannot be considered as an alternative to classical mathematics. He also argues that the contructivist must be guilty of a form of a priorism unless she adopts a strong form of anti-realism for science. Here I want to dispute both claims. First, even if there are non-constructive results in physics this does not show that adequate constructive alternatives could not be formulated. Secondly, the constructivist adopts a (...) 'philosophy first' approach that Hellman rejects. This deep difference means that the viability of constructive mathematics cannot yet be decided by determining whether current scientific theories require classical mathematics. We need to decide which approach is most appropriate before we can even determine how we should go about deciding whether we should be constructive or classical mathematicians. (shrink)

A minimal constraint on normative reasons seems to be that if some fact is a reason for an agent to φ (act, believe, or feel), the agent could come to know that fact. This constraint is threatened by a well-known type of counterexamples. Self-effacing reasons are facts that intuitively constitute reasons for an agent to φ, but that if they were to become known, they would cease to be reasons for that agent. The challenge posed by self-effacing reasons bears important (...) structural similarities with a range of epistemic paradoxes, most notably the Knowability Paradox. In this article, we investigate the similarities and differences between the two arguments. Moreover, we assess whether some of the approaches to the Knowability Paradox could help solve the challenge posed by self-effacing reasons. We argue that at least two popular approaches to the paradox can be turned into promising strategies for addressing the self-effacing reasons problem. (shrink)

Michael Dummett offered a semantic characterisation of a variety of realism-antirealism debates. This approach has fallen out of fashion. This has been to the detriment of metaphysics. This paper offers an accurate characterisation of Dummett’s view, often lacking in the literature, and then defends it against a range of attacks (from Devitt, Miller and Williamson). This understanding of realism debates is resilient, and if we take it seriously the philosophical terrain looks importantly different. In particular, the philosophy of language has (...) a foundational role with respect to metaphysics. (shrink)

We begin with a brief explanation of our proof-theoretic criterion of paradoxicality—its motivation, its methods, and its results so far. It is a proof-theoretic account of paradoxicality that can be given in addition to, or alongside, the more familiar semantic account of Kripke. It is a question for further research whether the two accounts agree in general on what is to count as a paradox. It is also a question for further research whether and, if so, how the so-called Ekman (...) problem bears on the investigations here of the intensional paradoxes. Possible exceptions to the proof-theoretic criterion are Prior’s Theorem and Russell’s Paradox of Propositions—the two best-known ‘intensional’ paradoxes. We have not yet addressed them. We do so here. The results are encouraging. §1 studies Prior’s Theorem. In the literature on the paradoxes of intensionality, it does not enjoy rigorous formal proof of a Gentzenian kind—the kind that lends itself to proof-theoretic analysis of recondite features that might escape the attention of logicians using non-Gentzenian systems of logic. We make good that lack, both to render the criterion applicable to the formal proof, and to see whether the criterion gets it right. Prior’s Theorem is a theorem in an unfree, classical, quantified propositional logic. But if one were to insist that the logic employed be free, then Prior’s Theorem would not be a theorem at all. Its proof would have an undischarged assumption—the ‘existential presupposition’ that the proposition $$\forall p(Qp\!\rightarrow \!\lnot p)$$ ∀ p ( Q p → ¬ p ) exists. Call this proposition $$\vartheta $$ ϑ. §2 focuses on $$\vartheta $$ ϑ. We analyse a Priorean reductio of $$\vartheta $$ ϑ along with the possibilitate $$\Diamond \forall q(Qq\!\leftrightarrow \!(\vartheta \!\leftrightarrow \! q))$$ ◊ ∀ q ( Q q ↔ ( ϑ ↔ q ) ). The attempted reductio of this premise-pair, which is constructive, cannot be brought into normal form. The criterion says we have not straightforward inconsistency, but rather genuine paradoxicality. §3 turns to problems engendered by the proposition $$\exists p(Qp\wedge \lnot p)$$ ∃ p ( Q p ∧ ¬ p ) (call it $$\eta $$ η ) for the similar possibilitate $$\Diamond \forall q(Qq\!\leftrightarrow \!(\eta \!\leftrightarrow \! q))$$ ◊ ∀ q ( Q q ↔ ( η ↔ q ) ). The attempted disproof of this premise-pair—again, a constructive one—cannot succeed. It cannot be brought into normal form. The criterion says the premise-pair is a genuine paradox. In §4 we show how Russell’s Paradox of Propositions, like the Priorean intensional paradoxes, is to be classified as a genuine paradox by the proof-theoretic criterion of paradoxicality. (shrink)

Michael Friedman maintains that Carnap did not fully appreciate the impact of Gödel's first incompleteness theorem on the prospect for a purely syntactic definition of analyticity that would render arithmetic analytically true. This paper argues against this claim. It also challenges a common presumption on the part of defenders of Carnap, in their diagnosis of the force of Gödel's own critique of Carnap in his Gibbs Lecture. The author is grateful to Michael Friedman for valuable comments. Part of the research (...) towards this paper was carried out while the author was a Visiting Fellow at the Center for Philosophy of Science at the University of Pittsburgh. The paper was presented to the Center's Fellowship Reunion Conference in Athens in 1992. It was committed for publication in the Proceedings of that conference, but those Proceedings never appeared. By the time it became evident that they would never appear, both the hard copy and the source file had been mislaid. The hard copy re-surfaced in 2007. The literature on this topic since 1992 appears to leave some space for the ideas and arguments presented here. Although the paper has been updated in light of the more recent literature, its basic thesis, presented in 1992, remains the same. Only 3 is new, questioning a basic presumption made by more recent commentators in their presentation of Gödel's criticism of Carnap in his Gibbs Lecture. For helpful comments on the current version, the author is indebted to Robert Kraut, Stewart Shapiro, and Adam Podlaskowski. CiteULike Connotea Del.icio.us What's this? (shrink)

A. J. Ayer’s empiricist criterion of meaning was supposed to have sorted all statements into nonsense on the one hand, and tautologies or genuinely factual statements on the other. Unfortunately for Ayer, it follows from classical logic that his criterion is trivial—it classifies all statements as either tautologies or genuinely factual, but none as nonsense. However, in this paper, I argue that Ayer’s criterion of meaning can be defended from classical proofs of its triviality by the adoption of a relevant (...) logic—an idea which is motivated because, according to Ayer, the genuinely factual statements are those which observation is relevant to. (shrink)

The extensions of Goodman’s ‘grue’ predicate and Kripke’s ‘quus’ are constructed from the extensions of more familiar terms via a reinterpretation that permutes assignments of reference. Since this manoeuvre is at the heart of Putnam’s model-theoretic and permutation arguments against metaphysical realism (‘Putnam’s Paradox’), both Goodman’s New Riddle of Induction and the paradox about meaning that Kripke attributes to Wittgenstein are instances of Putnam’s. Evidence cannot selectively confirm the green-hypothesis and disconfirm the grue-hypothesis, because the theory of which the green-hypothesis (...) is a part has an unintended model in which the grue-hypothesis is equally confirmed; and there are no meaning-facts that determine reference, because the objects referred to by the referring terms of any language or set of intentional mental states are permutable in a way that is consistent with the truth-values of all other sentences in that language or beliefs in that set. The upshot is that the three paradoxes need to be solved in a unified way. (shrink)

Even though the strong relationship between proof-theoretic and model-theoretic notions in one’s logical theory can be shown by soundness and completeness proofs, whether we can define the model-theoretic notions by means of the inferences in a proof system is not at all trivial. For instance, provable inferences in a proof system of classical logic in the logical framework do not determine its intended models as shown by Carnap (Formalization of logic, Harvard University Press, Cambridge, 1943), i.e., there are non-Boolean models (...) that satisfy its provable inferences. In the literature, this is known as the Categoricity problem or Carnap’s problem. In this paper, we will discuss the Categoricity problem (or Carnap’s problem) for three-valued logics K3 and LP. We will provide three different restrictions on admissible models that will deliver us categoricity results, some of which draw from the solutions provided for the Categoricity problem for classical logic in Belnap and Massey (Stud Log 49(1):67–82, 1990) and Bonnay and Westerståhl (Erkenntis 81(4):721–739, 2016). We will then argue that two of those solutions are philosophically well-motivated: (1) restricting the admissible models where negation is interpreted as a Strong Kleene truth-function, and (2) restricting the admissible models where a complex formula is assigned the third value when its immediate subformulas are assigned the third value. (shrink)

The Knowability Paradox is a logical argument to the effect that, if there are truths not actually known, then there are unknowable truths. Recently, Alexander Paseau and Bernard Linsky have independently suggested a possible way to counter this argument by typing knowledge. In this article, we argue against their proposal that if one abstracts from other possible independent considerations supporting reasons for typing knowledge and considers the motivation for a type-theoretic approach with respect to the Knowability Paradox alone, there is (...) no substantive philosophical motivation to type knowledge, except that of solving the paradox. Every attempt to independently justify the typing of knowledge is doomed to failure. (shrink)

Knowing that some state of affairs—expressed by a proposition, p—is possible, and the possibility that one knows that p have, quite obviously, different meanings. This paper focuses only on their logical relationship—whether they entail one another. I will argue for the following three claims: the basic verificationist principles of anti-realism, at least in their simplest forms, and in conjunction with some other, intuitively reasonable principles, do entail that these two concepts are substitutionally equivalent. Our pre-theoretical expectations question this outcome, as (...) counterexamples can be manufactured. I will also argue that this substitutional equivalence has further, highly counter-intuitive implications. Finally, I will argue that some of the standard strategies to avoid the well-known paradoxes of anti-realism fail to solve this new paradox, while others may be able to do that, but only at a considerable price. However, the introduction of a moderate anti-realist truth operator, the actual objective of this paper, does dissolve the paradox, and arguably at an affordable price. (shrink)

Constructivist epistemology posits that all truths are knowable. One might ask to what extent constructivism is compatible with naturalized epistemology and knowledge obtained from inference-making using successful scientific theories. If quantum theory correctly describes the structure of the physical world, and if quantum theoretic inferences about which measurement outcomes will be observed with unit probability count as knowledge, we demonstrate that constructivism cannot be upheld. Our derivation is compatible with both intuitionistic and quantum propositional logic. This result is implied by (...) the Frauchiger-Renner theorem, though it is of independent importance as well. (shrink)

When a theory is confronted with a problem such as a paradox, an empirical anomaly, or a vicious regress, one may change part of the theory to solve that problem. Sometimes the proposed solution is considered ad hoc. This paper gives a new definition of ‘ad hoc solution’ as used in both philosophy and science. I argue that a solution is ad hoc if it fails to live up to the explanatory requirements of a theory because the solution is not (...) backed by an explanation or because it does not diagnose the problem. Ad hoc solutions are thus magical: they solve a problem without providing insight. This definition helps to explain both why ad hoc solutions are bad and why there may be disagreement about cases. (shrink)

Mathematical practice prompts theories about aprioricity, necessity, abstracta, and non-causal epistemic connections. But it is not clear what to count as the data: mathematical necessity or the appearance of mathematical necessity, abstractness or apparent abstractness, a prioricity or apparent aprioricity. Nor is it clear whether traditional metaphysical theories provide explanation or idle redescription. This paper suggests that abstract objects, rather than doing explanatory work, provide codifications of the data to be explained. It also suggests that traditional rivals—conceptualism, nominalism, realism—engage different (...) explanatory projects, and thus are not rivals at all. (shrink)