In an attempt to improve upon Alexander Pruss’s work (The principle of sufficient reason: A reassessment, pp. 240–248, 2006), I (Weaver, Synthese 184(3):299–317, 2012) have argued that if all purely contingent events could be caused and something like a Lewisian analysis of causation is true (per, Lewis’s, Causation as influence, reprinted in: Collins, Hall and paul. Causation and counterfactuals, 2004), then all purely contingent events have causes. I dubbed the derivation of the universality of causation the “Lewisian argument”. The Lewisian (...) argument assumed not a few controversial metaphysical theses, particularly essentialism, an incommunicable-property view of essences (per Plantinga’s, Actualism and possible worlds, reprinted in: Davidson (ed.) Essays in the metaphysics of modality, 2003), and the idea that counterfactual dependence is necessary for causation. There are, of course, substantial objections to such theses. While I think a fight against objections to the Lewisian argument can be won, I develop, in what follows, a much more intuitive argument for the universality of causation which takes as its inspiration a result from Frederic B. Fitch’s work (J Symb Logic 28(2):135–142, 1963) [with credit to who we now know was Alonzo church’s, Referee Reports on Fitch’s Definition of value, in: (Salerno (ed.), New essays on the knowability paradox, 2009)] that if all truths are such that they are knowable, then (counter-intuitively) all truths are known. The resulting Church–Fitch proof for the universality of causation is preferable to the Lewisian argument since it rests upon far weaker formal and metaphysical assumptions than those of the Lewisian argument. (shrink)

Since Fitch’s proof that not all propositions are knowable, philosophers have analysed the concept of knowability and sought a schema for the knowable propositions. A recent development in dynamic epistemic logic (DEL) has been to read ‘knowable’ as ‘known after an announcement’. Arbitrary Public Announcement Logic (APAL) and Sequential Public Announcement Logic (SPAL) are two DELs that have depicted this reading of knowability. We argue that neither APAL nor SPAL provide a satisfactory and principled schema of the knowable propositions. Instead, (...) we claim that knowability is linked with settledness; stability of truth. We augment SPAL with a settled operator to create a new logic, Dual Sequential Public Announcement Logic (DSPAL). We prove in DSPAL a principled schema of knowability, that all settled propositions are knowable. (shrink)

The general verificationist thesis says that What is true can be known or formally: φ → ◊Kφ VT Fitch's argument trivializes this principle. It uses a weak modal epistemic logic to show that VT collapses truth and knowledge, by taking a clever substitution instance for φ: P ∧ ¬KP → ◊ K(P ∧ ¬KP) Then we have the following chain of three conditionals (a) ◊ K(P ∧ ¬KP) → ◊ (KP ∧ K¬KP) in the minimal modal logic for the knowledge (...) operator K, (b) ◊ (KP ∧ K¬KP) → ◊ (KP ∧¬KP) in the modal logic T, and finally (c) ◊ (KP ∧¬KP) → ⊥ in the minimal modal logic for. (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)

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)

This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statements concerning the muddy children puzzle and sum and product. We also express a true statement that an agent’s beliefs about another agent’s knowledge flipped twice, and use a sound proof system to prove this statement. Adding a next-time operator to PAL, we provide formulas that express that belief revision does not take place (...) in PAL. We also discuss relationships between announcements and the new knowledge agents thus acquire; such relationships are related to learning and to Fitch’s paradox. We also show how inverse programs and hybrid logic each can be used to help determine whether or not an arbitrary structure represents the play of a game. We then add a past-time operator to DEL, and discuss the importance of adding yet another component to the language in order to prove completeness. (shrink)

I examine Quine’s and Davidson’s arguments to the effect that classical logic is the one and only correct logic. This conclusion is drawn from their views on radical translation and interpretation, respectively. I focus on the latter, but I first address, independently, Quine’s argument to the effect that the ‘deviant’ logician, who departs from classical logic, is merely changing the subject. Regarding logical pluralism, the question is whether there is more than one correct logic. I argue that bivalence may be (...) subject matter dependent, but that distribution and the law of excluded middle can probably not be dropped whilst maintaining the standard meanings of the connectives. In discussing the ramifications of the indeterminacy of interpretation, I ask whether it forces Davidsonian interpreters to adopt Dummett’s epistemic conception of truth vis-à-vis their interpretations. And, if so, does this cohere with their attributing a nonepistemic notion of truth to their interpretees? This would be a form of logical pluralism. In addition, I discuss Davidson’s arguments against conceptual schemes. Schemes incommensurable with our own could be construed as wholesale deviant logics, or so I argue. And, if so, their possibility would yield, in turn, the possibility of a radical logical pluralism. I also address Davidson’s application of Tarski’s definition of truth. (shrink)

Reformulation strategies for solving Fitch’s paradox of knowability date back to Edgington. Their core assumption is that the formula \, from which the paradox originates, does not correctly express the intended meaning of the verification thesis, which should concern possible knowledge of actual truths, and therefore the contradiction does not represent a logical refutation of verificationism. Supporters of these solutions claim that can be reformulated in a way that blocks the derivation of the paradox. Unfortunately, these reformulation proposals come with (...) other problems, on both the logical and the philosophical side. We claim that in order to make the reformulation idea consistent and adequate one should analyze the paradox from the point of view of a quantified modal language. An approach in this line was proposed by, among others, Kvanvig but was not fully developed in its technical details. Here we approach the paradox by means of a first order hybrid modal logic, a tool that strikes us as more adequate to express transworld reference and the rigidification needed to consistently express this idea. The outcome of our analysis is ambivalent. Given a first order formula we are able to express the fact that it is knowable in a way which is both consistent and adequate. However, one must give up the possibility of formulating as a substitution free schema of the kind \. We propose that one may instead formulate by means of a recursive translation of the initial formula, being aware that many alternative translations are possible. (shrink)

While defending the principle of non-contradiction in Metaphysics 4, Aristotle argues that the Measure Doctrine of Protagoras is equivalent to the claim that all contradictions are true; given all...

Anti-realist epistemic conceptions of truth imply what is called the knowability principle: All truths are possibly known. The principle can be formalized in a bimodal propositional logic, with an alethic modality ${\diamondsuit}$ and an epistemic modality ${\mathcal{K}}$, by the axiom scheme ${A \supset \diamondsuit \mathcal{K} A}$. The use of classical logic and minimal assumptions about the two modalities lead to the paradoxical conclusion that all truths are known, ${A \supset \mathcal{K} A}$. A Gentzen-style reconstruction of the Church–Fitch paradox is presented (...) following a labelled approach to sequent calculi. First, a cut-free system for classical bimodal logic is introduced as the logical basis for the Church–Fitch paradox and the relationships between ${\mathcal {K}}$ and ${\diamondsuit}$ are taken into account. Afterwards, by exploiting the structural properties of the system, in particular cut elimination, the semantic frame conditions that correspond to KP are determined and added in the form of a block of nonlogical inference rules. Within this new system for classical and intuitionistic “knowability logic”, it is possible to give a satisfactory cut-free reconstruction of the Church–Fitch derivation and to confirm that OP is only classically derivable, but neither intuitionistically derivable nor intuitionistically admissible. Finally, it is shown that in classical knowability logic, the Church–Fitch derivation is nothing else but a fallacy and does not represent a real threat for anti-realism. (shrink)

This paper is concerned with the implication from value to fittingness. I shall argue that those committed to this implication face a serious explanatory challenge. This argument is not intended as a knock-down argument against FA but it will, I think, show that those who endorse the theory incur a particular explanatory burden: to explain how counterfactual favouring of actual value is possible. After making two important preliminary points I briefly discuss an objection to FA made by Krister Bykvist a (...) few years ago. The point of discussing this objection is to enable me to more easily present my own, and I believe stronger, version of that objection. The overall argument takes the form of, simply, a counterexample which can be constructed on the back of of my two preliminary points. Throughout the paper I try to respond to various objections. (shrink)

The focus of this article is the question whether the notion of being in a position to know is closed under modus ponens. The question is answered negatively.

Truth pluralists say that there are many ways to be true. Aaron Cotnoir (“Pluralism and Paradox” in: Pedersen and Wright (eds) Truth and pluralism: current debates, Oxford University Press, Oxford, 2013) has suggested a “uniquely pluralist response to the liar”. The basic idea is to maintain that, if a sentence says of itself that it is not true in a certain way, then that sentence is not apt to be true in that way, but is instead apt to be true (...) in a different way. While this is consistent with the basic tenets of truth pluralism, it is an open question whether or not it is amenable to any actual pluralist theory. The primary goal of this paper is to argue that Cotnoir's proposal is amenable to form-based pluralism, rather than domain-based pluralism. In particular, in Section 1, I argue that there are several serious obstacles in the way of the domain-based pluralist who wishes to endorse Cotnoir's proposal; in Section 2, I show how the form-based pluralist can overcome these difficulties. The secondary goal of the paper is to argue that most, if not all, substantivists about truth should find form-based pluralism independently attractive. As such, the possibility of a form-based pluralist solution to the liar is not merely a technical curiosity, but something in which substantivists about truth have a vested interest. (shrink)

There are several ways to quantify over public announcements. The most notable are reflected in arbitrary, group, and coalition announcement logics, with the latter being the least studied so far. In the present work, we consider coalition announcements through the lens of group announcements, and provide a complete axiomatisation of a logic with coalition announcements. To achieve this, we employ a generalisation of group announcements. Moreover, we study some logical properties of both coalition and group announcements that have not been (...) studied before. (shrink)

I discuss the question of when knowledge of higher order ignorance is possible and show in particular that, under quite plausible assumptions, knowledge of second order ignorance is impossible.

This paper presents a generalized form of Fitch's paradox of knowability, with the aim of showing that the questions it raises are not peculiar to the topics of knowledge, belief, or other epistemic notions. Drawing lessons from the generalization, the paper offers a solution to Fitch's paradox that exploits an understanding of modal talk about what could be known in terms of capacities to know. It is argued that, in rare cases, one might have the capacity to know that p (...) even if it is metaphysically impossible for anyone to know that p, and that recognizing this fact provides the resources to solve Fitch's paradox. (shrink)

In this paper, we introduce a notion of ‘disjunctive ignorance’, which is a weak combination of two forms of ignorance in the literature. We propose a logical language with ‘disjunctive ignorance’ as a sole modality, explore the logical properties of this notion and its related notions, and axiomatize it over various frame classes. By finding suitable reduction axioms, we extend the results to the case of public announcements and apply it to Moore-like sentences.

Logic is breaking out of the confines of the single-agent static paradigm that has been implicit in all formal systems until recent times. We sketch some recent developments that take logic as an account of information-driven interaction. These two features, the dynamic and the social, throw fresh light on many issues within logic and its connections with other areas, such as epistemology and game theory.

The Knowability Paradox purports to show that the controversial but not patently absurd hypothesis that all truths are knowable entails the implausible conclusion that all truths are known. The notoriety of this argument owes to the negative light it appears to cast on the view that there can be no verification-transcendent truths. We argue that it is overly simplistic to formalize the views of contemporary verificationists like Dummett, Prawitz or Martin-Löf using the sort of propositional modal operators which are employed (...) in the original derivation of the Paradox. Instead we propose that the central tenet of verificationism is most accurately formulated as follows: if φ is true, then there exists a proof of φ Building on the work of Artemov (Bull Symb Log 7(1): 1-36, 2001), a system of explicit modal logic with proof quantifiers is introduced to reason about such statements. When the original reasoning of the Paradox is developed in this setting, we reach not a contradiction, but rather the conclusion that there must exist non-constructed proofs. This outcome is evaluated relative to the controversy between Dummett and Prawitz about proof existence and bivalence. (shrink)

In virtue of Fitch-Church proof, also known as the knowability paradox, we are able to prove that if everything is knowable, then everything is known. I present two ‘onto-theological’ versions of the proof, one concerning collective omniscience and another concerning omnificence. I claim these arguments suggest new ways of exploring the intersection between logical and ontological givens that is a grounding theme of religious thought. What is more, they are good examples of what I call semi-paradoxes: apparently sound arguments whose (...) conclusion is not properly unacceptable, but simply arguable. (shrink)

This paper presents a puzzle involving embedded attitude reports. We resolve the puzzle by arguing that attitude verbs take restricted readings: in some environments the denotation of attitude verbs can be restricted by a given proposition. For example, when these verbs are embedded in the consequent of a conditional, they can be restricted by the proposition expressed by the conditional’s antecedent. We formulate and motivate two conditions on the availability of verb restrictions: a constraint that ties the content of restrictions (...) to the “dynamic effects” of sentential connectives and a constraint that limits the availability of restriction effects to present tense verbs with first-person subjects. However, we also present some cases that make trouble for these conditions, and outline some possible ways of modifying the view to account for the recalcitrant data. We conclude with a brief discussion of some of the connections between our semantics for attitude verbs and issues concerning epistemic modals and theories of knowledge. (shrink)

In this paper, we provide a semantic analysis of the well-known knowability paradox stemming from the Church–Fitch observation that the meaningful knowability principle /all truths are knowable/, when expressed as a bi-modal principle F --> K♢F, yields an unacceptable omniscience property /all truths are known/. We offer an alternative semantic proof of this fact independent of the Church–Fitch argument. This shows that the knowability paradox is not intrinsically related to the Church–Fitch proof, nor to the Moore sentence upon which it (...) relies, but rather to the knowability principle itself. Further, we show that, from a verifiability perspective, the knowability principle fails in the classical logic setting because it is missing the explicit incorporation of a hidden assumption of /stability/: ‘the proposition in question does not change from true to false in the process of discovery.’ Once stability is taken into account, the resulting /stable knowability principle/ and its nuanced versions more accurately represent verification-based knowability and do not yield omniscience. (shrink)

In this paper I present a more refined analysis of the principles of deductive closure and positive introspection. This analysis uses the expressive resources of logics for different types of group knowledge, and discriminates between aspects of closure and computation that are often conflated. The resulting model also yields a more fine-grained distinction between implicit and explicit knowledge, and places Hintikka’s original argument for positive introspection in a new perspective.

A dynamic epistemic logic is presented in which the single agent can reason about his knowledge stages before and after announcements. The logic is generated by reinterpreting multi agent private announcements in a single agent environment. It is shown that a knowability principle is valid for such logic: any initially true ϕ can be known after a certain number of announcements.

1 Logic in philosophy The century that was Logic has played an important role in modern philosophy, especially, in alliances with philosophical schools such as the Vienna Circle, neopositivism, or formal language variants of analytical philosophy. The original impact was via the work of Frege, Russell, and other pioneers, backed up by the prestige of research into the foundations of mathematics, which was fast bringing to light those amazing insights that still impress us to-day. The Golden Age of the 1930s (...) deeply affected philosophy, and heartened the minority of philosophers with a formalanalytical bent. As Brand Blanshard writes in Reason and Analysis (1964) – I quote from memory here, to avoid the usual disappointment when re-reading an original text. (shrink)

Enligt ett realistiskt synsätt kan ett påstående vara sant trots att det inte ens i princip är möjligt att veta att det är sant. En sanningsteoretisk antirealist kan inte godta denna möjlighet utan accepterar en eller annan version av Dummetts vetbarhetsprincip: (K) Om ett påstående är sant, så måste det i princip vara möjligt att veta att det är sant. Det kan dock förefalla rimligt, även för en antirealist, att gå̊ med på̊ att det kan finnas sanningar som ingen faktiskt (...) vet (har vetat, eller kommer att veta) är sanna. Man kan därför tänka sig att en antirealist skulle acceptera principen (K) utan att därför gå med på den till synes starkare principen: (SK) Om ett påstående är sant, så måste det faktiskt finnas någon som vet att det är sant. Ett mycket omdiskuterat argument – som ytterst går tillbaka till Alonzo Church, men som först publicerades i en uppsats av Frederic Fitch i Journal of Symbolic Logic 1963 – tycks emellertid visa att principen (K) implicerar principen (SK). Anta nämligen att (K) är sann, medan (SK) inte är det. Men om (SK) är falsk, så finns det ett påstående som är sant men som ingen faktiskt vet är sant. Anta nu att p är ett sådant påstående. Låt Kp betyda att någon vet att p är sant. Det galler alltså̊ att p är sant samtidigt som Kp inte är det. Betrakta nu påståendet (p ∧ −Kp). Enligt antagandet är detta påstående sant. Enligt (K) måste det då vara möjligt att någon vet att (p ∧ −Kp). D.v.s., det måste vara möjligt att påståendet K(p ∧ −Kp) är sant. Men i så fall är det också̊ möjligt att påståendet Kp ∧ K−Kp är sant, vilket i sin tur implicerar att det är möjligt att Kp ∧ −Kp är sant, vilket ju är absurt. Således kan inte (K) vara sann samtidigt som (SK) är falsk. Vi tycks således kunna sluta oss till att (K) implicerar (SK). I uppsatsen diskuterar jag några olika sätt att undgå̊ Church-Fitch paradoxala slutsats. Ett tillvägagångssätt är att ersätta kunskapsoperatorn med en hierarki av kunskapspredikat. Ett annat är baserat på distinktionen mellan faktisk och potentiell kunskap och ett förkastande av den vanliga modallogiska formaliseringen av principen (K). Den senare typen av lösning betraktas både från ett realistiskt och ett icke-realistiskt perspektiv. Utifrån denna analys kommer jag fram till slutsatsen att vi, vare sig vi är realister eller antirealister rörande sanning, kan sluta oroa oss för vetbarhetsparadoxen och ändå uppskatta Church-Fitchs argument. (shrink)

The thesis includes six essays, each corresponding to a chapter, which have the target of widening the discussion on the limits of knowability through the consideration of some general problematics and the discussion of specific topics. The work is composed of two parts, each of three chapters. In the first part, the discussion is focused on a perspective proper of the philosophy of language. In particular, I consider the discussion on the limits of knowability from the point of view of (...) the debate between semantic realism and antirealism. The second part of the thesis is focused on the discussion on the limits of knowability from a perspective more strictly epistemological and proper of the philosophy of science. (shrink)

Addresses the question of why we find Fitch's knowability 'paradox' argument surprising.