- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: References
Citations of:
Fitch's Argument and Typing Knowledge
Notre Dame Journal of Formal Logic 49 (2):153-176 (2008)
Add citations
You must login to add citations.
|
|
|
Epistemic transparency tells us that, if an agent S knows a given proposition p , then S knows that she knows that p . This idea is usually encoded in the so-called KK principle of epistemic logic. The paper develops an argument in favor of a moderate version of KK , which I dub quasi-transparency , as a normative rather than a descriptive principle. In the second Section I put forward the suggestion that epistemic transparency is not a demand of (...) |
|
|
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 (...) |
|
|
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 (...) |
|
|
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 (...) |
|
|
Mathematicians do not claim to know a proposition unless they think they possess a proof of it. For all their confidence in the truth of a proposition with weighty non-deductive support, they maintain that, strictly speaking, the proposition remains unknown until such time as someone has proved it. This article challenges this conception of knowledge, which is quasi-universal within mathematics. We present four arguments to the effect that non-deductive evidence can yield knowledge of a mathematical proposition. We also show that (...) |
|
|
In my paper , I noted that Fitch's argument, which purports to show that if all truths are knowable then all truths are known, can be blocked by typing knowledge. If there is not one knowledge predicate, ‘ K’, but infinitely many, ‘ K 1’, ‘ K 2’, … , then the type rules prevent application of the predicate ‘ K i’ to sentences containing ‘ K i’ such as ‘ p ∧¬ K i⌜ p⌝’. This provides a motivated response (...) |
|
|
Recently, it has been observed that the usual type-theoretic restrictions are not enough to block certain paradoxes involving two or more predicates. In particular, when we have a self-referential language containing modal predicates, new paradoxes might appear even if there are type restrictions for the principles governing those predicates. In this article we consider two type-theoretic solutions to multimodal paradoxes. The first one adds types for each of the modal predicates. We argue that there are a number of problems with (...) |
|
|
The KK principle states that knowing entails knowing that one knows. This historically popular principle has fallen out of favour among many contemporary philosophers in light of putative counterexamples. Recently, some have defended more palatable versions of KK by weakening the principle. These revisions remain faithful to their predecessor in spirit while escaping crucial objections. This paper examines the prospects of such a strategy. It is argued that revisions of the original principle can be captured by a generalized knowledge iteration (...) |
|
|
|
|
|
A well-known proof by Alonzo Church, first published in 1963 by Frederic Fitch, purports to show that all truths are knowable only if all truths are known. This is the Paradox of Knowability. If we take it, quite plausibly, that we are not omniscient, the proof appears to undermine metaphysical doctrines committed to the knowability of truth, such as semantic anti-realism. Since its rediscovery by Hart and McGinn (1976), many solutions to the paradox have been offered. In this article, we (...) |
|
|
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 (...) |
|
|
It is often maintained that co-referential terms can be substituted for one another whilst preserving truth-value in extensional contexts, and preserving grammaticality in all contexts. Crispin Wright calls this claim ‘The Reference Principle’ . Since Wright defines extensional contexts as those in which truth-value is determined only by reference, it is the assertion about substitution salva congruitate that is significant. Wright argues that RP is the key to understanding how Frege came to hold, paradoxically, that the concept horse is not (...) |
|
|
A logical argument known as Fitch’s Paradox of Knowability, starting from the assumption that every truth is knowable, leads to the consequence that every truth is also actually known. Then, given the ordinary fact that some true propositions are not actually known, it concludes, by modus tollens, that there are unknowable truths. The main literature on the topic has been focusing on the threat the argument poses to the so called semantic anti-realist theories, which aim to epistemically characterize the notion (...) |
|
|
Some attempts have been made to block the Knowability Paradox and other modal paradoxes by adopting a type-theoretic framework in which knowledge and necessity are regarded as typed predicates. The main problem with this approach is that when these notions are simultaneously treated as predicates, a new kind of paradox appears. I claim that avoiding this paradox either by weakening the Knowability Principle or by introducing types for both predicates is rather messy and unattractive. I also consider the prospect of (...) |
|
|
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 (...) |
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-slfdl uwo