G. Priest's anti-consistency argument (Priest 1979, 1984, 1987) and J. R. Lucas's anti-mechanist argument (Lucas 1961, 1968, 1970, 1984) both appeal to Gödel incompleteness. By way of refuting them, this paper defends the thesis of quartet compatibility, viz., that the logic of the mind can simultaneously be Gödel incomplete, consistent, mechanical, and recursion complete (capable of all means of recursion). A representational approach is pursued, which owes its origin to works by, among others, J. Myhill (1964), P. Benacerraf (1967), J. (...) Webb (1980, 1983) and M. Arbib (1987). It is shown that the fallacy shared by the two arguments under discussion lies in misidentifying two systems, the one for which the Gödel sentence is constructable and to be proved, and the other in which the Gödel sentence in question is indeed provable. It follows that the logic of the mind can surpass its own Gödelian limitation not by being inconsistent or non-mechanistic, but by being capable of representing stronger systems in itself; and so can a proper machine. The concepts of representational provability, representational maximality, formal system capacity, etc., are discussed. (shrink)

Francesco Berto has recently written “The Gödel Paradox and Wittgenstein's Reasons,” about a paradox first formulated by Graham Priest in 1971. The major reason for disagreeing with Berto's conclusions concerns his elucidation of Wittgenstein's understanding of Gödel's theorems. Seemingly, Wittgenstein was some kind of proto-paraconsistentist. Priest himself has also, though in a different way, tried to tar Wittgenstein with the same brush. But the resolution of other paradoxes is intimately linked with the resolution of the Gödel Paradox, and with understanding (...) Wittgenstein's views of Gödel's theorems. So this paper discusses some other paradoxes before looking at Wittgenstein's relevant views. (shrink)

En este artículo una paradoja es un tipo de argumentación con respecto a un sujeto X (sea un individuo o una comunidad) en un determinado momento T. Muchas argumentaciones paradójicas tienen lugar en el desarrollo histórico y práctico de las ciencias. Algunas suponen grandes sorpresas acompañadas de profundas crisis, como ocurre con las llamadas antinomias. Solventar, y eventualmente resolver, una paradoja en este sentido supone avances revolucionarios que se obtienen al precio de rechazar creencias previamente asumidas o tenidas por verdaderas (...) por la comunidad científica. El concepto de paradoja que se propone es relativo a sujetos y dinámico en el tiempo. Una argumentación que resulta paradójica para X pudiera no ser paradójica para Y, simplemente porque X e Y no tienen por qué compartir las mismas creencias. Asimismo, X puede descubrir que tiene una paradoja en T, y dejar de tenerla ulteriormente en virtud de un cambio de sus creencias. (shrink)

ABSTRACTA conditional is natural if it fulfils the three following conditions. It coincides with the classical conditional when restricted to the classical values T and F; it satisfies the Modus Ponens; and it is assigned a designated value whenever the value assigned to its antecedent is less than or equal to the value assigned to its consequent. The aim of this paper is to provide a ‘bivalent’ Belnap-Dunn semantics for all natural implicative expansions of Kleene's strong 3-valued matrix with two (...) designated elements. (shrink)

This note is a brief reply to the main argument of Qiuen Yu: 1992, Consistency, Mechanicalness, and the Logic of the Mind,Synthese 90, 145–79.

We have seen that proofs of soundness of (Boolean) DS, EFQ and of ABS — and hence the legitimation of these inferences — can be achieved only be appealing to the very form of reasoning in question. But this by no means implies that we have to fall back on classical reasoning willy-nilly. Many logical theories can provide the relevant boot-strapping. Decision between them has, therefore, to be made on other grounds. The grounds include the many criteria familiar from the (...) philosophy of science: theoretical integrity (e.g., paucity of ad hoc hypotheses), adequacy to the data (explaining the data of inference —all inferences, not just those chosen from consistent domains!) and so on. This paper has not attempted to address these issues in general. All it demonstrates is that the charge that a dialetheist solution to the semantic paradoxes can be maintained only by making some intelligible notion ineffable cannot be made to stick. The dialetheist has a coherent position, endorsing the T-scheme, but rejecting DS, EFQ (even Boolean DS and EFQ) and ABS. And any argument to the effect that the relevant notions are both ineffable and intelligible begs the question. The case against consistent “solutions” to the semantic paradoxes therefore remains intact. (shrink)

B. Kooi and A. Tamminga present a correspondence analysis for extensions of G. Priest’s logic of paradox. Each unary or binary extension is characterizable by a special operator and analyzable via a sound and complete natural deduction system. The present paper develops a sound and complete proof searching technique for the binary extensions of the logic of paradox.

In this paper, I present a novel paradox that pertains to a variety of representational states and activities. I begin by proving that there are certain contingently true propositions that no one can occurrently believe. Then, I use this to develop a further proof by which I derive a contradiction, thus giving us the paradox. Next, I differentiate the paradox from the Liar Paradox, and I show how a common response to the different variations of the Liar Paradox fails to (...) avoid the type of paradox provided in this paper. Finally, I demonstrate how the general ideas behind the paradox regarding occurrent belief can be extended to a wide range of other representational states and activities. (shrink)

Most discussions frame the Liar Paradox as a formal logical-linguistic puzzle. Attempts to resolve the paradox have focused very little so far on aspects of cognitive psychology and processing, because semantic and cognitive-psychological issues are generally assumed to be disjunct. I provide a motivation and carry out a cognitive-computational treatment of the liar paradox based on a model of language and conceptual knowledge within the Predictive Processing framework. I suggest that the paradox arises as a failure of synchronization between two (...) ways of generating the liar situation in two different PP sub-models, one corresponding to language processing and the other to the processing of meaning and world-knowledge. In this way, I put forward the claim that the liar sentence is meaningless but has an air of meaningfulness. I address the possible objection that the proposal violates the Principle of Unrestricted Compositionality, which purportedly regulates the conceptual competence of thinkers. (shrink)

Most discussions frame the Liar Paradox as a formal logical-linguistic puzzle. Attempts to resolve the paradox have focused very little so far on aspects of cognitive psychology and processing, because semantic and cognitive-psychological issues are generally assumed to be disjunct. I provide a motivation and carry out a cognitive-computational treatment of the liar paradox based on a model of language and conceptual knowledge within thePredictive Processing(PP) framework. I suggest that the paradox arises as a failure of synchronization between two ways (...) of generating the liar situation in two different (idealized) PP sub-models, one corresponding to language processing and the other to the processing of meaning and world-knowledge. In this way, I put forward the claim that the liar sentence is meaningless but has an air of meaningfulness. I address the possible objection that the proposal violates thePrinciple of Unrestricted Compositionality, which purportedly regulates the conceptual competence of thinkers. (shrink)

Most discussions frame the Liar Paradox as a formal logical-linguistic puzzle. Attempts to resolve the paradox have focused very little so far on aspects of cognitive psychology and processing, because semantic and cognitive-psychological issues are generally assumed to be disjunct. I provide a motivation and carry out a cognitive-computational treatment of the liar paradox based on a cognitive-computational model of language and conceptual knowledge within the Predictive Processing framework. I suggest that the paradox arises as a failure of synchronization between (...) two ways of generating the liar situation in two different PP sub-models, one corresponding to language processing and the other to the processing of meaning and world-knowledge. In this way, I put forward the claim that the liar sentence is meaningless but has an air of meaningfulness. I address the possible objection that the proposal violates the Principle of Unrestricted Compositionality, which purportedly regulates the conceptual competence of thinkers. (shrink)

Many have contended that non-classical logicians have failed at providing evidence of paraconsistent logics being applicable in cases of inconsistency toleration in the sciences. With this in mind, my main concern here is methodological. I aim at addressing the question of how should we study and explain cases of inconsistent science, using paraconsistent tools, without ruining into the most common methodological mistakes. My response is divided into two main parts: first, I provide some methodological guidance on how to approach cases (...) of inconsistent science; and second, I focus on a peculiar type of formal methodologies for the scrutiny of inconsistent reasoning, the _Paraconsistent Alternative Approach_ (henceforth, PAA) and argue that PAA can enhance a more accurate understanding of sensible reasoning in inconsistent contexts. (shrink)

According to some scholars, such as Rodych and Steiner, Wittgenstein objects to Gödel’s undecidability proof of his formula $$G$$, arguing that given a proof of $$G$$, one could relinquish the meta-mathematical interpretation of $$G$$ instead of relinquishing the assumption that Principia Mathematica is correct. Most scholars agree that such an objection, be it Wittgenstein’s or not, rests on an inadequate understanding of Gödel’s proof. In this paper, I argue that there is a possible reading of such an objection that is, (...) in fact, reasonable and related to Gödel’s proof. (shrink)

Imagine the following situation: an act of violent assault has been committed. And there are only two possible suspects, of which one is a small and weak man and the other a big and strong man. The weak man will plead that he is not strong enough and therefore not likely to have committed the crime, which seems reasonable straight away. But there will also be a loophole for the strong man, as Aristotle tells us, who reports exactly that story (...) in book 2, chapter 24, of his Rhetoric. And he also has a name to assign to the inventor of that kind of argument (1402a17–20):The Art of Corax is composed of this topic. For if a man is not likely to be guilty of what he is accused of, for instance if, being weak, he is .. (shrink)

According to the revision theory of truth, the binary sequences generated by the paradoxical sentences in revision sequence are always unstable. In this paper, we work backwards, trying to reconstruct the paradoxical sentences from some of their binary sequences. We give a general procedure of constructing paradoxes with specific binary sequences through some typical examples. Particularly, we construct what Herzberger called “unstable statements with unpredictably complicated variations in truth value.” Besides, we also construct those paradoxes with infinitely many finite primary (...) periods but without any infinite primary period, those with an infinite critical point but without any finite primary period, and so on. This is the first formal appearance of these paradoxes. Our construction demonstrates that the binary sequences generated by a paradoxical sentence are something like genes from which we can even rebuild the original sentence itself. (shrink)

An approach to the treatment of inference in the presence of uncertain truth values is described, based on representing uncertainties by sets of ordinary (certain) truth values. Both the algebraic and the logical aspects are studied for a variety of lattices used as truth value spaces in the domain of many-valued logic.

ABSTRACT In the paper we present a survey of some approaches to the semantics of many-valued propositional systems. These approaches are inspired on one hand by classical problems in the investigations of logical aspects of epistemic activity: knowledge and truth, contradictions, beliefs, reliability of data, etc. On the other hand they reflect contemporary concerns of researchers in Artificial Intelligence (and Cognitive Science in general) with inferences drawn from imperfect information, even from total ignorance. We treat the mathematical apparatus that has (...) emerged recently: algebraic structures related to the new logical systems in the same way Boolean algebras correspond to classical logic. (shrink)

The present article critically examines three aspects of Graham Priest's dialetheic analysis of very important kinds of limitations (the limit of what can be expressed, described, conceived, known, or the limit of some operation or other). First, it is shown that Priest's considerations focusing on Hegel's account of the infinite cannot be sustained, mainly because Priest seems to rely on a too restrictive notion of object. Second, we discuss Priest's treatment of the paradoxes in Cantorian set-theory. It is shown that (...) Priest does not address the issue in full generality; rather, he relies on a reading of Cantor which implicitly attributes a very strong principle concerning quantification over arbitrary domains to Cantor. Third, the main piece of Priest's work, the so-called “inclosure schema”, is investigated. This schema is supposed to formalize the core of many well-known paradoxes. We claim, however, that formally the schema is not sound. (shrink)

In this paper we intend to outline an introduction to Situation Theory as an approach to the liar paradoxes. This idea was first presented by the work of Barwise and Etchemendy ). First we introduce the paradoxes in their most appealing and important versions. Second we show that non-classical approaches on the problem usually get puzzled by the revenge problem on one side and loss of expressive power on the other side. Last, we present Situation Theory and try to show (...) how it is capable of solving the old paradoxes and blocking revenge. The price we pay on this view is universality, since it would allow a new revenge situated liar. We don’t intend to address the problem of universality here, but we try at least to motivate the reader to make sense of this theory. (shrink)

I provide an interpretation of Wittgenstein's much criticized remarks on Gödel's First Incompleteness Theorem in the light of paraconsistent arithmetics: in taking Gödel's proof as a paradoxical derivation, Wittgenstein was right, given his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the models of paraconsistent arithmetics (obtained via the Meyer-Mortensen (...) collapsing filter on the standard model) match with many intuitions underlying Wittgensteins philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any meaningful mathematical question. (shrink)

An interpretation of Wittgenstein’s much criticized remarks on Gödel’s First Incompleteness Theorem is provided in the light of paraconsistent arithmetic: in taking Gödel’s proof as a paradoxical derivation, Wittgenstein was drawing the consequences of his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. It is shown that the features of paraconsistent arithmetics match (...) with some intuitions underlying Wittgenstein’s philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any mathematical question. (shrink)

In his famous work on vagueness, Russell named “fallacy of verbalism” the fallacy that consists in mistaking the properties of words for the properties of things. In this paper, I examine two (clusters of) mainstream paraconsistent logical theories – the non-adjunctive and relevant approaches –, and show that, if they are given a strongly paraconsistent or dialetheic reading, the charge of committing the Russellian Fallacy can be raised against them in a sophisticated way, by appealing to the intuitive reading of (...) their underlying semantics. The meaning of “intuitive reading” is clarified by exploiting a well-established distinction between pure and applied semantics. If the proposed arguments go through, the dialetheist or strong paraconsistentist faces the following Dilemma: either she must withdraw her claim to have exhibited true contradictions in a metaphysically robust sense – therefore, inconsistent objects and/or states of affairs that make those contradictions true; or she has to give up realism on truth, and embrace some form of anti-realistic (idealistic, or broadly constructivist) metaphysics. Sticking to the second horn of the Dilemma, though, appears to be promising: it could lead to a collapse of the very distinction, commonly held in the literature, between a weak and a strong form of paraconsistency – and this could be a welcome result for a dialetheist. (shrink)

Philosophical dialetheism, whose main exponent is Graham Priest, claims that some contradictions hold, are true, and it is rational to accept and assert them. Such a position is naturally portrayed as a challenge to the Law of Non-Contradiction (LNC). But all the classic formulations of the LNC are, in a sense, not questioned by a typical dialetheist, since she is (cheerfully) required to accept them by her own theory. The goal of this paper is to develop a formulation of the (...) Law which appears to be unquestionable, in the sense that the Priestian dialetheist is committed to accept it without also accepting something inconsistent with it, on pain of trivialism—that is to say, on pain of lapsing into the position according to which everything is the case. This will be achieved via (a) a discussion of Priest's dialetheic treatment of the notions of rejection and denial; and (b) the characterization of a negation via the primitive intuition of content exclusion. Such a result will not constitute a cheap victory for the friends of consistency. We may just learn that different things have been historically conflated under the label of 'Law of Non-Contradiction'; that dialetheists rightly attack some formulations of the Law, and orthodox logicians and philosophers have been mistaken in assimilating them to the indisputable one. (shrink)

Philosophical applications of familiar paracomplete and paraconsistent logics often rely on an idea of . With respect to the paraconsistent logic LP (the dual of Strong Kleene or K3), such is standardly cashed out via an LP-based nonmonotonic logic due to Priest (1991, 2006a). In this paper, I offer an alternative approach via a monotonic multiple-conclusion version of LP.

§1. Introduction. The problem raised by the liar paradox has long been an intriguing challenge for all those interested in the concept of truth. Many “solutions” have been proposed to solve or avoid the paradox, either prescribing some linguistical restriction, or giving up the classical true-false bivalence or assuming some kind of contextual dependence of truth, among other possibilities. We shall not discuss these different approaches to the subject in this paper, but we shall concentrate on a kind of formal (...) construction which was originated by Kripke's paper “Outline of a theory of truth” [11] and which, in different forms, reappears in later papers by various authors.The main idea can be presented as follows: assume a first order language ℒ containing, among other unspecified symbols, a predicate symbolTintended to represent the truth predicate for ℒ. Assume, also, a fixed modelM= 〈D, I〉 whereDcontains all sentences of ℒ andIinterprets all non-logical symbols of ℒ exceptTin the usual way. In general,Dmight contain many objects other than sentences of ℒ but as that would raise the problem of the meaning of sentences in whichTis applied to one of these objects, we shall assume that this is not the case. (shrink)

In this paper, we present a non-trivial and expressively complete paraconsistent naïve theory of truth, as a step in the route towards semantic closure. We achieve this goal by expressing self-reference with a weak procedure, that uses equivalences between expressions of the language, as opposed to a strong procedure, that uses identities. Finally, we make some remarks regarding the sense in which the theory of truth discussed has a property closely related to functional completeness, and we present a sound and (...) complete three-sided sequent calculus for this expressively rich theory. (shrink)

Over the past 25 years, Graham Priest has ably presented and defended dialetheism, the view that certain sentences are properly characterized as true with true negations. Our goal here is neither to quibble with the tenability of true, assertable contradictions nor, really, with the arguments for dialetheism. Rather, we wish to address the dialetheist's treatment of cases of semantic pathology and to pose a worry for dialetheism that has not been adequately considered. The problem that we present seems to have (...) broader bite, afflicting both consistent and inconsistent proposals for resolving semantic pathology. Thus, while our primary goal is to uncover some important connections between dialetheism, semantic pathology, and other, more general issues, the problem that we pose might be a worry for anyone who aims to resolve semantic pathology - consistently or not. (shrink)

Logic: the Basics is an accessible introduction to the core philosophy topic of standard logic. Focussing on traditional Classical Logic the book deals with topics such as mathematical preliminaries, propositional logic, monadic quantified logic, polyadic quantified logic, and English and standard ‘symbolic transitions’. With exercises and sample answers throughout this thoroughly revised new edition not only comprehensively covers the core topics at introductory level but also gives the reader an idea of how they can take their knowledge further and the (...) philosophical questions around logic. -/- Logic: the Basics is essential reading for first-year undergraduate philosophy students on standard introductory logic courses. (shrink)

O objetivo geral da pesquisa da qual esse artigo faz parte é investigar o sistema metafísico que emerge dos trabalhos de David Lewis. Esse sistema pode ser decomposto em pelo menos duas teorias. A primeira nomeada como realismo modal genuíno (RMG) e a segunda como mosaico neo-humeano. O RMG é, sem dúvida, mais popular e defende a hipótese metafísica da existência de uma pluralidade de mundos possíveis. A principal razão em favor dessa hipótese é a sua aplicabilidade na discussão de (...) problemas losó cos, esse motivo não será diretamente abordado neste artigo. Pois, o foco está em compreender o mosaico neo-humea- no e como ele relaciona-se com a metafísica de mundos possíveis. Em outras palavras, o meu objetivo é entender as bases losó cas que sus- tentam o realismo modal genuíno. (shrink)

Special issue: "Reflecting on the Legacy of C.I. Lewis: Contemporary and Historical Perspectives on Modal Logic".

Dialetheism is the view that there exists a true contradiction. This paper ventures to suggest that Priest’s argument for Dialetheism from Gödel’s theorem is unconvincing as the lesson of Gödel’s proof (or Rosser’s proof) is that any sufficiently strong theories of arithmetic cannot be both complete and consistent. In addition, a contradiction is derivable in Priest’s inconsistent and complete arithmetic. An alternative argument for Dialetheism is given by applying Gödel sentence to the inconsistent and complete theory of arithmetic. We argue, (...) however, that the alternative argument raises a circularity problem. In sum, Gödel’s and its related theorem merely show the relation between a complete and a consistent theory. A contradiction derived by the application of Gödel sentence has the value of true sentences, i.e. the both-value, only under the inconsistent models for arithmetic. Without having the assumption of inconsistency or completeness, a true contradiction is not derivable from the application of Gödel sentence. Hence, Gödel’s and its related theorem never can be a ground for Dialetheism. (shrink)

This presentation traces an historical root of the reductio ad absurdum mode of argumentation in Greek philosophy. I propose a new understanding of the liar paradox as an instance of this mode of argumentation. I show that the paradox was crea ted as part of a refutational argument in the controversy over the justification of realism and the realists concepts of truth and certainty. The paradox was part of the dialectical style of Greek scepticism, which was characterized, inter alia, by (...) the u se of the reductio ad absurdum. The paradox turns out to be a metaphysical and epistemological argument. (shrink)