The main research goal of the work is to study the notion of co-topos, its correctness, properties and relations with toposes. In particular, the dualization process proposed by proponents of co-toposes has been analyzed, which transforms certain Heyting algebras of toposes into co-Heyting ones, by which a kind of paraconsistent logic may appear in place of intuitionistic logic. It has been shown that if certain two definitions of topos are to be equivalent, then in one of them, in the context (...) of a subobject classifier, there should be a neutral label for the generic subobject, or if the label "true" appears instead, it carries no additional properties or assumptions. It has been shown that a natural isomorphism occurring in one of the definitions of topos need not be an isomorphism of the corresponding algebraic structures on the sets, so that a co-Heyting algebraic structure can be defined on the set of characteristic morphisms, which moreover will also be natural. The analyzes suggest that the notion of co-topos may be considered correct. However, it should be strongly emphasized that although the possibility of defining the notion of co-topos has been shown, its further full consequences should be very carefully examined, which can severely limit its logical applications. (shrink)

This paper deals with a relatively recent trend in the history of analytic philosophy, philosophical logic, and theory of science: the philosophical study of the role of inconsistency in empirical science. This paper is divided in three sections that correspond to the three types of inconsistencies identified: (i) factual, occurring between theory and observations, (ii) external, occurring between two mutually contradictory theories, and (iii) internal, characterising theories that entail mutually contradictory statements.

Nāgārjuna, the famous founder of the Madhyamika School, proposed the positive catuṣkoṭi in his seminal work, Mūlamadhyamakakārikā: ‘All is real, or all is unreal, all is both real and unreal, all is neither unreal nor real; this is the graded teaching of the Buddha’. He also proposed the negative catuṣkoṭi: ‘“It is empty” is not to be said, nor “It is non-empty,” nor that it is both, nor that it is neither; [“empty”] is said only for the sake of instruction’ (...) and the no-thesis view: ‘No dharma whatsoever was ever taught by the Buddha to anyone’. In this essay, I adopt Gricean pragmatics to explain the positive and negative catuṣkoṭi and the no-thesis view proposed by Nāgārjuna in a way that does not violate classical logic. For Nāgārjuna, all statements are false as long as the hearer understands them within a reified conceptual scheme, according to which substance is a basic categorical concept; substances have svabhāva, and names and sentences have svabhāva. (shrink)

This dissertation offers a proof of the logical possibility of testing empirical/factual theories that are inconsistent, but non-trivial. In particular, I discuss whether or not such theories can satisfy Popper's principle of falsifiablility. An inconsistent theory Ƭ closed under a classical consequence relation implies every statement of its language because in classical logic the inconsistency and triviality are coextensive. A theory Ƭ is consistent iff there is not a α such that Ƭ ⊢ α ∧ ¬α, otherwise it is inconsistent. (...) We say, instead, that Ƭ is non-trivial iff there is at least one α such that Ƭ ⊢ α, otherwise we say that it trivial. This happens because classical logic satisfies the principle of explosion, according ex contradictione sequitur quodlibet (from a contradiction anything follows). Under these conditions inconsistent classical theories would be compatible with any well-formed formula, which makes them useless for science. There are, however, so-called paraconsistent logics in which the principle of explosion does not generally hold and in which a theory can be (simply) inconsistent, but also absolutely consistent. It is in this logical framework that we can prove that some inconsistent theories can be falsifiable. (shrink)

We investigate the notion of classical negation from a non-classical perspective. In particular, one aim is to determine what classical negation amounts to in a paracomplete and paraconsistent four-valued setting. We first give a general semantic characterization of classical negation and then consider an axiomatic expansion BD+ of four-valued Belnap–Dunn logic by classical negation. We show the expansion complete and maximal. Finally, we compare BD+ to some related systems found in the literature, specifically a four-valued modal logic of Béziau and (...) the logic of classical implication and a paraconsistent de Morgan negation of Zaitsev. (shrink)

A dialectical contradiction can be appropriately described within the framework of classical formal logic. It is in harmony with the law of noncontradiction. According to our definition, two theories make up a dialectical contradiction if each of them is consistent and their union is inconsistent. It can happen that each of these two theories has an intended model. Plenty of examples are to be found in the history of science.

In the late forties, Stanisław Jaśkowski published two papers onthe discursive sentential calculus, D2. He provided a definition of it by an interpretation in the language of S5 of Lewis. The knownaxiomatization of D2 with discursive connectives as primitives was introduced by da Costa, Dubikajtis and Kotas in 1977. It turns out, however,that one of the axioms they used is not a thesis of the real Jaśkowski’s calculus. In fact, they built a new system, D∗2 for short, that differs from (...) D2 inmany respects. The aim of this paper is to introduce a direct Kripke-type semantics for the system, axiomatize it in a new way and prove soundness andcompleteness theorems. Additionally, we present labelled tableaux for D∗2.1. (shrink)

In 1995 N. C. A. da Costa and F. Doria proposed the modaltype elegant axiomatization of Jaśkowski’s discussive logic D2. Yet his ownproblem which was formulated in 1975 in a following way: Is it possible toformulate natural and simple axiomatization for D2, employing classical disjunction and conjunction along with discussive implication and conjunctionas the only primitive connectives? — still seems left open. The matter of factis there are some axiomatizations of D2 proposed, e.g., by T. Furmanowski, J. Kotas and N. (...) C. A. da Costa , G. Achtelik, L. Dubikajtus,E. Dudek and J. Konior , satisfying da Costa’s conditions, but they arerather looking very complicated and unnatural. An attempt is made to solveda Costa’s problem. The new axiomatization of D2 is proposed essentiallybased on da Costa’s-Doria axiomatization from 1995. (shrink)

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)

Discursive (or discussive) logic, D₂, introduced by Jaśkowski, is widely recognized as a first formal approach to paraconsistency. Jaśkowski applied a quite extraordinary technique at that time to describe his logic. He neither gave a set of the axiom schemata nor presented a direct semantics for D₂ but used a translation function to express his philosophical and logical intuitions. Discursive logic was defined by an interpretation in the language of S₅ of Lewis. The aim of this paper is to present (...) a modified system of the discursive logic that allows some of the weaker versions of Duns Scotus's thesis to be valid. The initial idea is to consider a different characteristic of the connective of negation. We introduce both a direct semantics and an axiomatization of the new system, prove the key metatheorems, and describe labeled tableaux for the system. (shrink)

In the paper, we tackle the matter of non-classical logics, in particular, paraconsistent ones, for which not every formula follows in general from inconsistent premisses. Our benchmark is Jaśkowski’s logic, modeled with the help of discussion. The second key origin of this paper is the matter of being tabular, i.e. being adequately expressible by finitely many finite matrices. We analyse Jaśkowski’s non-tabular discussive (discursive) logic $ \textbf {D}_{2}$, one of the first paraconsistent logics, from the perspective of a trivalent tabular (...) logic. We are motivated to step down from the ongoing modal $ \textbf {S5}$-perspective of developing $ \textbf {D}_{2}$ both by certain mysteries that have been surrounding it and by gaps in Jaśkowski’s arguments contra the multivalent tabular perspective. Although Jaśkowski’s idea to use $ \textbf {S5}$ in order to define $ \textbf {D}_{2}$ is very attractive since it allows one to benefit from the tools and results of modal logic, it also gives a ‘non-direct’ formulation and, as it appeared later, is superfluous with respect to what is meant to be achieved since one can define the very same logic but using modal logics weaker than S5. It is also known, due to Kotas, that discussive logic is not finite-valued. So, in light of Kotas’s result that $ \textbf {D}_{2}$ is non-tabular, we propose to associate it with a few dozen discussive formulae that Jaśkowski unequivocally and illustratively suggests to be its theorems or non-theorems rather than with axioms of its modern axiomatizations (one of which Kotas employs) in order to be capable of performing a computer-aided brute-force search for suitable trivalent matrices in the cases of one and two designated values. As a result, we find trivalent matrices with two designated values that might be dubbed ‘discussive’ because they meet Jaśkowski’s suggestion to validate and invalidate the litmus theorems and non-theorems, respectively, despite the fact that none of them validates all the negation axioms in the modern axiomatizations of $ \textbf {D}_{2}$. The matrices found are then analysed along with highlighting the ones that were previously mentioned in the literature. We conclude the paper with a comparative analysis of Omori’s results and a test of Karpenko’s hypothesis. (shrink)

Ayda Ignez Arruda was a key figure in the development of the Brazilian school of Paraconsistent logic and the first person to write a historical survey of the field. Despite her importa...

This paper deals with a relatively recent trend in the history of analytic philosophy, philosophical logic, and theory of science: the philosophical study of the role of inconsistency in empirical science. This paper is divided in three sections that correspond to the three types of inconsistencies identified: (i) factual, occurring between theory and observations, (ii) external, occurring between two mutually contradictory theories, and (iii) internal, characterising theories that entail mutually contradictory statements.

This paper discusses the logical possibility of testing inconsistent empirical theories. The main challenge for answering this affirmatively is to avoid that the inconsistent consequences of a theory both corroborate it and falsify it. I answer affirmatively by showing that we can define a class of empirical sentences whose truth would force us to abandon such inconsistent theory: the class of its potential rejecters. Despite this, I show that the observational contradictions implied by a theory could only be verified (provided (...) we make some assumptions), but not rejected. From this, it follows that, although inconsistent theories are rejectable, they cannot be rejected qua inconsistent. (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)

In [Waragai & Shidori, 2007], a system of paraconsistent logic called PCL1, which takes a similar approach to that of da Costa, is proposed. The present paper gives further results on this system and its related systems. Those results include the concrete condition to enrich the system PCL1 with the classical negation, a comparison of the concrete notion of “behaving classically” given by da Costa and by Waragai and Shidori, and a characterisation of the notion of “behaving classically” given by (...) Waragai and Shidori. (shrink)

In [1] Béziau developed the paraconsistent logic Z, which is definitionally equivalent to the modal logic S5, and gave an axiomatization of the logic Z: the system HZ. In the present paper, we prove that some axioms of HZ are not independent and then propose another axiomatization of Z. We also discuss a new perspective on the relation between S5 and classical propositional logic with the help of the new axiomatization of Z. Then we conclude the paper by making a (...) remark on the paraconsistency of HZ. (shrink)

With each proposition P we associate a set of proposition (a hyperproposition) which determines the order in which one may retreat from accepting P, if one cannot fully hold on to P. We first describe the structure of hyperpropositions. Then we describe two operations on propositions, subtraction and merge, which can be modelled in terms of hyperpropositions. Subtraction is an operation that takes away part of the content of a proposition. Merge is an operation that determines the maximal consistent content (...) of two propositions considered jointly. The merge operation gives rise to an inference relation which is, in a certain sense, optimally paraconsistent. (shrink)

Moral conflicts are the situations which emerge as a response to deal with conflicting obligations or duties. An interesting case arises when an agent thinks that two obligations A and B are equally important, but yet fails to choose one obligation over the other. Despite the fact that the systematic study and the resolution of moral conflicts finds prominence in our linguistic discourse, standard deontic logic when used to represent moral conflicts, implies the impossibility of moral conflicts. This presents a (...) conundrum for appropriate logic to address these moral conflicts. We frequently believe that there is a close connection between tolerating inconsistencies and conflicting moral obligations. In paraconsistent logics, we tolerate inconsistencies by treating them to be both true and false. In this paper, we analyze Graham Priest’s paraconsistent logic LP, and extend our examination to the deontic extension of LP known as DLP. We illustrate our work, with a classic example from the famous Indian epic Mahabharata, where the protagonist Arjuna faces a moral conflict in the battlefield of Kurukshetra. The paper aims to avoid deontic explosion and allows to accommodate Arjuna’s moral conflict in paraconsistent deontic logics. Our analysis is expected to provide novel tools towards the logical representation of moral conflicts and to shed some light on the context-sensitive paraconsistent deontic logic. (shrink)

How to handle vagueness? One way is to introduce the machinery of acceptable sharpenings, and reinterpret truth as truth-in-all-sharpenings or truth-in-some-sharpenings. A major selling point has been the conservativism of the resulting systems with respect to classical theoremhood and inference. Supervaluationism and subvaluationism possess interesting formal symmetries, a fact that has been used to argue for the subvaluationist approach. However, the philosophical motivation behind each is a different matter. Subvaluationism comes with a standard story that is difficult to sign up (...) to. In this paper, I make use of a variant of Putnam’s well-known idea of linguistic deference, and some results in voting theory, to answer this criticism of subvaluationism. The acceptability intuitions of each member of a linguistic community amount to their voting for one or more acceptable sharpenings, with truth then characterised as truth-in-a--sufficiency-of-sharpenings. This produces a family of logical systems that are close relations of subvaluationism, share its conservatism results, yet have stronger philosophical foundations in the workings of externalist content. (shrink)

The mathematician G.F.C. Griss is known for his program of negationless intuitionistic mathematics. Although Griss’s rejection of negation is regarded as characteristic of his philosophy, this is a consequence of an executability requirement that mental constructions presuppose agents’ executing corresponding mental activity. Restoring Griss’s executability requirement to a central role permits a more subtle characterization of the rejection of negation, according to which D. Nelson’s strong constructible negation is compatible with Griss’s principles. This exposes a ‘holographic’ theory of negation in (...) negationless mathematics, in which a full theory of negation is ‘flattened’ in a putatively negationless setting. (shrink)

In Jaśkowski’s model of discussion, discussive connectives represent certain interactions that can hold between debaters. However, it is not possible within the model for participants to use explicit modal operators. In the paper we present a modal extension of the discussive logic $\textbf{D}_{\textbf{2}}$ that formally corresponds to an extended version of Jaśkowski’s model of discussion that permits such a use. This logic is denoted by $\textbf{m}\textbf{D}_{\textbf{2}}$. We present philosophical motivations for the formulation of this logic. We also give syntactic characterizations (...) of the logic and propose a comparison with certain other modal systems. In particular, we prove that $\textbf{m}\textbf{D}_{\textbf{2}}$ is neither normal nor regular. On the basis of the axiomatization of $\textbf{D}_{\textbf{2}}$, we give an axiomatization of $\textbf{m}\textbf{D}_{\textbf{2}}$. We also give another axiomatization which is not based on the axiomatization of $\textbf{D}_{\textbf{2}}$. Furthermore, we give a natural Kripke-style semantics for $\textbf{m}\textbf{D}_{\textbf{2}}$ and prove the respective adequacy theorems. (shrink)

This volume presents recent advances in philosophical logic with chapters focusing on non-classical logics, including paraconsistent logics, substructural logics, modal logics of agency and other modal logics. The authors cover themes such as the knowability paradox, tableaux and sequent calculi, natural deduction, definite descriptions, identity, truth, dialetheism and possible worlds semantics. The developments presented here focus on challenging problems in the specification of fundamental philosophical notions, as well as presenting new techniques and tools, thereby contributing to the development of the (...) field. Each chapter contains a bibliography, to assist the reader in making connections in the specific areas covered. Thus this work provides both a starting point for further investigations into philosophical logic and an update on advances, techniques and applications in a dynamic field. The chapters originate from papers presented during the Trends in Logic XI conference at the Ruhr University Bochum, June 2012. (shrink)

The paper provides an alternative interpretation of ‘pair points’, discussed in Beall et al., "On the ternary relation and conditionality", J. of Philosophical Logic 41(3), 595-612. Pair points are seen as points viewed from two different ‘perspectives’ and the latter are explicated in terms of two independent valuations. The interpretation is developed into a semantics using pairs of Kripke models (‘pair models’). It is demonstrated that, if certain conditions are fulfilled, pair models are validity-preserving copies of positive substructural models. This (...) yields a general soundness and completeness result for a variety of (positive) substructural logics with respect to multimodal Kripke frames with binary accessibility relations. In addition, an epistemic interpretation of pair models is provided. (shrink)

I argue that a compulsive seeking for just one sense of consistency is hazardous to rationality, and that observing the subtle distinctions of reasonableness between individual and groups may suggest wider, structuralistic notions of consistency, even relevant to re-assessing Gödei's Second Incompleteness Theorem and to science as a whole.

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)

In the paper we analyse the problem of axiomatizing the minimal variant of discussive logic denoted as $$ {\textsf {D}}_{\textsf {0}}$$ D 0. Our aim is to give its axiomatization that would correspond to a known axiomatization of the original discussive logic $$ {\textsf {D}}_{\textsf {2}}$$ D 2. The considered system is minimal in a class of discussive logics. It is defined similarly, as Jaśkowski’s logic $$ {\textsf {D}}_{\textsf {2}}$$ D 2 but with the help of the deontic normal logic (...) $$\textbf{D}$$ D. Although we focus on the smallest discussive logic and its correspondence to $$ {\textsf {D}}_{\textsf {2}}$$ D 2, we analyse to some extent also its formal aspects, in particular its behaviour with respect to rules that hold for classical logic. In the paper we propose a deductive system for the above recalled discussive logic. While formulating this system, we apply a method of Newton da Costa and Lech Dubikajtis—a modified version of Jerzy Kotas’s method used to axiomatize $$ {\textsf {D}}_{\textsf {2}}$$ D 2. Basically the difference manifests in the result—in the case of da Costa and Dubikajtis, the resulting axiomatization is pure modus ponens-style. In the case of $$ {\textsf {D}}_{\textsf {0}}$$ D 0, we have to use some rules, but they are mostly needed to express some aspects of positive logic. $$ {\textsf {D}}_{\textsf {0}}$$ D 0 understood as a set of theses is contained in $$ {\textsf {D}}_{\textsf {2}}$$ D 2. Additionally, any non-trivial discussive logic expressed by means of Jaśkowski’s model of discussion, applied to any regular modal logic of discussion, contains $$ {\textsf {D}}_{\textsf {0}}$$ D 0. (shrink)

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...) a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

In this paper, I investigate whether the intuitions that make connexive logics seem plausible might lie in pragmatic phenomena, rather than the semantics of conditional statements. I conclude that pragmatics indeed underwrites these intuitions, at least for indicative statements. Whether this has any effect on logic choice, however, heavily depends on one’s semantic theory of conditionals and on how one chooses to logically treat pragmatic failures.

In this paper we propose substructural propositional logic obtained by da Costa weakening of the intuitionistic negation. We show that the positive fragment of the da Costa system is distributive lattice logic, and we apply a kind of da Costa weakening of negation, by preserving, differently from da Costa, its fundamental properties: antitonicity, inversion, and additivity for distributive lattices. The other stronger paraconsistent logic with constructive negation is obtained by adding an axiom for multiplicative property of weak negation. After that, (...) we define Kripke-style semantics based on possible worlds and derive from it many-valued semantics based on truth-functional valuations for these two paraconsistent logics. Finally, we demonstrate that this model-theoretic inference system is adequate—sound and complete with respect to the axiomatic da Costa-like systems for these two logics. (shrink)

This book contains a selection of the papers presented at the Logic, Reasoning and Rationality 2010 conference in Ghent. The conference aimed at stimulating the use of formal frameworks to explicate concrete cases of human reasoning, and conversely, to challenge scholars in formal studies by presenting them with interesting new cases of actual reasoning. According to the members of the Wiener Kreis, there was a strong connection between logic, reasoning, and rationality and that human reasoning is rational in so far (...) as it is based on logic. Later, this belief came under attack and logic was deemed inadequate to explicate actual cases of human reasoning. Today, there is a growing interest in reconnecting logic, reasoning and rationality. A central motor for this change was the development of non-classical logics and non-classical formal frameworks. The book contains contributions in various non-classical formal frameworks, case studies that enhance our apprehension of concrete reasoning patterns, and studies of the philosophical implications for our understanding of the notions of rationality. (shrink)

Infinity and negation are in various relations and interdependencies one to another. The analysis of negation and infinity aims to better understanding them. Semantical, syntactical, and pragmatic issues will be considered.

This paper argues for a possible-worlds interpretation of the arguments marshalled by Socrates against Protagoras in Plato’s Theaetetus. Specifically, it reads Protagoras’ position as implying a limited form of modal realism, and evaluates both the self-refutation sequence at 170a–71d and the Future Argument at 177c–9c on the basis of this reading. It emerges that Socrates’ project is only partly successful: while the three main arguments of the self-refutation sequence force Protagoras into ever more awkward and metaphysically top-heavy positions, and the (...) Future Argument is psychologically compelling, these arguments do not force a collapse of the relativist position. Protagoras can still defend himself, though the cost is high. (shrink)

In this paper, I investigate whether the intuitions that make connexive logics seem plausible might lie in pragmatic phenomena, rather than the semantics of conditional statements. I conclude that pragmatics indeed underwrites these intuitions, at least for indicative statements. Whether this has any effect on logic choice (and what that effect might be), however, heavily depends on one’s semantic theory of conditionals and on how one chooses to logically treat pragmatic failures.

Correspondence analysis is Kooi and Tamminga’s universal approach which generates in one go sound and complete natural deduction systems with independent inference rules for tabular extensions of many-valued functionally incomplete logics. Originally, this method was applied to Asenjo–Priest’s paraconsistent logic of paradox LP. As a result, one has natural deduction systems for all the logics obtainable from the basic three-valued connectives of LP -language) by the addition of unary and binary connectives. Tamminga has also applied this technique to the paracomplete (...) analogue of LP, strong Kleene logic \. In this paper, we generalize these results for the negative fragments of LP and \, respectively. Thus, the method of correspondence analysis works for the logics which have the same negations as LP or \, but either have different conjunctions or disjunctions or even don’t have them as well at all. Besides, we show that correspondence analyses for the negative fragments of \ and LP, respectively, are also suitable without any changes for the negative fragments of Heyting’s logic \ and its dual \ and LP). (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.

We outline the rather complicated history of attempts at axiomatizing Jaśkowski’s discussive logic $$\mathbf {D_2}$$ D2 and show that some clarity can be had by paying close attention to the language we work with. We then examine the problem of axiomatizing $$\mathbf {D_2}$$ D2 in languages involving discussive conjunctions. Specifically, we show that recent attempts by Ciuciura are mistaken. Finally, we present an axiomatization of $$\mathbf {D_2}$$ D2 in the language Jaśkowski suggested in his second paper on discussive logic, by (...) following a remark of da Costa and Dubikajtis. We also deal with an interesting variant of $$\mathbf {D_2}$$ D2, introduced by Ciuciura, in which negation is also taken to be discussive. (shrink)

In Béziau a logic \ was defined with the help of the modal logic \. In it, the negation operator is understood as meaning ‘it is not necessary that’. The strong soundness–completeness result for \ with respect to a version of Kripke semantics was also given there. Following the formulation of \ we can talk about \-like logics or Beziau-style logics if we consider other modal logics instead of \—such a possibility has been mentioned in [1]. The correspondence result between (...) modal logics and respective Beziau-style logics has been generalised for the case of normal logics naturally leading to soundness–completeness results [see Marcos :279–300, 2005) and Mruczek-Nasieniewska and Nasieniewski :229–248, 2005)]. In Mruczek-Nasieniewska and Nasieniewski :185–196, 2008), :189–203, 2009) some partial results for non-normal cases are given. In the present paper we try to give similar but more general correspondence results for the non-normal-worlds case. To achieve this aim we have to enrich original Beziau’s language with an additional negation operator understood as ‘it is necessary that not’. (shrink)

In the context of modal logics one standardly considers two modal operators: possibility ) and necessity ) [see for example Chellas ]. If the classical negation is present these operators can be treated as inter-definable. However, negative modalities ) and ) are also considered in the literature [see for example Béziau ; Došen :3–14, 1984); Gödel, in: Feferman, Collected works, vol 1, Publications 1929–1936, Oxford University Press, New York, 1986, p. 300; Lewis and Langford ]. Both of them can be (...) treated as negations. In Béziau a logic \ has been defined on the basis of the modal logic \. \ is proposed as a solution of so-called Jaśkowski’s problem [see also Jaśkowski ]. The only negation considered in the language of \ is ‘it is not necessary’. It appears that logic \ and \ inter-definable. This initial correspondence result between \ and \ has been generalised for the case of normal logics, in particular soundness-completeness results were obtained [see Marcos :279–300, 2005); Mruczek-Nasieniewska and Nasieniewski :229–248, 2005)]. In Mruczek-Nasieniewska and Nasieniewski it has been proved that there is a correspondence between \-like logics and regular extensions of the smallest deontic logic. To obtain this result both negative modalities were used. This result has been strengthened in Mruczek-Nasieniewska and Nasieniewski :261–280, 2017) since on the basis of classical positive logic it is enough to solely use \ to equivalently express both positive modalities and negation. Here we strengthen results given in Mruczek-Nasieniewska and Nasieniewski by showing correspondence for the smallest regular logic. In particular we give a syntactic formulation of a logic that corresponds to the smallest regular logic. As a result we characterise all logics that arise from regular logics. From this follows via respective translations a characterisation of a class of logics corresponding to some quasi-regular logics where \ is the smallest element. Moreover, if a given quasi-regular logic is characterised by some class of models, the same class can be used to semantically characterise the logic obtained by our translation. (shrink)

In the field of logics of formal inconsistency, the notion of “consistency” is frequently too broad to draw decisive conclusions with respect to the validity of many theses involving the consistency connective. In this paper, we consider the matter of the axiom 0—i.e., the schema ◦ ◦ϕ—by considering its interpretation in contexts in which “consistency” is understood as a type of verifiability. This paper suggests that such an interpretation is implicit in two extracanonical LFIs—Sören Halldén’s nonsense-logic C and Graham Priest’s (...) cointuitionistic logic daC—drawing some interesting conclusions concerning the status of 0. Initially, we discuss Halldén’s skepticism of this axiom and provide a plausible counterexample to its validity. We then discuss the interpretation of the operator in Priest’s daC and show the equivalence of 0 to the intuitionistic principle of testability. These observations suggest that it may be fruitful for members of the LFI community to look outside the canon for evidence concerning the adoption of principles like 0. (shrink)

Some strategies to turn any logic into a paraconsistent system are examined. In the environment of universal logic, we show how to paraconsistentize logics at the abstract level using a transformation in the class of all abstract logics called paraconsistentization by consistent sets. Moreover, by means of the notions of paradeduction and paraconsequence we go on applying the process of changing a logic converting it into a paraconsistent system. We also examine how this transformation can be performed using multideductive abstract (...) logics. To conclude, the conceptual notion paraconsistent orbit of a logic is proposed. (shrink)

This paper shows how to transform explosive many-valued systems into paraconsistent logics. We investigate mainly the case of three-valued systems exhibiting how non-explosive three-valued logics can be obtained from them.

This paper is an attempt to solve the following problem: given a logic, how to turn it into a paraconsistent one? In other words, given a logic in which ex falso quodlibet holds, how to convert it into a logic not satisfying this principle? We use a framework provided by category theory in order to define a category of consequence structures. Then, we propose a functor to transform a logic not able to deal with contradictions into a paraconsistent one. Moreover, (...) we study the case of paraconsistentization of propositional classical logic. (shrink)

The aim of this paper is to present an algebraic approach to Jaśkowski’s paraconsistent logic D2. We present: a D2-discursive algebra, Lindenbaum- Tarski algebra for D2 and D2-matrices. The analysis is mainly based on the results obtained by Jerzy Kotas in the 70s.