The paper attempts to give a solution to the Fitch's paradox though the strategy of the reformulation of the paradox in temporal logic, and a notion of knowledge which is a kind of ceteris paribus modality. An analogous solution has been offered in a different context to solve the problem of metaphysical determinism.

Perennial philosophers' hopes are unlikely victims of swift, natural deduction. Yet anti-realism has been thought one. Not hoping for anti-realism myself I here show it, lest it be underestimated, to survive the following argument, adapted from W. D.Hart pp. 156, 164-5; he credits first publication to Fitch).

The knowability paradox is an instance of a remarkable reasoning pattern (actually, a pair of such patterns), in the course of which an occurrence of the possibility operator, the diamond, disappears. In the present paper, it is pointed out how the unwanted disappearance of the diamond may be escaped. The emphasis is not laid on a discussion of the contentious premise of the knowability paradox, namely that all truths are possibly known, but on how from this assumption the conclusion is (...) derived that all truths are, in fact, known. Nevertheless, the solution offered is in the spirit of the constructivist attitude usually maintained by defenders of the anti-realist premise. In order to avoid the paradoxical reasoning, a paraconsistent constructive relevant modal epistemic logic with strong negation is defined semantically. The system is axiomatized and shown to be complete. (shrink)

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much (...) more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included. (shrink)

The well-known argument of Frederick Fitch, purporting to show that verificationism (= Truth implies knowability) entails the absurd conclusion that all the truths are known, has been disarmed by Dorothy Edgington''s suggestion that the proper formulation of verificationism presupposes that we make use of anactuality operator along with the standardly invoked epistemic and modal operators. According to her interpretation of verificationism, the actual truth of a proposition implies that it could be known in some possible situation that the proposition holds (...) in theactual situation. Thus, suppose that our object language contains the operatorA — it is actually the case that ... — with the following truth condition: vA iff w0, wherew 0 stands for the designated world of the model — the actual world. Then we can formalize the verificationist claim as follows. (shrink)

The present work is motivated by two questions. (1) What should an intuitionistic epistemic logic look like? (2) How should one interpret the knowledge operator in a Kripke-model for it? In what follows we outline an answer to (2) and give a model-theoretic definition of the operator K. This will shed some light also on (1), since it turns out that K, defined as we do, fulfills the properties of a necessity operator for a normal modal logic. The interest of (...) our construction also lies in a better insight into the intuitionistic solution to Fitch's paradox, which is discussed in the third section. In particular we examine, in the light of our definition, De Vidi and Solomon's proposal of formulating the verification thesis as Φ → ¬¬KΦ. We show, as our main result, that this definition excapes the paradox, though it is validated only under restrictive conditions on the models. (shrink)

The paradox of knowability is a logical result suggesting that, necessarily, if all truths are knowable in principle then all truths are in fact known. The contrapositive of the result says, necessarily, if in fact there is an unknown truth, then there is a truth that couldn't possibly be known. More specifically, if p is a truth that is never known then it is unknowable that p is a truth that is never known. The proof has been used to argue (...) against versions of anti-realism committed to the thesis that all truths are knowable. For clearly there are unknown truths; individually and collectively we are non-omniscient. So, by the main result, it is false that all truths are knowable. The result has also been used to draw more general lessons about the limits of human knowledge. Still others have taken the proof to be fallacious, since it collapses an apparently moderate brand of anti-realism into an obviously implausible and naive idealism. (shrink)

A general method for generating contraction- and cut-free sequent calculi for a large family of normal modal logics is presented. The method covers all modal logics characterized by Kripke frames determined by universal or geometric properties and it can be extended to treat also Gödel-Löb provability logic. The calculi provide direct decision methods through terminating proof search. Syntactic proofs of modal undefinability results are obtained in the form of conservativity theorems.

A way is found to add axioms to sequent calculi that maintains the eliminability of cut, through the representation of axioms as rules of inference of a suitable form. By this method, the structural analysis of proofs is extended from pure logic to free-variable theories, covering all classical theories, and a wide class of constructive theories. All results are proved for systems in which also the rules of weakening and contraction can be eliminated. Applications include a system of predicate logic (...) with equality in which also cuts on the equality axioms are eliminated. (shrink)

Geometric theories are presented as contraction- and cut-free systems of sequent calculi with mathematical rules following a prescribed rule-scheme that extends the scheme given in Negri and von Plato. Examples include cut-free calculi for Robinson arithmetic and real closed fields. As an immediate consequence of cut elimination, it is shown that if a geometric implication is classically derivable from a geometric theory then it is intuitionistically derivable.

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

Kripke-style models with two accessibility relations, one intuitionistic and the other modal, are given for analogues of the modal systemK based on Heyting's prepositional logic. It is shown that these two relations can combine with each other in various ways. Soundness and completeness are proved for systems with only the necessity operator, or only the possibility operator, or both. Embeddings in modal systems with several modal operators, based on classical propositional logic, are also considered. This paper lays the ground for (...) an investigation of intuitionistic analogues of systems stronger thanK. A brief survey is given of the existing literature on intuitionistic modal logic. (shrink)

I have argued that without an adequate solution to the knower paradox Fitch's Proof is- or at least ought to be-ineffective against verificationism. Of course, in order to follow my suggestion verificationists must maintain that there is currently no adequate solution to the knower paradox, and that the paradox continues to provide prima facie evidence of inconsistent knowledge. By my lights, any glimpse at the literature on paradoxes offers strong support for the first thesis, and any honest, non-dogmatic reflection on (...) the knower paradox provides strong support for the second. Whether verificationists want to go the route I've suggested is not for me todecide. As in the previous section my aim has been that of defending the mere viability of verificationism in the face of what many, many philosophers have taken to be its death-knell, namely Fitch's Proof. But, as the final objection makes clear, showing that verificationism can live in the face of Fitch's Proof is one thing; showing that it should live is another project. If nothing else, I hope that this papershows that verificationists still have a project to pursue; Fitch's Proof, contrary to popular opinion, need not bury verificationism.13. (shrink)

Consequence is at the heart of logic; an account of consequence, of what follows from what, offers a vital tool in the evaluation of arguments. Since philosophy itself proceeds by way of argument and inference, a clear view of what logical consequence amounts to is of central importance to the whole discipline. In this book JC Beall and Greg Restall present and defend what thay call logical pluralism, the view that there is more than one genuine deductive consequence relation, a (...) position which has profound implications for many linguists as well as for philosophers. We should not search for one true logic, since there are many. (shrink)

Various sources in the literature claim that the deduction theorem does not hold for normal modal or epistemic logic, whereas others present versions of the deduction theorem for several normal modal systems. It is shown here that the apparent problem arises from an objectionable notion of derivability from assumptions in an axiomatic system. When a traditional Hilbert-type system of axiomatic logic is generalized into a system for derivations from assumptions, the necessitation rule has to be modified in a way that (...) restricts its use to cases in which the premiss does not depend on assumptions. This restriction is entirely analogous to the restriction of the rule of universal generalization of first-order logic. A necessitation rule with this restriction permits a proof of the deduction theorem in its usual formulation. Other suggestions presented in the literature to deal with the problem are reviewed, and the present solution is argued to be preferable to the other alternatives. A contraction-and cut-free sequent calculus equivalent to the Hubert system for basic modal logic shows the standard failure argument untenable by proving the underivability of DA from A. (shrink)

Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is presented, together with an easy cut-admissibility proof; both extend to cover, in a uniform fashion, all intermediate logics characterised by frames satisfying conditions expressible by one or more geometric implications. Each of these logics is embedded by the Gödel–McKinsey–Tarski translation into an extension of S4. Faithfulness of the embedding is proved in a simple and general way by constructive proof-theoretic methods, without appeal to semantics other than in the (...) explanation of the rules. (shrink)

The paradox of knowability and the debate about it are shortly presented. Some assumptions which appear more or less tacitly involved in its discussion are made explicit. They are embedded and integrated in a Russellian framework, where a formal paradox, very similar to the Russell-Myhill paradox, is derived. Its solution is provided within a Russellian formal logic introduced by A. Church. It follows that knowledge should be typed. Some relevant aspects of the typing of knowledge are pointed out.

The Taming of the True poses a broad challenge to realist views of meaning and truth that have been prominent in recent philosophy. Neil Tennant argues compellingly that every truth is knowable, and that an effective logical system can be based on this principle. He lays the foundations for global semantic anti-realism and extends its consequences from the philosophy of mathematics and logic to the theory of meaning, metaphysics, and epistemology.

This book continues from where the authors' previous book, Structural Proof Theory, ended. It presents an extension of the methods of analysis of proofs in pure logic to elementary axiomatic systems and to what is known as philosophical logic. A self-contained brief introduction to the proof theory of pure logic is included that serves both the mathematically and philosophically oriented reader. The method is built up gradually, with examples drawn from theories of order, lattice theory and elementary geometry. The aim (...) is, in each of the examples, to help the reader grasp the combinatorial behaviour of an axiom system, which typically leads to decidability results. The last part presents, as an application and extension of all that precedes it, a proof-theoretical approach to the Kripke semantics of modal and related logics, with a great number of new results, providing essential reading for mathematical and philosophical logicians. (shrink)

According to the “knowability thesis,” every truth is knowable. Fitch’s paradox refutes the knowability thesis by showing that if we are not omniscient, then not only are some truths not known, but there are some truths that are not knowable. In this paper, I propose a weakening of the knowability thesis (which I call the “conjunctive knowability thesis”) to the e:ect that for every truth p there is a collection of truths such that (i) each of them is knowable and (...) (ii) their conjunction is equivalent to p. I show that the conjunctive knowability thesis avoids triviality arguments against it, and that it fares very di:erently depending on another thesis connecting knowledge and possibility. If there are two propositions, inconsistent with one another, but both knowable, then the conjunctive knowability thesis is trivially true. On the other hand, if knowability entails truth, the conjunctive knowability thesis is coherent, but only if the logic of possibility is weak. (shrink)

This study continues the anti-realist’s quest for a principled way to avoid Fitch’s paradox. It is proposed that the Cartesian restriction on the anti-realist’s knowability principle ‘ϕ, therefore 3Kϕ’ should be formulated as a consistency requirement not on the premise ϕ of an application of the rule, but rather on the set of assumptions on which the relevant occurrence of ϕ depends. It is stressed, by reference to illustrative proofs, how important it is to have proofs in normal form before (...) applying the proposed restriction. A similar restriction is proposed for the converse inference, the so-called Rule of Factiveness ‘3Kϕ therefore ϕ’. The proposed restriction appears to block another Fitch-style derivation that uses the KK -thesis in order to get around.. (shrink)