Fitch’s Paradox shows that if every truth is knowable, then every truth is known. Standard diagnoses identify the factivity/negative infallibility of the knowledge operator and Moorean contradictions as the root source of the result. This paper generalises Fitch’s result to show that such diagnoses are mistaken. In place of factivity/negative infallibility, the weaker assumption of any ‘level-bridging principle’ suffices. A consequence is that the result holds for some logics in which the “Moorean contradiction” commonly thought to underlie the (...) result is in fact consistent. This generalised result improves on the current understanding of Fitch’s result and widens the range of modalities of philosophical interest to which the result might be fruitfully applied. Along the way, we also consider a semantic explanation for Fitch’s result which answers a challenge raised by Kvanvig. (shrink)

Jago uses a Fitch-style argument in an attempt to demonstrate that every truth has a truthmaker. But Trueman shows that there is a parallel argument, this time to the conclusion that no truth has a truthmaker. Since we cannot accept both, we must ditch at least one Fitch. But which? Keywords: Truth, truthmaking, truthmaker maximalism, Fitch paradox, Robert Trueman.

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)

According to the “paradox of knowability”, the moderate thesis that all truths are knowable – ... – implies the seemingly preposterous claim that all truths are actually known – ... –, i.e. that we are omniscient. If Fitch’s argument were successful, it would amount to a knockdown rebuttal of anti-realism by reductio. In the paper I defend the nowadays rather neglected strategy of intuitionistic revisionism. Employing only intuitionistically acceptable rules of inference, the conclusion of the argument is, firstly, not (...) ..., but .... Secondly, even if there were an intuitionistically acceptable proof of ..., i.e. an argument based on a different set of premises, the conclusion would have to be interpreted in accordance with Heyting semantics, and read in this way, the apparently preposterous conclusion would be true on conceptual grounds and acceptable even from a realist point of view. Fitch’s argument, understood as an immanent critique of verificationism, fails because in a debate dealing with the justification of deduction there can be no interpreted formal language on which realists and anti-realists could agree. Thus, the underlying problem is that a satisfactory solution to the “problem of shared content” is not available. I conclude with some remarks on the proposals by J. Salerno and N. Tennant to reconstruct certain arguments in the debate on anti-realism by establishing aporias. (shrink)

If we want to say that all truths are knowable Fitch’s Paradox leads us to conclude that all truths are known. Is it a real philosophical problem or a mere modeling problem? Is it possible to express the idea of knowability using modal logic? The Knowability Principle is expressed by the formula: if Phi is true then it is possible to know that Phi. But what is the meaning of possibility in this context? Using standard modal operators under what (...) condition can we express the idea of knowability? We will in particular examine the subjacent relations of the modal operators in a Kripke Model. We will define the possibility as the possibility of learning opposed to an unclear possibility. Then we will show that Fitch’s Paradox becomes clearer and we will examine how the Knowability Principle could be expressed in such frame. (shrink)

Augment the propositional language with two modal operators: □ and ■. Define ⧫ to be the dual of ■, i.e. ⧫=¬■¬. Whenever (X) is of the form φ → ψ, let (X⧫) be φ→⧫ψ . (X⧫) can be thought of as the modally qualified counterpart of (X)—for instance, under the metaphysical interpretation of ⧫, where (X) says φ implies ψ, (X⧫) says φ implies possibly ψ. This paper shows that for various interesting instances of (X), fairly weak assumptions suffice for (...) (X⧫) to imply (X)—so, the modally qualified principle is as strong as its unqualified counterpart. These results have surprising and interesting implications for issues spanning many areas of philosophy. (shrink)

A variation of Fitch’s paradox is given, where no special rules of inference are assumed, only axioms. These axioms follow from the familiar assumptions which involve rules of inference. We show (by constructing a model) that by allowing that possibly the knower doesn’t know his own soundness (while still requiring he be sound), Fitch’s paradox is avoided. Provided one is willing to admit that sound knowers may be ignorant of their own soundness, this might offer a way out (...) of the paradox. (shrink)

There is a very plausible principle linking abilities and possibilities: If S is able to Φ, then it is metaphysically possible that S Φ’s. Jack Spencer recently proposed a class of counterexamples to this principle involving the ability to know certain propositions. I renew an argument against these counterexamples based on the unknowability of Fitch propositions. In doing so, I provide a new argument for the unknowability of Fitch propositions and show that Spencer’s counterexamples are in tension with (...) a principle weaker than the one linking abilities and possibilities. (shrink)

1) We will begin by offering a short introduction to Epistemic Logic and presenting Fitch’s paradox in an epistemic‑modal logic. (2) Then, we will proceed to presenting three Epistemic Temporal logical frameworks creat‑ ed by Hoshi (2009) : TPAL (Temporal Public Announcement Logic), TAPAL (Temporal Arbitrary Public Announcement Logic) and TPAL+P ! (Temporal Public Announcement Logic with Labeled Past Operators). We will show how Hoshi stated the Verificationist Thesis in the language of TAPAL and analyze his argument on why (...) this version of it is immune from paradox. (3) Edgington (1985) offered an interpretation of the Verificationist Thesis that blocks Fitch’s paradox and we will propose a way to formulate it in a TAPAL‑based lan‑ guage. The language we will use is a combination of TAPAL and TPAL+P ! with an Indefinite (Unlabeled) Past Operator (TAPAL+P !+P). Using indexed satisfi‑ ability relations (as introduced in (Wang 2010 ; 2011)) we will offer a prospec ‑ tive semantics for this language. We will investigate whether the tentative re‑ formulation of Edgington’s Verificationist Thesis in TAPAL+P !+P is free from paradox and adequate to Edgington’s ideas on how „all truths are knowable“ should be interpreted. (shrink)

In a recent paper, Alexander argues that relaxing the requirement that sound knowers know their own soundness might provide a solution to Fitch’s paradox and introduces a suitable axiomatic system where the paradox is avoided. In this paper an analysis of this solution is proposed according to which the effective move for solving the paradox depends on the axiomatic treatment of the ontic modality rather than the limitations imposed on the epistemic one. It is then shown that, once the (...) ontic modality is standardly introduced, the paradox still follows and, in addition, some puzzling consequences arise. (shrink)

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 this argument, knowability is analyzed in terms of having the possibility to know. Several philosophers have objected to this analysis, because it turns knowability into a nonfactive notion. In addition, they claim that, if the knowability thesis is reformulated with the help of factive concepts of knowability, then omniscience can be avoided. In (...) this article we will look closer at two proposals along these lines :557–568, 1985; Fuhrmann in Synthese 191:1627–1648, 2014a), because there are formal models available for each. It will be argued that, even though the problem of omniscience can be averted, the problem of possible or potential omniscience cannot: there is an accessible state at which all truths are known. Furthermore, it will be argued that possible or potential omniscience is a price that is too high to pay. Others who have proposed to solve the paradox with the help of a factive concept of knowability should take note :53–73, 2010; Spencer in Mind 126:466–497, 2017). (shrink)

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)

Fitch's knowability paradox shows that for each unknown truth there is also an unknowable truth, a result which has been thought both odd in itself and at odds with views which impose epistemic constraints on truth and/or meaningfulness. Here a solution is considered which has received little attention in the debate but which carries prima facie plausibility. The decidability solution is to accept that Fitch sentences are unknowably true but deny the significance of this on the grounds that (...) Fitch sentences are nevertheless decidable. The decidability solution is particularly attractive for those whose primary concern is an epistemic constraint on meaningfulness (‘verificationists’). For those whose main concern is truth (‘anti-realists’), the situation is more complex: Melia takes the solution to exonerate anti-realism completely; Williamson sees it as completely irrelevant. The truth lies between these two extremes: there is one broad anti-realist commitment to which the solution does not apply, but there is also one, the “fundamental tenet” of anti-realism according to Dummett, to which it does. (shrink)

Fitch's Paradox and the Paradox of the Knower both make use of the Factivity Principle. The latter also makes use of a second principle, namely the Knowledge-of-Factivity Principle. Both the principle of factivity and the knowledge thereof have been the subject of various discussions, often in conjunction with a third principle known as Closure. In this paper, we examine the well-known Surprise Examination paradox considering both the principles on which this paradox rests and some formal characterisations of the surprise (...) notion, crucial in this paradox. Standard formalizations of the Surprise Examination paradox in modal logic do not seem, at first glance, to depend on either factivity or knowledge-of-factivity, but we will argue that both factivity and knowledge-of-factivity play a key implicit role in the paradox. Namely, they are implicitly, perhaps unintentionally, used in order to simplify the definition of surprise. We analyze modal logical formalizations of three versions of the paradox concluding that the Surprise Examination paradox is the result of two flaws: the assumption of knowledge-of-factivity, and the over-simplification of the definition of "surprise" accordingly. By fixing these two flaws, the Surprise Examination paradox vanishes. (shrink)

Epistemic theories of truth, such as those presumed to be typical for anti-realism, can be characterised as saying that what is true can be known in principle: p → ◊Kp. However, with statements of the form “p & ¬Kp”, a contradiction arises if they are both true and known. Analysis of the nature of the paradox shows that such statements refute epistemic theories of truth only if the the anti-realist motivation for epistemic theories of truth is not taken into account. (...) The motivation in a link of understandability ans meaningful- ness suggests to change the above principle and to restrict the theory to logically simple sentences, in which case the paradox does not arise. This suggestion also allows to see the deep philosophical problems for anti-realism those counterexamples are pointing at. (shrink)

В статье рассмотрена деятельность ведущих кредитных рейтинговых агентств (Fitch Ratings, Moody's Investors Service и Standard & Poor's) в контексте снижения информационной ценности кредитных рейтингов, которые они присваивают, и сохранения доминирующих позиций на рынке финансового рейтингования. Целью исследования является рассмотрение деятельности кредитных рейтинговых агентств в измерении социального конструкционизма в процессе осуществления государственной финансовой политики, объясняя сопротивление регулятивной модели их деятельности многочисленным вызовам и переменам. Подход новой институциональной социологии в управлении мы сделали чувствительным к проблематике институциональных изменений во времени. Таким образом, (...) мы высказались за трактовку вопроса о неизменности организации деятельности КРА в соответствии с условиями нового социологического институционализма. То есть, дается приоритет когнитивной основе институтов, служащей поддержкой конкретного проявления социального порядка и дающей отличный способ для его понимания. (shrink)

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.

Assuming that a paralogism is an unintentionally invalid reasoning, we give an exampli.

Church and Fitch have argued that from the verificationationist thesis “for every proposition, if this proposition is true, then it is possible to know it” we can derive that for every truth there is someone who knows that truth. Moreover, Humberstone has shown that from the latter proposition we can derive that someone knows every truth, hence that there is an omniscient being. In his article “Omnificence”, John Bigelow adapted these arguments in order to argue that from the assumption (...) "every contingent proposition is such that if it is true something brought it about that it is true" we can derive that there is an omnificent being: a being that brings it about that every true contingent proposition is true. In my reply to his article, I show that Bigelow’s argument is flawed because there is some formal property that the knowledge operator has but that the bringing about operator lacks. This is the property of distributing over conjunctions. I explain why what brings it about that some conjunctive proposition is true need not bring it about that its conjuncts are true. (shrink)

A system of logic usually comprises a language for which a model-theory and a proof-theory are defined. The model-theory defines the semantic notion of model-theoretic logical consequence (⊨), while the proof-theory defines the proof- theoretic notion of logical consequence (or logical derivability, ⊢). If the system in question is sound and complete, then the two notions of logical consequence are extensionally equivalent. The concept of full formalization is a more restrictive one and requires in addition the preservation of the standard (...) meanings of the logical terms in all the admissible interpretations of the logical calculus, as it is proof-theoretically defined. Although classical first-order logic is sound and complete, its standard formalizations fall short to be full formalizations since they allow non-intended interpretations. This fact poses a challenge for the logical inferentialism program, whose main tenet is that the meanings of the logical terms are uniquely determined by the formal axioms or rules of inference that govern their use in a logical calculus, i.e., logical inferentialism requires a categorical calculus. This paper is the first part of a more elaborated study which will analyze the categoricity problem from its beginning until the most recent approaches. I will first start by describing the problem of a full formalization in the general framework in which Carnap (1934/1937, 1943) formulated it for classical logic. Then, in sections IV and V, I shall discuss the way in which the mathematicians B.A. Bernstein (1932) and E.V. Huntington (1933) have previously formulated and analyzed it in algebraic terms for propositional logic and, finally, I shall discuss some critical reactions Nagel (1943), Hempel (1943), Fitch (1944), and Church (1944) formulated to these approaches. (shrink)

forall x: Calgary is a full-featured textbook on formal logic. It covers key notions of logic such as consequence and validity of arguments, the syntax of truth-functional propositional logic TFL and truth-table semantics, the syntax of first-order (predicate) logic FOL with identity (first-order interpretations), symbolizing English in TFL and FOL, and Fitch-style natural deduction proof systems for both TFL and FOL. It also deals with some advanced topics such as modal logic, soundness, and functional completeness. Exercises with solutions are (...) available. It is provided in PDF (for screen reading, printing, and a special version for dyslexics), HTML, and in LaTeX source code. (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)

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)

kk states that knowing entails knowing that one knows, and K¬K states that not knowing entails knowing that one does not know. In light of the arguments against kk and K¬K⁠, one might consider modally qualified variants of those principles. According to weak kk, knowing entails the possibility of knowing that one knows. And according to weakK¬K⁠, not knowing entails the possibility of knowing that one does not know. This paper shows that weak kk and weakK¬K are much stronger than (...) they initially appear. Jointly, they entail kk and K¬K⁠. And they are susceptible to variants of the standard arguments against kk and K¬K⁠. This has interesting implications for the debate on positive introspection and for deeper issues concerning the structure and limits of knowability. (shrink)

We present a sound and complete Fitch-style natural deduction system for an S5 modal logic containing an actuality operator, a diagonal necessity operator, and a diagonal possibility operator. The logic is two-dimensional, where we evaluate sentences with respect to both an actual world (first dimension) and a world of evaluation (second dimension). The diagonal necessity operator behaves as a quantifier over every point on the diagonal between actual worlds and worlds of evaluation, while the diagonal possibility quantifies over some (...) point on the diagonal. Thus, they are just like the epistemic operators for apriority and its dual. We take this extension of Fitch’s familiar derivation system to be a very natural one, since the new rules and labeled lines hereby introduced preserve the structure of Fitch’s own rules for the modal case. (shrink)

PARC is an "appended numeral" system of natural deduction that I learned as an undergraduate and have taught for many years. Despite its considerable pedagogical strengths, PARC appears to have never been published. The system features explicit "tracking" of premises and assumptions throughout a derivation, the collapsing of indirect proofs into conditional proofs, and a very simple set of quantificational rules without the long list of exceptions that bedevil students learning existential instantiation and universal generalization. The system can be used (...) with any Copi-style set of inference rules, so it is quite adaptable to many mainstream symbolic logic textbooks. Consequently, PARC may be especially attractive to logic teachers who find Jaskowski/Gentzen-style introduction/elimination rules to be far less "natural" than Copi-style rules. The PARC system is also keyboard-friendly in comparison to the widely adopted Jaskowski-style graphical subproof system of natural deduction, viz., Fitch diagrams and Copi "bent arrow" diagrams. (shrink)

It is often claimed that anti-realism is a form of transcendental idealism or that Kant is an anti-realist. It is also often claimed that anti-realists are committed to some form of knowability principle and that such principles have problematic consequences. It is therefore natural to ask whether Kant is so committed, and if he is, whether this leads him into difficulties. I argue that a standard reading of Kant does indeed have him committed to the claim that all empirical truths (...) are knowable and that this claim entails that there is no empirical truth that is never known. I extend the result to a priori truths and draw some general philosophical lessons from this extension. However, I then propose a re-examination of Kant’s notion of experience according to which he carefully eschews any commitment to empirical knowability. Finally I respond to a remaining problem that stems from a weaker, justified believability principle. (shrink)

De modo geral, este texto é uma incursão em lógica filosófica e filosofia da lógica. Ele contém reflexões originais acerca dos conceitos de paraconsistência, modalidades e cognoscibilidade e suas possíveis relações. De modo específico, o texto avança em quatro direções principais: inicialmente, uma definição genérica de lógicas não clássicas utilizando a ideia de lógica abstrata é sugerida. Em seguida, é mostrado como técnicas manuais de paraconsistentização de lógicas são usadas para gerar sistemas particulares de lógicas paraconsistentes. Depois, uma definição de (...) possibilidade lógica é proposta por meio da ideia de limites de sequências de fórmulas. Por fim, muitas abordagens distintas ao paradoxo de Fitch e, consequentemente, aos limites do conhecimento são apresentadas considerando as reflexões anteriores. (shrink)

This paper addresses a solution due to Michael Fara to the Church/Fitch paradox of knowability. Fara’s solution has significant interest but the paradox can beresurrected within his approach by considering a slightly more complex sentence. The issue of what counts as an epistemological capability for enhanced agents is then discussed with some emphasis on the developmental heritage of agents and their ability to transcend conceptual frameworks.

Blumberg and Holguín present two puzzles regarding the semantics of attitude reports involving conditionals (ie. Attitude-Conditionals) which seem to involve commitments to assertions which entail contradictions, and take this data to call for a revision of our semantics for Attitude-Conditionals. This paper attempts to resolve the puzzles without radically revising our semantics for conditionals. (This is a work in progress. Please ask before citing/circulating.).