Online research in philosophy

While the analytical philosophy of science regards inconsistent theories as disastrous, Chomsky allows for the temporary tolerance of inconsistency between the hypotheses and the data. However, in linguistics there seem to be several types of inconsistency. The present paper aims at the development of a novel metatheoretical framework which provides tools for the representation and evaluation of inconsistencies in linguistic theories. The metatheoretical model relies on a system of paraconsistent logic and distinguishes between strong and weak inconsistency. Strong inconsistency is (...) destructive in that it leads to logical chaos. In contrast, weak inconsistency may be constructive, because it is capable of accounting for the simultaneous presence of seemingly incompatible structures. However, paraconsistent logic cannot grasp the dynamism of the emergence and resolution of weak inconsistencies. Therefore, the metatheoretical approach is extended to plausible argumentation. The workability of this metatheoretical model is tested with the help of a detailed case study on an analysis of discontinuous constituents in Government-Binding Theory. (shrink)

No Órganon Aristóteles descreve alguns esquemas dedutivos nos quais a presença de inconsistências não acarreta a trivialização da teoria lógica envolvida. Esta tese é corroborada por três diferentes situações teóricas estudadas por ele, as quais são apresentadas neste trabalho. Analizamos o esquema de inferência utilizado por Aristóteles no Protrepticus e o método de demonstração indireta para os silogismos categóricos. Ambos os métodos exemplificam como Aristóteles emprega estratégias de redução ao absurdo logicamente clássicas. Na sequência, discutimos os silogismos válidos a partir (...) de premissas opostas (contrárias e contraditórias) estudadas pelo Estagirita no Analytica Priora (B15). De acordo com o autor, os seguintes silogismos são válidos a partir de premissas opostas, nos quais letras latinas minúsculas denotam termos como sujeito e predicado, enquanto que letras latinas maiúsculas denotam proposições categóricas tal como na notação tradicional: (i) na segunda figura, Eba,Aba ` Eaa (Cesare), Aba, Eba ` Eaa (Camestres), Eba, I ba ` Oaa (Festino), e Aba,Oba ` Oaa (Baroco); (ii) na terceira, Eab,Aab ` Oaa (Felapton), Oab,Aab ` Oaa (Bocardo) e Eab, Iab ` Oaa (Ferison). Por fim, discutimos a passagem do Analytica Posteriora (A11) no qual Aristóteles enuncia que o Princípio de Não-Contradição não é, em geral, pressuposto de toda demonstração (silogismo científico), mas apenas daquelas nas quais a conclusão deve ser provada a partir do Princípio; o Estagirita enuncia que se um silogismo da primeira figura tiver o termo maior consistente, os outros termos da demonstração podem ser separadamente inconsistentes. Estes resultados permitem-nos propor uma interpretação de sua teoria dedutiva como uma teoria paraconsistente lato sensu. Primeiramente, efetuamos uma análise hermenêutica, avaliando seu significado lógico e a correlação desses resultados com outros aspectos da filosofia de Aristóteles. Em segundo lugar, consignamos uma interpretação dos silogismos aristotélicos a partir de premissas opostas à luz dos antilogismos propostos por Christine Ladd-Franklin em 1883, e da demonstração aristotélica com termos inconsistentes nas lógicas paraconsistentes Cn, 1 n !, introduzidas por da Costa em 1963. Esses dois aspectos não parecem ter sido ainda detalhadamente analisados na literatura. DOI:10.5007/1808-1711.2010v14n1p71. (shrink)

Celebrando o papel de Newton da Costa na história da paraconsistência, este trabalho examina o uso e abuso da deliberada auto-contradição. Iniciado por Parmênides, desenvolvido por Platão, e continuado por Cícero, uma antiga tradição filosófica usava deliberadamente discursos paraconsistentes para revelar a verdade. Nos tempos modernos, o decisionismo tem usado uma deliberada auto-contradição contra a revelação Judaico-Cristã. DOI:10.5007/1808-1711.2010v14n1p1.

Paraconsistent approaches have received little attention in the literature on vagueness (at least compared to other proposals). The reason seems to be that many philosophers have found the idea that a contradiction might be true (or that a sentence and its negation might both be true) hard to swallow. Even advocates of paraconsistency on vagueness do not look very convinced when they consider this fact; since they seem to have spent more time arguing that paraconsistent theories are at least (...) as good as their paracomplete counterparts, than giving positive reasons to believe on a particular paraconsistent proposal. But it sometimes happens that the weakness of a theory turns out to be its mayor ally, and this is what (I claim) happens in a particular paraconsistent proposal known as subvaluationism. In order to make room for truth-value gluts subvaluationism needs to endorse a notion of logical consequence that is, in some sense, weaker than standard notions of consequence. But this weakness allows the subvaluationist theory to accommodate higher-order vagueness in a way that it is not available to other theories of vagueness (such as, for example, its paracomplete counterpart, supervaluationism). (shrink)

When physicists disagree as to whose theory is right, they can (if we radically idealize) form an experiment whose results will settle the difference. When logicians disagree, there seems to be no possibility of resolution in this manner. In Paradox and Paraconsistency John Woods presents a picture of disagreement among logicians, mathematicians, and other “abstract scientists” and points to some methods for resolving such disagreement. Our review begins with (very) short sketches of the chapters. Following the sketches, we respond (...) to a few of Woods’ arguments. (shrink)

In this expository paper, we examine some philosophical and technical issues brought by paraconsistency (such as, motivations for developing a paraconsistent logic, the nature of this logic, and its application to set theory). We also suggest a way of accommodating these issues by considering some problems in the philosophy of logic from a new perspective.

In a standard sense, consistency and paraconsistency are understood as the absence of any contradiction and as the absence of the ECQ (‘E contradictione quodlibet’) rule, respectively. The concepts of weak consistency (in two different senses) as well as that of F -consistency have been defined by the authors. The aim of this paper is (a) to define alternative (to the standard one) concepts of paraconsistency in respect of the aforementioned notions of weak consistency and F -consistency; (b) (...) to define the concept of strong paraconsistency; (c) to build up a series of strongly paraconsistent logics; (d) to define the basic constructive logic adequate to a rather weak sense of consistency. All logics treated in this paper are strongly paraconsistent. All of them are sound and complete in respect a modification of Routley and Meyer’s ternary relational semantics for relevant logics (no logic in this paper is relevant). (shrink)

Being a pragmatic and not a referential approach tosemantics, the dialogical formulation ofparaconsistency allows the following semantic idea tobe expressed within a semi-formal system: In anargumentation it sometimes makes sense to distinguishbetween the contradiction of one of the argumentationpartners with himself (internal contradiction) and thecontradiction between the partners (externalcontradiction). The idea is that externalcontradiction may involve different semantic contextsin which, say A and ¬A have been asserted.The dialogical approach suggests a way of studying thedynamic process of contradictions through which thetwo (...) contexts evolve for the sake of argumentation intoone system containing both contexts.More technically, we show a new, dialogical, way tobuild paraconsistent systems for propositional andfirst-order logic with classical and intuitionisticfeatures (i.e. paraconsistency both with and withouttertium non-datur) and present theircorresponding tableaux. (shrink)

The first part of this paper presents a sympathetic and critical examination of the approach of Shahid Rahman and Walter Carnielli, as presented in their paper "The Dialogical Approach to Paraconsistency". In the second part, possible extensions are presented and evaluated: (a) top-down analysis of a dialogue situation versus bottom-up, (b) the specific role of ambiguities and how to deal with them, and (c) the problem of common knowledge and background knowledge in dialogues. In the third part, I claim (...) that dialogue logic is the best-suited instrument to analyse paradoxes of the Sorites type. All these considerations lead to philosophically relevant observations concerning principles of charity on the one hand, and compactness on the other. (shrink)

The study of paraconsistent logic as a branch of mathematics and logic has been pioneered by Newton da Costa. With the growing advent of distributed and often inconsistent databases over the last ten years, there has been growing interest in paraconsistency amongst researchers in databases and knowledge bases. In this paper, we provide a brief survey of work in paraconsistent databases and knowledge bases affected by Newton da Costa's important and lasting contributions to the field.

A first-order logic of belief with identity is proposed, primarily to give an account of possible de re contradictory beliefs, which sometimes occur as consequences of de dicto non-contradictory beliefs. A model has two separate, though interconnected domains: the domain of objects and the domain of appearances. The satisfaction of atomic formulas is defined by a particular S-accessibility relation between worlds. Identity is non-classical, and is conceived as an equivalence relation having the classical identity relation as a subset. A tableau (...) system with labels, signs, and suffixes is defined, extending the basic language $\mathscr{L}_{\mathbf{QB}}$ by quasiformulas (to express the denotations of predicates). The proposed logical system is paraconsistent since $\phi \wedge \neg\phi$ does not ``explode'' with arbitrary syntactic consequences. (shrink)

“Paraconsistent” means “beyond the consistent” [3, 15]. Paraconsistent logics tolerate inconsistencies in a way that traditional logics do not. In a paraconsistent logic, the inference of explosion A, ∼AB is rejected. This may be for any of a number of reasons [16]. For proponents of relevance [1, 2] the argument has gone awry when we infer an irrelevant B from the inconsistent premises. Those who argue that inconsistent theories may have some logical content but do not commit us to everything, (...) have reason to think that these theories are closed under a relation of paraconsistent logical consequence [12, 18]. Another reason to adopt a paraconsistent logic is more extreme. You may take the world to be inconsistent [14], and a true theory incorporating this inconsistency must be governed by a paraconsistent logic. (shrink)

In order to develop an account of scientific rationality, two problems need to be addressed: (i) how to make sense of episodes of theory change in science where the lack of a cumulative development is found, and (ii) how to accommodate cases of scientific change where lack of consistency is involved. In this paper, we sketch a model of scientific rationality that accommodates both problems. We first provide a framework within which it is possible to make sense of scientific revolutions, (...) but which still preserves some (partial) relations between old and new theories. The existence of these relations help to explain why the break between different theories is never too radical as to make it impossible for one to interpret the process in perfectly rational terms. We then defend the view that if scientific theories are taken to be quasi-true, and if the underlying logic is paraconsistent, it's perfectly rational for scientists and mathematicians to entertain inconsistent theories without triviality. As a result, as opposed to what is demanded by traditional approaches to rationality, it's not irrational to entertain inconsistent theories. Finally, we conclude the paper by arguing that the view advanced here provides a new way of thinking about the foundations of science. In particular, it extends in important respects both coherentist and foundationalist approaches to knowledge, without the troubles that plague traditional views of scientific rationality. (shrink)

In a famous and controversial paper, B. H. Slater has argued against the possibility of paraconsistent logics. Our reply is centred on the distinction between two aspects of the meaning of a logical constant *c* in a given logic: its operational meaning, given by the operational rules for *c* in a cut-free sequent calculus for the logic at issue, and its global meaning, specified by the sequents containing *c* which can be proved in the same calculus. Subsequently, we use the (...) same strategy to counter Quine's meaning variance argument against deviant logics. In a nutshell, we claim that genuine rivalry between (similar) logics *L* and *L* is possible whenever each constant in *L* has the same operational meaning as its counterpart in *L* although differences in global meaning arise in at least one case. (shrink)

The paper highlights the import of the paraconsistent movement, list some motivations for its origin, and distinguishes some stands with respect to para-consistency. It then discusses some sources of inconsistency that are specific for worldviews, and the import of the paraconsistent turn for the worldviews enterprise.

This paper treats entailment as a subrelation of classical consequence and deducibility. Working with a Gentzen set-sequent system, we define an entailment as a substitution instance of a valid sequent all of whose premisses and conclusions are necessary for its classical validity. We also define a sequent Proof as one in which there are no applications of cut or dilution. The main result is that the entailments are exactly the Provable sequents. There are several important corollaries. Every unsatisfiable set is (...) Provably inconsistent. Every logical consequence of a satisfiable set is Provable therefrom. Thus our system is adequate for ordinary mathematical practice. Moreover, transitivity of Proof fails upon accumulation of Proofs only when the newly combined premisses are inconsistent anyway, or the conclusion is a logical truth. In either case Proofs that show this can be effectively determined from the Proofs given. Thus transitivity fails where it least matters — arguably, where it ought to fail! We show also that entailments hold by virtue of logical form insufficient either to render the premisses inconsistent or to render the conclusion logically true. The Lewis paradoxes are not Provable. Our system is distinct from Anderson and Belnap''s system of first degree entailments, and Johansson''s minimal logic. Although the Curry set paradox is still Provable within naive set theory, our system offers the prospect of a more sensitive paraconsistent reconstruction of mathematics. It may also find applications within the logic of knowledge and belief. (shrink)

This paper develops a new proof method for two propositional paraconsistent logics: the propositional part of Batens' weak paraconsistent logic CLuN and Schütte's maximally paraconsistent logic Φv. Proofs are de.ned as certain sequences of questions. The method is grounded in Inferential Erotetic Logic.

In this paper we call for attention to be paid to the link between logic and geometry. To apply this theme, we survey the connection between n-cubes, Lukasiewicz logics and Ulam games. We then extend what is known to the case where the number of permitted lies in a Ulam game exceeds 1. We conclude by identifying the precise sense in which these logics are paraconsistent.

In this paper, I present the modal adaptive logic $AJ^{r}$ (based on S5) as well as the discussive logic $D_{2}^{r}$ that is defined from it. $D_{2}^{r}$ is a (nonmonotonic) alternative for Jaśkowski's paraconsistent system D₂. Like D₂, $D_{2}^{r}$ validates all single-premise rules of Classical Logic. However, for formulas that behave consistently, $D_{2}^{r}$ moreover validates all multiple-premise rules of Classical Logic. Importantly, and unlike in the case of D₂, this does not require the introduction of discussive connectives. It is argued that (...) this has clear advantages with respect to one of the main application contexts of discussive logics, namely the interpretation of discussions. (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)

Since its first appearance in 1966, the notion of a supervaluation has been regarded by many as a powerful tool for dealing with semantic gaps. Only recently, however, applications to semantic gluts have also been considered. In previous work I proposed a general framework exploiting the intrinsic gap/glut duality. Here I also examine an alternative account where gaps and gluts are treated on a par: although they reflect opposite situations, the semantic upshot is the same in both cases--the value of (...) some expressions is not uniquely defined. Other strategies for generalizing supervaluations are considered and some comparative facts are discussed. (shrink)

Categorical-theoretic semantics for the relevance logic is proposed which is based on the construction of the topos of functors from a relevant algebra (considered as a preorder category endowed with the special endofunctors) in the category of sets Set. The completeness of the relevant system R of entailment is proved in respect to the semantic considered.

The first part of this paper presents asympathetic and critical examination of the approachof Shahid Rahman and Walter Carnielli, as presented intheir paper The Dialogical Approach toParaconsistency. In the second part, possibleextensions are presented and evaluated: (a) top-downanalysis of a dialogue situation versus bottom-up, (b)the specific role of ambiguities and how to deal withthem, and (c) the problem of common knowledge andbackground knowledge in dialogues. In the third part,I claim that dialogue logic is the best-suitedinstrument to analyse paradoxes of the (...) Sorites type.All these considerations lead to philosophicallyrelevant observations concerning principles of charityon the one hand, and compactness on the other. (shrink)

In classical logic, a contradiction allows one to derive every other sentence of the underlying language; paraconsistent logics came relatively recently to subvert this explosive principle, by allowing for the subsistence of contradictory yet non-trivial theories. Therefore our surprise to find Wittgenstein, already at the 1930s, in comments and lectures delivered on the foundations of mathematics, as well as in other writings, counseling a certain tolerance on what concerns the presence of contradictions in a mathematical system. ‘Contradiction. Why just this (...) spectre? This is really very suspicious.’ ( Philosophical Remarks III–56) In the last decades, several authors (e.g. Arrington, Hintikka, Van Heijenoort, Wright, Wrigley) have been digging into Wittgenstein’s rather non-standard standpoint on what concerns the interpretation and import of contradiction in logic and mathematics, and many other authors (e.g. da Costa, Goldstein, Granger, Marconi) have been investigating the possibility of taking Wittgenstein seriously as one of the early forerunners of paraconsistency. While many advances have been made on the first front, the second set of investigations has led almost exclusively to negative results: no, no operational proposal about the construction of a logic in which (some) contradictions are made inoffensive can be read from Wittgenstein’s philosophical work; in fact, it appears that the most one can find there is the exhortation for mathematicians to alter their attitude with respect to contradictions and to consistency proofs. The play is done, and one looks for a resume of the opera. This paper fills that blank, as a thorough investigation of the possible relations between Wittgenstein and paraconsistency. DOI:10.5007/1808-1711.2010v14n1p135. (shrink)

In a world plagued by disagreement and conflict one might expect that the exact sciences of logic and mathematics would provide a safe harbor. In fact these disciplines are rife with internal divisions between different, often incompatible, systems. Do these disagreements admit of resolution? Can such resolution be achieved without disturbing assumptions that the theorems of logic and mathematics state objective truths about the real world? In this original and historically rich book John Woods explores apparently intractable disagreements in logic (...) and the foundations of mathematics and sets out conflict resolution strategies that evade or disarm these stalemates. An important sub-theme of the book is the extent to which pluralism in logic and the philosophy of mathematics undermines realist assumptions. This book makes an important contribution to such areas of philosophy as logic, philosophy of language and argumentation theory. It will also be of interest to mathematicians and computer scientists. (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)

Semantic dialetheists astutely dodge Explosion, the logical contagion of everything being true if a single contradiction is true. A dialetheia is contained in their semantics, and sustained by a paraconsistent logic. Graham Priest has shown that this is a solution to the Liar paradox. I use the Pinocchio paradox, devised by Veronique Eldridge-Smith, as a counter-example. The Pinocchio paradox turns on the truth of Pinocchio, whose nose grows if and only if what he is saying is not true, saying ‘My (...) nose is growing’. It is not just a matter of interpretation whether Pinocchio’s nose is and is not growing. (shrink)

One of Da Costa's motives when he constructed the paraconsistent logic Cw was to dualise the negation of intuitionistic logic. In this paper I explore a different way of going about this task. A logic is defined by taking the Kripke semantics for intuitionistic logic, and dualising the truth conditions for negation. Various properties of the logic are established, including its relation to CWo Tableau and natural deduction systems for the logic are produced, as are appropriate algebraic structures. The paper (...) then investigates dualising the intuitionistic conditional in the same way. This establishes various connections between the logic, and a logic called in the literature 'Brouwerian logic' or 'closed-set logic'. (shrink)

The idea that the phenomenon of vagueness might be modelled by a paraconsistent logic has been little discussed in contemporary work on vagueness, just as the idea that paraconsistent logics might be fruitfully applied to the phenomenon of vagueness has been little discussed in contemporary work on paraconsistency. This is prima facie surprising given that the earliest formalisations of paraconsistent logics presented in Ja´skowski (1948) and Halldén (1949) were presented as logics of vagueness. One possible explanation for this is (...) that, despite initial advocacy by pioneers of paraconsistency, the prospects for a paraconsistent account of vagueness are so poor as to warrant little further consideration. In this paper we look at the reasons that might be offered in defence of this negative claim. As we shall show, they are far from compelling. Paraconsistent accounts of vagueness deserve further attention. (shrink)

On the ground of Kant’s reformulation of the principle of con- tradiction, a non-classical logic KC and its extension KC+ are constructed. In KC and KC+, \neg(\phi \wedge \neg\phi),  \phi \rightarrow (\neg\phi \rightarrow \phi), and  \phi \vee \neg\phi are not valid due to specific changes in the meaning of connectives and quantifiers, although there is the explosion of derivable consequences from {\phi, ¬\phi} (the deduc- tion theorem lacking). KC and KC+ are interpreted as fragments of an S5-based first-order (...) modal logic M. The quantification in M is combined with a “subject abstraction” device, which excepts predicate letters from the scope of modal operators. Derivability is defined by an appropriate labelled tableau system rules. Informally, KC is mainly ontologically motivated (in contrast, for example, to Jaśkowski’s discussive logic), relativizing state of affairs with respect to conditions such as time. (shrink)

B. H. Slater has argued that there cannot be any truly paraconsistent logics, because it's always more plausible to suppose whatever negation symbol is used in the language is not a real negation, than to accept the paraconsistent reading. In this paper I neither endorse nor dispute Slater's argument concerning negation; instead, my aim is to show that as an argument against paraconsistency, it misses (some of) the target. A important class of paraconsistent logics — the preservationist logics — (...) are not subject to this objection. In addition I show that if we identify logics by means of consequence relations, at least one dialetheic logic can be reinterpreted in preservationist (non-dialetheic) terms. Thus the interest of paraconsistent consequence relations — even those that emerge from dialetheic approaches — does not depend on the tenability of dialetheism. Of course, if dialetheism is defensible, then paraconsistent logic will be required to cope with it. But the existence (and interest) of paraconsistent logics does not depend on a defense of dialetheism. (shrink)

This paper develops the first deontic logic in the context of paraconsistent logics.

One might ask of two or more texts—what can be inferred from them, taken together? If the texts happen to contradict each other in some respect, then the unadorned answer of standard logic is EVERYTHING. But it seems to be a given that we often successfully reason with inconsistent information from multiple sources. The purpose of this paper is to attempt to develop an adequate approach to accounting for this given.

This paper discusses how to define logics as deductive limits of sequences of other logics. The case of da Costa's hierarchy of increasingly weaker paraconsistent calculi, known as $ \mathcal {C}$n, 1 $ \leq$ n $ \leq$ $ \omega$, is carefully studied. The calculus $ \mathcal {C}$$\scriptstyle \omega$, in particular, constitutes no more than a lower deductive bound to this hierarchy and differs considerably from its companions. A long standing problem in the literature (open for more than 35 years) is (...) to define the deductive limit to this hierarchy, that is, its greatest lower deductive bound. The calculus $ \mathcal {C}$min, stronger than $ \mathcal {C}$$\scriptstyle \omega$, is first presented as a step toward this limit. As an alternative to the bivaluation semantics of $ \mathcal {C}$min presented thereupon, possible-translations semantics are then introduced and suggested as the standard technique both to give this calculus a more reasonable semantics and to derive some interesting properties about it. Possible-translations semantics are then used to provide both a semantics and a decision procedure for $ \mathcal {C}$Lim, the real deductive limit of da Costa's hierarchy. Possible-translations semantics also make it possible to characterize a precise sense of duality: as an example, $ \mathcal {D}$min is proposed as the dual to $ \mathcal {C}$min. (shrink)

1 What are the features of a paraconsistent negation? Since paraconsistent logic was launched by da Costa in his seminal paper [4], one of the fundamental problems has been to determine what exactly are the theoretical or metatheoretical properties of classical negation that can have a unary operator not obeying the principle of noncontradiction, that is, a paraconsistent operator. What the result presented here shows is that some of these properties are not compatible with each other, so that in constructing (...) a paraconsistent negation as close as possible to classical negation, we have to make a choice among classical properties compatible with the idea of paraconsistency. In particular, there is no paraconsistent negation more classical than all the others. (shrink)

Normally, we would accuse anyone who holds inconsistent beliefs of irrationality. However, Keenan apologists may claim that in some circumstances it does seem perfectly rational to hold inconsistent beliefs. And we are not alone in this assertion. A small band of philosophers, led most notably by Graham Priest, have also championed this cause, the cause of paraconsistency.

As is known, a logic S is paraconsistent if the rule ECQ (E contradictione quodlibet) is not a rule of S. Not less well known is the fact that Lewis’ modal logics are not paraconsistent. Actually, Lewis vindicates the validity of ECQ in a famous proof currently known as the “Lewis’ proof” or “Lewis’ argument.” This proof essentially leans on the Disjunctive Syllogism as a rule of inference. The aim of this paper is to define a series of paraconsistent logics (...) included in S4 where the Disjunctive Syllogism is valid only as a rule of proof. (shrink)

in models. We show that these natural preferential In the research on paraconsistency, preferential systems systems that were originally designed for paraconwere used for constructing logics which are paraconsistent sistent reasoning fulfill a key condition (stopperedbut stronger than substructural paraconsistent logics. The ness or smoothness) from the theoretical research preferences in these systems were defined in different ways. of nonmonotonic reasoning. Consequently, the Some were based on checking which abnormal formulas nonmonotonic consequence relations that they in-.

The aim of this paper is two-fold: (1) To contribute to a better knowledge of the method of the Argentinean mathematicians Lia Oubifia and Jorge Bosch to formulate category theory independently of set theory. This method suggests a new ontology of mathematical objects, and has a profound philosophical significance (the underlying logic of the resulting category theory is classical iirst—order predicate calculus with equality). (2) To show in outline how the Oubina-Bosch theory can be modified to give rise to a (...) strong paraconsistent category theory; strong enough to be taken as the basis for a paraconsistent mathematics which encompasses all classical mathematical results. (shrink)

The aim of this paper is to show that Graham Priest's dialetheic account of semantic paradoxes and the paraconsistent logics employed cannot achieve semantic universality. Dialetheism therefore fails as a solution to semantic paradoxes for the same reason that consistent approaches did. It will be demonstrated that if dialetheism can express its own semantic principles, a strengthened liar paradox will result, which renders dialetheism trivial. In particular, the argument is not invalidated by relational valuations, which were brought into paraconsistent logic (...) in order to avoid strengthened liar paradoxes. (shrink)

In this paper we introduce a paraconsistent reasoning strategy, Chunk and Permeate. In this, information is broken up into chunks, and a limited amount of information is allowed to flow between chunks. We start by giving an abstract characterisation of the strategy. It is then applied to model the reasoning employed in the original infinitesimal calculus. The paper next establishes some results concerning the legitimacy of reasoning of this kind – specifically concerning the preservation of the consistency of each chunk (...) – and concludes with some other possible applications and technical questions. (shrink)

The object of this paper is to show how one is able to construct a paraconsistent theory of models that reflects much of the classical one. In other words the aim is to demonstrate that there is a very smooth and natural transition from the model theory of classical logic to that of certain categories of paraconsistent logic. To this end we take an extension of da Costa''sC 1 = (obtained by adding the axiom A A) and prove for it (...) results which correspond to many major classical model theories, taken from Shoenfield [5]. In particular we prove counterparts of the theorems of o-Tarski and Chang-o-Suszko, Craig-Robinson and the Beth definability theorem. (shrink)

In this paper we make some general remarks on the use of non-classical logics, in particular paraconsistent logic, in the foundational analysis of physical theories. As a case-study, we present a reconstruction of P.\ -D.\ F\'evrier's 'logic of complementarity' as a strict three-valued logic and also a paraconsistent version of it. At the end, we sketch our own approach to complementarity, which is based on a paraconsistent logic termed 'paraclassical logic'.

This paper begins an analysis of the real line using an inconsistency-tolerant (paraconsistent) logic. We show that basic field and compactness properties hold, by way of novel proofs that make no use of consistency-reliant inferences; some techniques from constructive analysis are used instead. While no inconsistencies are found in the algebraic operations on the real number field, prospects for other non-trivializing contradictions are left open.

Vague predicates, on a paraconsistent account, admit overdetermined borderline cases. I take up a new line on the paraconsistent approach, to show that there is a close structural relationship between the breakdown of soritical progressions, and contradiction. Accordingly, a formal picture drawn from an appropriate logic shows that any cut-off point of a vague predicate is unidentifiable, in a precise sense. A paraconsistent approach predicts and explains many of the most counterintuitive aspects of vagueness, in terms of a more fundamental (...) inconsistency. (shrink)

In positive logic the negation of a propositionA is defined byA X whereX is some fixed proposition. A number of standard properties of negation, includingreductio ad absurdum, can then be proved, but not the law of noncontradiction so that this forms a paraconsistent logic. Various stronger paraconsistent logics are then generated by putting in particular propositions forX. These propositions range from true through contingent to false.

In this paper we consider the theory of predicate logics in which the principle of Bivalence or the principle of Non-Contradiction or both fail. Such logics are partial or paraconsistent or both. We consider sequent calculi for these logics and prove Model Existence. For L4, the most general logic under consideration, we also prove a version of the Craig-Lyndon Interpolation Theorem. The paper shows that many techniques used for classical predicate logic generalise to partial and paraconsistent logics once the right (...) set-up is chosen. Our logic L4 has a semantics that also underlies Belnap’s [4] and is related to the logic of bilattices. L4 is in focus most of the time, but it is also shown how results obtained for L4 can be transferred to several variants. (shrink)

In this paper we give axiom systems for classical and intuitionistic hybrid logic. Our axiom systems can be extended with additional rules corresponding to conditions on the accessibility relation expressed by so-called geometric theories. In the classical case other axiomatisations than ours can be found in the literature but in the intuitionistic case no axiomatisations have been published. We consider plain intuitionistic hybrid logic as well as a hybridized version of the constructive and paraconsistent logic N4.

A proof method for automation of reasoning in a paraconsistent logic, the calculus C1* of da Costa, is presented. The method is analytical, using a specially designed tableau system. Actually two tableau systems were created. A first one, with a small number of rules in order to be mathematically convenient, is used to prove the soundness and the completeness of the method. The other one, which is equivalent to the former, is a system of derived rules designed to enhance computational (...) efficiency. A prototype based on this second system was effectively implemented. (shrink)

Paraconsistent logic is the study of logics in which there are some theories embodying contradictions but which are not trivial, in particular in a paraconsistent logic, the ex contradictione sequitur quod libet, which can be formalized as Cn(T, a,¬a)=F is not valid. Since nearly half a century various systems of paraconsistent logic have been proposed and studied. This field of research is classified under a special section (B53) in the Mathematical Reviews and watching this section, it is possible to see (...) that the number of papers devoted to paraconsistent logic is each time greater and has recently increased due in particular to its applications to computer sciences (see e.g. Blair and Subrahmanian. (shrink)

We define in precise terms the basic properties that an ‘ideal propositional paraconsistent logic’ is expected to have, and investigate the relations between them. This leads to a precise characterization of ideal propositional paraconsistent logics. We show that every three-valued paraconsistent logic which is contained in classical logic, and has a proper implication connective, is ideal. Then we show that for every n > 2 there exists an extensive family of ideal n -valued logics, each one of which is not (...) equivalent to any k -valued logic with k < n. (shrink)

In this paper we extend the anodic systems introduced in Bueno-Soler (J Appl Non Class Logics 19(3):291–310, 2009) by adding certain paraconsistent axioms based on the so called logics of formal inconsistency , introduced in Carnielli et al. (Handbook of philosophical logic, Springer, Amsterdam, 2007), and define the classes of systems that we call cathodic . These classes consist of modal paraconsistent systems, an approach which permits us to treat with certain kinds of conflicting situations. Our interest in this paper (...) is to show that such systems can be semantically characterized in two different ways: by Kripke-style semantics and by modal possible-translations semantics . Such results are inspired in some universal constructions in logic, in the sense that cathodic systems can be seen as a kind of fusion (a particular case of fibring) between modal logics and non-modal logics, as discussed in Carnielli et al. (Analysis and synthesis of logics, Springer, Amsterdam, 2007). The outcome is inherently within the spirit of universal logic, as our systems semantically intermingles modal logics, paraconsistent logics and many-valued logics, defining new blends of logics whose relevance we intend to show. (shrink)

The prepositional calculiC n , 1 n introduced by N.C.A. da Costa constitute special kinds of paraconsistent logics. A question which remained open for some time concerned whether it was possible to obtain a Lindenbaum''s algebra forC n . C. Mortensen settled the problem, proving that no equivalence relation forC n . determines a non-trivial quotient algebra.The concept of da Costa algebra, which reflects most of the logical properties ofC n , as well as the concept of paraconsistent closure system, (...) are introduced in this paper. (shrink)

The paper essentially shows that the paraconsistent logicDR satisfies the depth relevance condition. The systemDR is an extension of the systemDK of [7] and the non-triviality of a dialectical set theory based onDR has been shown in [3]. The depth relevance condition is a strengthened relevance condition, taking the form: If DR- AB thenA andB share a variable at the same depth, where the depth of an occurrence of a subformulaB in a formulaA is roughly the number of nested ''s (...) required to reach the occurrence ofB inA. The method of proof is to show that a model structureM consisting of {M 0 , M1, ..., M}, where theM i s are all characterized by Meyer''s 6-valued matrices (c. f, [2]), satisfies the depth relevance condition. Then, it is shown thatM is a model structure for the systemDR. (shrink)

New propositional and first-order paraconsistent logics (called L ω and FL ω , respectively) are introduced as Gentzen-type sequent calculi with classical and paraconsistent negations. The embedding theorems of L ω and FL ω into propositional (first-order, respectively) classical logic are shown, and the completeness theorems with respect to simple semantics for L ω and FL ω are proved. The cut-elimination theorems for L ω and FL ω are shown using both syntactical ways via the embedding theorems and semantical ways (...) via the completeness theorems. (shrink)

One of the most important paraconsistent logics is the logic mCi, which is one of the two basic logics of formal inconsistency. In this paper we present a 5-valued characteristic nondeterministic matrix for mCi. This provides a quite non-trivial example for the utility and effectiveness of the use of non-deterministic many-valued semantics.

The article is devoted to the systematic study of the lattice εN4⊥ consisting of logics extending N4⊥. The logic N4⊥ is obtained from paraconsistent Nelson logic N4 by adding the new constant ⊥ and axioms ⊥ → p, p → ∼ ⊥. We study interrelations between εN4⊥ and the lattice of superintuitionistic logics. Distinguish in εN4⊥ basic subclasses of explosive logics, normal logics, logics of general form and study how they are relate.

Trois sortes de définitions sont présentées et discutées: les définitions nominales, les définitions contextuelles et les définitions amplificatrices. On insiste sur le fait que I’elimination des definitions n’est pas forcement un procede automatique en particulier dans le cas de la logique paraconsistante. Finalement on s’int’resse à la théorie des objets de Meinong et l’on montre comment elle peut êrre considéréecomme une théorie des descripteurs.Three kinds of definitions are presented and discussed: nominal definitions, contextual definitions, amplifying definitions. It is emphasized that (...) the elimination of definitions is not necessarily straightforward in particular in the case of paraconsistent logic. Finally we have a look at Meinong’s theory objects and we show how it can be considered as a theory of descriptors. (shrink)

Bohr’s atomic model is one of the better known examples of empirically successful, albeit inconsistent, theoretical schemes in the history of physics. For this reason, many philosophers use this model to illustrate their position for the occurrence and the function of inconsistency in science. In this paper, I proceed to a critical comparison of the structure and the aims of Bohr’s research program – the starting point of which was the formulation of his model – with some of its contemporary (...) philosophical readings. My study comes to conclude that the attempt of certain philosophers to accommodate Bohr’s model to a form of paraconsistent logic obliterates essential aspects of scientists' actual practice and reasoning. (shrink)

The origin of Paraconsistent Logic is closely related with the argument that from the assertion of two mutually contradictory statements any other statement can be deduced, which can be referred to as ex contradict!one sequitur quodlibet (ECSQ). Despite its medieval origin, only in the 1930s did it become the main reason for the unfeasibility of having contradictions in a deductive system. The purpose of this paper is to study what happened before: from Principia Mathematica to that time, when it became (...) well established. The main historical claims that I am going to advance are the following: the first explicit use of ECSQ as the main argument for supporting the necessity of excluding any contradiction from deductive systems is to be found in the first edition (1928) of the book Grundzüge der theoretischen Logik by Hilbert and Ackermann. At the end, I will suggest that the aim of the 20th century usage of ECSQ was to change from the centuries long philosophical discussion about contradictions to a more "technical" one. But with Paraconsistent Logic viewed as a technical solution to this restriction, the philosophical problem revives, but now with an improved understanding of it at one's disposal. (shrink)

In [8] Jakowski defined by means of an appropriate interpretation a paraconsistent calculusD 2 . In [9] J. Kotas showed thatD 2 is equivalent to the calculusM(S5) whose theses are exactly all formulasa such thatMa is a thesis ofS5. The papers [11], [7], [3], and [4] showed that interesting paraconsistent calculi could be obtained using modal systems other thanS5 and modalities other thanM. This paper generalises the above work. LetA be an arbitrary modality (i.e. string ofM''s,L''s and negation signs). Then (...) theA-extension of a set of formulasX is {¦A X}}. Various properties ofA-extensions of normal modal systems are examined, including a problem of their axiomatizability. (shrink)

Just what forms do (or should) our cognitive attitudes towards scientific theories take? The nature of cognitive commitment becomes particularly puzzling when scientists' commitments are) inconsistent. And inconsistencies have often infected our best efforts in science and mathematics. Since there are no models of inconsistent sets of sentences, straightforward semantic accounts fail. And syntactic accounts based on classical logic also collapse, since the closure of any inconsistent set under classical logic includes every sentence. In this essay I present some evidence (...) that there really was a substantial cognitive commitment to OQT, and that some of its characteristics have a simple and straightforward explanation in terms of a model based on a form of paraconsistent logic. (shrink)

Trois sortes de définitions sont présentées et discutées: les définitions nominales, les définitions contextuelles et les définitions amplificatrices. On insiste sur le fait que I’elimination des definitions n’est pas forcement un procede automatique en particulier dans le cas de la logique paraconsistante. Finalement on s’int’resse à la théorie des objets de Meinong et l’on montre comment elle peut êrre considéréecomme une théorie des descripteurs.Three kinds of definitions are presented and discussed: nominal definitions, contextual definitions, amplifying definitions. It is emphasized that (...) the elimination of definitions is not necessarily straightforward in particular in the case of paraconsistent logic. Finally we have a look at Meinong’s theory objects and we show how it can be considered as a theory of descriptors. (shrink)

The aim of this paper is to present a description of change in the framework of tense logic. After considering some examples of using the intervals, we present the main principles of the logic of inconsistent reasoning. Then we built a tense interval paraconsistent semantics and discuss some of its possible applications.

The aim of this paper is to study the paraconsistent deductive systemP 1 within the context of Algebraic Logic. It is well known due to Lewin, Mikenberg and Schwarse thatP 1 is algebraizable in the sense of Blok and Pigozzi, the quasivariety generated by Sette's three-element algebraS being the unique quasivariety semantics forP 1. In the present paper we prove that the mentioned quasivariety is not a variety by showing that the variety generated byS is not equivalent to any algebraizable (...) deductive system. We also show thatP 1 has no algebraic semantics in the sense of Czelakowski. Among other results, we study the variety generated by the algebraS. This enables us to prove in a purely algebraic way that the only proper non-trivial axiomatic extension ofP 1 is the classical deductive systemPC. Throughout the paper we also study those abstract logics which are in a way similar toP 1, and are called hereabstract Sette logics. We obtain for them results similar to those obtained for distributive abstract logics by Font, Verdú and the author. (shrink)

This paper is an effort to realize and explore the connections that exist between nonmonotonic logic and confirmation theory. We pick up one of the most wide-spread nonmonotonic formalisms – default logic – and analyze to what extent and under what adjustments it could work as a logic of induction in the philosophical sense. By making use of this analysis, we extend default logic so as to make it able to minimally perform the task of a logic of induction, having (...) as a result a system which we believe has interesting properties from the standpoint of theory of confirmation. It is for instance able to represent chains of inductive rules as well as to reason paraconsistently on the conclusions obtained from them. We then use this logic to represent some traditional ideas concerning confirmation theory, in particular the ones proposed by Carl Hempel in his classical paper "Studies in the Logic of Confirmation" of 1945 and the ones incorporated in the so-called abductive and hy-pothetico-deductive models. (shrink)

There is a principle in things, about which we cannot be deceived, but must always, on the contrary, recognize the truth – viz. that the same thing cannot at one and the same time be and not be": with these words of the Metaphysics, Aristotle introduced the Law of Non-Contradiction, which was to become the most authoritative principle in the history of Western thought. However, things have recently changed, and nowadays various philosophers, called dialetheists, claim that this Law does not (...) hold unrestrictedly – that in peculiar circumstances the same thing may at the same time be and not be, and contradictions may obtain in the world. This book opens with an examination of the famous logical paradoxes that appear to speak on behalf of contradictions (e.g., the Liar paradox, the set-theoretic paradoxes such as Cantor’s and Russell’s), and of the reasons for the failure of the standard attempts to solve them. It provides, then, an introduction to paraconsistent logics – non-classical logics in which the admission of contradictions does not lead to logical chaos –, and their astonishing applications, going from inconsistent data base management to contradictory arithmetics capable of circumventing Gödel’s celebrated Incompleteness Theorem. The final part of the book discusses the philosophical motivations and difficulties of dialetheism, and shows how to extract from Aristotle’s ancient words a possible reply to the dialetheic challenge. How to Sell a Contradiction will appeal to anyone interested in non-classical logics, analytic metaphysics, and philosophy of mathematics, and especially to those who consider challenging our most entrenched beliefs the main duty of philosophical inquiry. (shrink)

particular alternative logic could be relevant to another one? The most important part of a response to this question is to remind the reader of the fact that independence friendly (IF) logic is not an alternative or “nonclassical” logic. (See here especially Hintikka, “There is only one logic”, forthcoming.) It is not calculated to capture some particular kind of reasoning that cannot be handled in the “classical” logic that should rather be called the received or conventional logic. No particular epithet (...) should be applied to it. IF logic is not an alternative to our generally used basic logic, the received first-order logic, aka quantification theory or predicate calculus. It replaces this basic logic in that it is identical with this “classical” first-order logic except that certain important flaws of the received first-order logic have been corrected. But what are those flaws and how can they be corrected? To answer these questions is to explain the basic ideas of IF logic. Since this logic is not as well known as it should be, such explanation is needed in any case. I will provide three different but not unrelated motivations for IF logic. (shrink)

The following essay reconsiders the ontological and logical issues around Frege’s Basic Law (V). If focuses less on Russell’s Paradox, as most treatments of Frege’s Grundgesetze der Arithmetik (GGA)1 do, but rather on the relation between Frege’s Basic Law (V) and Cantor’s Theorem (CT). So for the most part the inconsistency of Naïve Comprehension (in the context of standard Second Order Logic) will not concern us, but rather the ontological issues central to the conflict between (BLV) and (CT). These ontological (...) issues are interesting in their own right. And if and only if in case ontological considerations make a strong case for something like (BLV) we have to trouble us with inconsistency and paraconsistency. These ontological issues also lead to a renewed methodological reflection what to assume or recognize as an axiom. (shrink)

The paper examines philosophical issues that arise in contexts where one has many different models for treating the same system. I show why in some cases this appears relatively unproblematic (models of turbulence) while others represent genuine difficulties when attempting to interpret the information that models provide (nuclear models). What the examples show is that while complementary models needn’t be a hindrance to knowledge acquisition, the kind of inconsistency present in nuclear cases is, since it is indicative of a lack (...) of genuine theoretical understanding. It is important to note that the differences in modeling do not result directly from the status of our knowledge of turbulent flows as opposed to nuclear dynamics—both face fundamental theoretical problems in the construction and application of models. However, as we shall, the ‘problem context(s)’ in which the modeling takes plays a decisive role in evaluating the epistemic merit of the models themselves. Moreover, the theoretical difficulties that give rise to inconsistent as opposed to complementary models (in the cases I discuss) impose epistemic and methodological burdens that cannot be overcome by invoking philosophical strategies like perspectivism, paraconsistency or partial structures. (shrink)

I consider here several versions of finitism or conceptions that try to work around postulating sets of infinite size. Restricting oneself to the so-called potential infinite seems to rest either on temporal readings of infinity (or infinite series) or on anti-realistic background assumptions. Both these motivations may be considered problematic. Quine’s virtual set theory points out where strong assumptions of infinity enter into number theory, but is implicitly committed to infinity anyway. The approaches centring on the indefinitely large and the (...) use of schemata would provide a work-around to circumvent usage of actual infinities if we had a clear understanding of how schemata work and where to draw the conceptual line between the indefinitely large and the infinite. Neither of this seems to be clear enough. Versions of strict finitism in contrast provide a clear picture of a (realistic) finite number theory. One can recapture standard arithmetic without being committed to actual infinities. The major problem of them is their usage of a paraconsistent logic with an accompanying theory of inconsistent objects. If we are, however, already using a paraconsistent approach for other reasons (in semantics, epistemology or set theory), we get finitism for free. This strengthens the case for paraconsistency. (shrink)

The paper discusses which modal principles should hold for a truth operator answering to the truth theory of internal realism. It turns out that the logic of truth in internal realism is isomorphic to the modal system S4.

This paper presents a theory of belief revision that allows people to come tobelieve in contradictions. The AGM theory of belief revision takes revision,in part, to be consistency maintenance. The present theory replacesconsistency with a weaker property called coherence. In addition to herbelief set, we take a set of statements that she rejects. These two sets arecoherent if they do not overlap. On this theory, belief revision maintains coherence.

American-plan semantics with 4 values 1, 0, { {1, 0}} {{}}, interpretable as True, False, Both and Neither, are furnished for a range of logics, including relevant affixing systems. The evaluation rules for extensional connectives take a classical form: in particular, those for negation assume the form 1 (A, a) iff 0 (A, a) and 0 (A, a) iff 1 (A, a), so eliminating the star function *, on which much criticism of relevant logic semantics has focussed. The cost of (...) these classical features is a further relation (or operation), required in evaluating falsity assignments of implication formulae.Two styles of 4 valued relational semantics are developed; firstly a semantics using notions of double truth and double validity for basic relevant systemB and some extensions of it; and secondly, since the first semantics makes heavy weather of validating negation principles such as Contraposition, a reduced semantics using more complex implicational rules for relevant systemC and various of its extensions. To deal satisfactorily with elite systemsR,E andT, however, further complication is inevitable; and a relation of mateship (suggested by the Australian plan) is introduced to permit cross-over from 1 to 0 values and vice versa. (shrink)

In this essay we advance the view that analytical epistemology and artificial intelligence are complementary disciplines. Both fields study epistemic relations, but whereas artificial intelligence approaches this subject from the perspective of understanding formal and computational properties of frameworks purporting to model some epistemic relation or other, traditional epistemology approaches the subject from the perspective of understanding the properties of epistemic relations in terms of their conceptual properties. We argue that these two practices should not be conducted in isolation. We (...) illustrate this point by discussing how to represent a class of inference forms found in standard inferential statistics. This class of inference forms is interesting because its members share two properties that are common to epistemic relations, namely defeasibility and paraconsistency. Our modeling of standard inferential statistical arguments exploits results from both logical artificial intelligence and analytical epistemology. We remark how our approach to this modeling problem may be generalized to an interdisciplinary approach to the study of epistemic relation. (shrink)