Distributed Knowability and Fitch’s Paradox

Recently predominant forms of anti-realism claim that all truths are knowable. We argue that in a logical explanation of the notion of knowability more attention should be paid to its epistemic part. Especially very useful in such explanation are notions of group knowledge. In this paper we examine mainly the notion of distributed knowability and show its effectiveness in the case of Fitch’s paradox. Proposed approach raised some philosophical questions to which we try to find responses. We also show how we can combine our point of view on Fitch’s paradox with the others. Next we give an answer to the question: is distributed knowability factive? At the end, we present some details concerning a construction of anti-realist modal epistemic logic.     

Factive knowability and the problem of possible omniscience

Philosophical Studies - Famously, the Church–Fitch paradox of knowability is a deductive argument from the thesis that all truths are knowable to the conclusion that all truths are known. In...     

Discovering knowability: a semantic analysis

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 ${\diamondsuit}$ , 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.     

Deutscher's problem is not Popper's problem

The so-called knowability paradox results from Fitch's argument that if there are any unknown truths, then there are unknowable truths. This threatens recent versions of semantical antirealism, the central thesis of which is that truth is epistemic. When this is taken to mean that all truths are knowable, antirealism is thus committed to the conclusion that no truths are unknown. The correct antirealistic response to the paradox should be to deny that the fundamental thesis of the epistemic nature of truth entails the knowability of all truths. Correctly understood, the antirealistic conditions on a proposition's truth do not require that the proposition possess a verification-procedure which, when executed under the given conditions, issues in an agent's recognition of truth, but merely that there be a verification-procedure which, under these conditions, takes the value true. The knowability paradox and the related idealism problem (that antirealism seems, but is not, committed to the necessary existence of an epistemic agent) draw attention to the fact that certain propositions, those that are about verification-procedures themselves, may under certain conditions take the value true despite their unperformability under these circumstances. Thus these propositions' procedures can only be performed when the propositions are false, and they gain the appearance of antirealistic impossibility (e.g., that there is an unknown truth). This differs from the unperformability that antirealists object to, pertaining merely to matters of execution rather than to the logical structure of the procedures themselves. The force of antirealism's notion of epistemic truth is piecemeal, rather than consisting in a blanket characterization of truth as knowable.     

Monotonicity in Practical Reasoning

Classic deductive logic entails that once a conclusion is sustained by a valid argument, the argument can never be invalidated, no matter how many new premises are added. This derived property of deductive reasoning is known as monotonicity. Monotonicity is thought to conflict with the defeasibility of reasoning in natural language, where the discovery of new information often leads us to reject conclusions that we once accepted. This perceived failure of monotonic reasoning to observe the defeasibility of natural-language arguments has led some philosophers to abandon deduction itself (!), often in favor of new, non-monotonic systems of inference known as `default logics'. But these radical logics (e.g., Ray Reiter's default logic) introduce their desired defeasibility at the expense of other, equally important intuitions about natural-language reasoning. And, as a matter of fact, if we recognize that monotonicity is a property of the form of a deductive argument and not its content (i.e., the claims in the premise(s) and conclusion), we can see how the common-sense notion of defeasibility can actually be captured by a purely deductive system.     

Knowability and the capacity to know

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.     

Perspectives and the World

In this paper I consider metaphysical positions which I label as ‘perspectival’. A perspectivalist believes that some portion of reality cannot extend beyond what an appropriately characterised investigator or investigators can (in some sense) reveal about it. So a perspectivalist will be drawn to claim that a portion of reality is, in some sense, knowable. Many such positions appear to founder on the paradox of knowability. I aim to offer a solution to that paradox which can be adopted by any perspectivalist, which involves no restriction on the claim of knowability and which allows certain sentences to be unknowable. The solution hinges on recognising that what is meant by ‘knowable’ will vary from one type of proposition to another and thus that characterising the modality involved in the notion in terms of possible worlds will be impossible. I thus offer a subjunctive conditional reading of that modality, a reading which, I claim, has the virtues just recounted.     

Tennant on Knowable Truth

The paper responds to Neil Tennant's recent discussion of Fitch's so-called paradox of knowability in the context of intuitionistic logic. Tennant's criticisms of the author's earlier work on this topic are shown to rest on a principle about the assertibility of disjunctions with the absurd consequence that everything we could make true already is true. Tennant restricts the anti-realist principle that truth implies knowability in order to escape Fitch's argument, but a more complex variant of the argument is shown to elicit from his restricted principle exactly the consequences which it was intended to avoid.     

Verificationists Versus Realists: The Battle Over Knowability

Verificationism is the doctrine stating that all truths are knowable. Fitch’s knowability paradox, however, demonstrates that the verificationist claim (all truths are knowable) leads to “epistemic collapse”, i.e., everything which is true is (actually) known. The aim of this article is to investigate whether or not verificationism can be saved from the effects of Fitch’s paradox. First, I will examine different strategies used to resolve Fitch’s paradox, such as Edgington’s and Kvanvig’s modal strategy, Dummett’s and Tennant’s restriction strategy, Beall’s paraconsistent strategy, and Williamson’s intuitionistic strategy. After considering these strategies I will propose a solution that remains within the scope of classical logic. This solution is based on the introduction of a truth operator. Though this solution avoids the shortcomings of the non-standard (intuitionistic) solution, it has its own problems. Truth, on this approach, is not closed under the rule of conjunction-introduction. I will conclude that verificationism is defensible, though only at a rather great expense.     

Knowledge Grounded on Pure Reasoning

In this paper, I deal with epistemological issues that stem from the hypothesis that reasoning is not only a means of transmitting knowledge from premise‐beliefs to conclusion‐beliefs but also a primary source of knowledge in its own right. The idea is that one can gain new knowledge on the basis of suppositional reasoning. After making some preliminary distinctions, I argue that there are no good reasons to think that purported examples of knowledge grounded on pure reasoning are just examples of premise‐based inferences in disguise. Next, I establish what kinds of true propositions can to a first approximation be known on the basis of pure reasoning. Finally, I argue that beliefs that are competently formed on the basis of suppositional reasoning satisfy both externalist and internalist criteria of justification.     

Conflict and Co-ordination in the Aftermath of Oracular Statements

Can victims of the oracle paradox, which is known primarily through its unexpected hanging and surprise examination versions, extricate themselves from their difficulties of reasoning? No. For they do not, contrary to recent opinion, commit errors of fallacious elimination. As I shall argue, the difficulties of reasoning faced by these victims do not originate in the domain of concepts, propositions and their entailment relations; nor do they result from misapprehensions about limitations on what can be known. The difficulties of reasoning flow, instead, from conflicts that arise in the practical dimension of life. The oracle paradox is in this way more evocative of problems faced in the theory of computation than it is like the celebrated Russell's paradox.     

Resource-origins of Nonmonotonicity

Formal nonmonotonic systems try to model the phenomenon that common sense reasoners are able to “jump” in their reasoning from assumptions Δ to conclusions C without their being any deductive chain from Δ to C. Such jumps are done by various mechanisms which are strongly dependent on context and knowledge of how the actual world functions. Our aim is to motivate these jump rules as inference rules designed to optimise survival in an environment with scant resources of effort and time. We begin with a general discussion and quickly move to Section 3 where we introduce five resource principles. We show that these principles lead to some well known nonmonotonic systems such as Nute’s defeasible logic. We also give several examples of practical reasoning situations to illustrate our principles. Edited by Hannes Leitgeb     

The Church–Fitch knowability paradox in the light of structural proof theory

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}$ (KP). 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}$ (OP). 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 (resp. intuitionistic) 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.     

Some remarks on restricting the knowability principle

The Fitch paradox poses a serious challenge for anti-realism. This paper investigates the option for an anti-realist to answer the challenge by restricting the knowability principle. Based on a critical discussion of Dummett??s and Tennant??s suggestions for a restriction desiderata for a principled solution are developed. In the second part of the paper a different restriction is proposed. The proposal uses the notion of uniform formulas and diagnoses the problem arising in the case of Moore sentences in the different status propositional letters receive. The new proposal is able to avoid some of the criticism on its predecessors.     

Deductivism and the Informal Fallacies

This essay proposes and defends a general thesis concerning the nature of fallacies of reasoning. These in distinctive ways are all said to be deductively invalid. More importantly, the most accurate, complete and charitable reconstructions of these species and specimens of the informal fallacies are instructive with respect to the individual character of each distinct informal fallacy. Reconstructions of the fallacies as deductive invalidities are possible in every case, if deductivism is true, which means that in every case they should be formalizable in an expressively comprehensive formal symbolic deductive logic. The general thesis is illustrated by a detailed examination of Walter Burleigh's paradox in his c. 1323 work, De Puritate Artis Logicae Tractatus Longior (Longer Treatise on the Purity of Logic), as a challenge to the deductive validity of hypothetical syllogism. The paradox has the form, ‹If I call you a swine, then I call you an animal; if I call you an animal, then I speak truly; therefore, if I call you a swine, then I speak truly'. Several solutions to the problem are considered, and the inference is exposed as an instance of the common deductive fallacy of equivocation.     

Is Every Truth Knowable? Reply to Williamson

This paper addresses an objection raised by Timothy Williamson to the 'restriction strategy' that I proposed, in The Taming of The True , in order to deal with the Fitch paradox. Williamson provides a newversion of a Fitch-style argument that purports to show that even the restricted principle of knowability suffers the same fate as the unrestricted one. I show here that the new argument is fallacious. The source of the fallacy is a misunderstanding of the condition used in stating the restricted knowability principle. I also rebut WilliamsonÕs criticism of my argument for the claim that any proposition of the form 'it is known thatφ' is decidable if φ is decidable     

对归纳推理非对称性现象的特征迁移解释

作者创新提出对归纳推理非对称性现象的特征迁移解释,认为根据由前提类别已知的特征集合构成的特征样本中迁移出现在结论类别中的特征的比例,能预测作为新特征的归纳特征由前提类别迁移到结论类别的可能性。以大学生为被试的实验结果支持对非对称性现象的特征迁移解释而不是原来的两种相似性解释。     

On Kripke’s Dogmatism Paradox: A Logical Dynamical Analysis

As a byproduct of solving the surprise-exam paradox, Saul Kripke formulates a “dogmatism paradox” which seems to show that knowledge entails dogmatism. In this paper, the author analyzes the nature of the dogmatism paradox from a logical dynamical perspective. The author suggests that the dogmatism paradox is better understood as a paradox of knowledge attribution rather than of knowledge. Therefore, the dogmatism paradox could be solved without sacrificing the principle of epistemic closure. Based on a famous version of relevant alternatives theory, the author formalizes a logic of knowledge attribution in the style of logical dynamics, namely, public retraction logic, and analyzes how knowledge attributions are retracted with the expansion of relevant alternatives.     

Paradoxes and Failures of Cut

This paper presents and motivates a new philosophical and logical approach to truth and semantic paradox. It begins from an inferentialist, and particularly bilateralist, theory of meaning—one which takes meaning to be constituted by assertibility and deniability conditions—and shows how the usual multiple-conclusion sequent calculus for classical logic can be given an inferentialist motivation, leaving classical model theory as of only derivative importance. The paper then uses this theory of meaning to present and motivate a logical system—ST—that conservatively extends classical logic with a fully transparent truth predicate. This system is shown to allow for classical reasoning over the full (truth-involving) vocabulary, but to be non-transitive. Some special cases where transitivity does hold are outlined. ST is also shown to give rise to a familiar sort of model for non-classical logics: Kripke fixed points on the Strong Kleene valuation scheme. Finally, to give a theory of paradoxical sentences, a distinction is drawn between two varieties of assertion and two varieties of denial. On one variety, paradoxical sentences cannot be either asserted or denied; on the other, they must be both asserted and denied. The target theory is compared favourably to more familiar related systems, and some objections are considered and responded to.