Seen from the point of view of evaluation conditions, a usual way to obtain a connexive logic is to take a well-known negation, for example, Boolean negation or de Morgan negation, and then assign special properties to the conditional to validate Aristotle’s and Boethius’ Theses. Nonetheless, another theoretical possibility is to have the extensional or the material conditional and then assign special properties to the negation to validate the theses. In this paper we examine that possibility, not sufficiently explored in (...) the connexive literature yet.We offer a characterization of connexive negation disentangled from the cancellation account of negation, a previous attempt to define connexivity on top of a distinctive negation. We also discuss an ancient view on connexive logics, according to which a valid implication is one where the negation of the consequent is incompatible with the antecedent, and discuss the role of our idea of connexive negation for this kind of view. (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)

The aim of this paper is to explore the peculiar case of infectious logics, a group of systems obtained generalizing the semantic behavior characteristic of the -fragment of the logics of nonsense, such as the ones due to Bochvar and Halldén, among others. Here, we extend these logics with classical negations, and we furthermore show that some of these extended systems can be properly regarded as logics of formal inconsistency and logics of formal undeterminedness.

In this two-parts paper we present paranormal modal logic: a modal logic which is both paraconsistent and paracomplete. Besides using a general framework in which a wide range of logics  including normal modal logics, paranormal modal logics and classical logic can be defined and proving some key theorems about paranormal modal logic (including that it is inferentially equivalent to classical normal modal logic), we also provide a philosophical justification for the view that paranormal modal logic is a formalization of (...) the notions of skeptical and credulous plausibility. (shrink)

In the literature, Weak Kleene logics are usually taken as three-valued logics. However, Suszko has challenged the main idea of many-valued logic claiming that every logic can be presented in a two-valued fashion. In this paper, we provide two-valued semantics for the Weak Kleene logics and for a number of four-valued subsystems of them. We do the same for the so-called Logics of Nonsense, which are extensions of the Weak Kleene logics with unary operators that allow looking at them as (...) Logics of Formal Inconsistency and Logics of Formal Underterminedness. Our aim with this work, rather than arguing for Suszko’s thesis, is to show that two-valued presentations of these peculiar logics enlighten the non-standard behavior of their logical connectives. More specifically, the two-valued presentations of paraconsistent logics illustrate and clarify the disjunctive flavor of the conjunction, and dually, the two-valued presentations of paracomplete subsystems of Weak Kleene logics reveal the conjunctive flavor of the disjunction. (shrink)

This paper introduces the logic of evidence and truth \ as an extension of the Belnap–Dunn four-valued logic \. \ is a slightly modified version of the logic \, presented in Carnielli and Rodrigues. While \ is equipped only with a classicality operator \, \ is equipped with a non-classicality operator \ as well, dual to \. Both \ and \ are logics of formal inconsistency and undeterminedness in which the operator \ recovers classical logic for propositions in its scope. (...) Evidence is a notion weaker than truth in the sense that there may be evidence for a proposition \ even if \ is not true. As well as \, \ is able to express preservation of evidence and preservation of truth. The primary aim of this paper is to propose a probabilistic semantics for \ where statements \\) and \\) express, respectively, the amount of evidence available for \ and the degree to which the evidence for \ is expected to behave classically—or non-classically for \ \). A probabilistic scenario is paracomplete when \ + P 1\), and in both cases, \ < 1\). If \ = 1\), or \ = 0\), classical probability is recovered for \. The proposition \, a theorem of \, partitions what we call the information space, and thus allows us to obtain some new versions of known results of standard probability theory. (shrink)

In view of the limitations of classical, free, and modal logics to deal with fictional names, we develop in this paper a four-valued logical framework that we see as a promising strategy for modeling contexts of reasoning in which those names occur. Specifically, we propose to evaluate statements in terms of factual and fictional truth values in such a way that, say, declaring ‘Socrates is a man’ to be true does not come down to the same thing as declaring ‘Sherlock (...) Holmes is a man’ to be so. As a result, our framework is capable of representing reasoning involving fictional characters that avoids evaluating statements according to the same semantic standards. The framework encompasses two logics that differ according to alternative ways one may interpret the relationships among the factual and fictional truth values. (shrink)

By weakening an inference rule satisfied by logic daC, we define a new paraconsistent logic, which is weaker than logic \ and G′ 3, enjoys properties presented in daC like the substitution theorem, and possesses a strong negation which makes it suitable to express intutionism. Besides, daC ' helps to understand the relationships among other logics, in particular daC, \ and PH1.

One of the oldest systems of paraconsistent logic is the set of so-called C-systems of Newton da Costa, and this has been generalized into a family of systems now known as logics of formal inconsistencies by Walter Carnielli, Marcelo Coniglio and João Marcos. The characteristic notion in these systems is the so-called consistency operator which, roughly speaking, indicates how gluts are behaving. One natural question then is to ask if we can let not only gluts but also gaps be around (...) and generalize the notion of consistency into classicality. This is already considered by Andréa Loparić and da Costa in the style of C-systems. The aim of this paper is to develop a family of systems that generalizes the system of Loparić and da Costa which may be called logics of formal classicality. (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)

. I give a systematic presentation of a fairly large family of multiple-conclusion modal logics that are paraconsistent and/or paracomplete. After providing motivation for studying such systems, I present semantics and tableau-style proof theories for them. The proof theories are shown to be sound and complete with respect to the semantics. I then show how the “standard” systems of classical, single-conclusion modal logics fit into the framework constructed.

In many real-life applications of logic it is useful to interpret a particular sentence as true together with its negation. If we are talking about classical logic, this situation would force all other sentences to be equally interpreted as true. Paraconsistent logics are exactly those logics that escape this explosive effect of the presence of inconsistencies and allow for sensible reasoning still to take effect. To provide reasonably intuitive semantics for paraconsistent logics has traditionally proven to be a challenge. Possible-translations (...) semantics can meet that challenge by allowing for each interpretation to be composed of multiple scenarios. Using that idea, a logic with a complex semantic behavior can be understood as an appropriate combination of ingredient logics with simpler semantic behaviors into which the original logic is given a collection of translations preserving its soundness. Completeness is then achieved through the judicious choice of the admissible translating mappings. The present note provides interpretation by way of possible-translations semantics for a group of fundamental paraconsistent logics extending the positive fragment of classical propositional logic. The logics PI, Cmin, mbC, bC, mCi and Ci, among others, are all initially presented through their non-truth-functional bivaluation semantics and sequent versions and then split by way of possible-translations semantics based on 3-valued ingredients. (shrink)

The non-alethic systems N1 of da Costa and A of Grana are both paraconsistent and paracomplete. Based on them, a multi-agent doxastic logic NADK can be obtained by logical expansion. The soundness and completeness of NADK are proved and its special theorems are also presented. In this logic, the belief version of the laws of contradiction and excluded middle, as well as the principle of explosion are all invalid. Therefore, it may provide a reliable logical basis for any theory which (...) has paraconsistent or paracomplete epistemic conflicts, such as true contradictions, true contrarieties, and belief paradoxes. We also explain in detail how a non-alethic doxastic logic provides a reliable logical basis for tolerating these three types of epistemic conflicts. The present paper is the deepening and development of system N1 and A. (shrink)

Several logical puzzles, riddles and problems are defined based on the notion of games in informative contexts. Hintikka argues that epistemology or the theory of knowledge must be considered from the notion of information. So, knowledge cannot just be based on the notions of belief and justification. The present proposal will focus on the logical structure of information, and not only on the quantification of information as suggested by Claude A. Shannon. In many cases, the information bits, although seemingly or (...) factually contradictory, are quite relevant. The paraconsistent systems of logic offer a formalization of reasoning that can support certain contradictions. The well-known “Bar-Hillel–Carnap Paradox” causes embarrassment when it concludes that the informational content of a contradiction would be maximum, opposing the traditional notion that the semantic information must be true, and that contradictions are necessarily false. (shrink)

We investigate mathematical structures that provide natural semantics for families of (quantified) non-classical logics featuring special unary connectives, known as recovery operators, that allow us to ‘recover’ the properties of classical logic in a controlled manner. These structures are known as topological Boolean algebras, which are Boolean algebras extended with additional operations subject to specific conditions of a topological nature. In this study, we focus on the paradigmatic case of negation. We demonstrate how these algebras are well-suited to provide a (...) semantics for some families of paraconsistent Logics of Formal Inconsistency and paracomplete Logics of Formal Undeterminedness. These logics feature recovery operators used to earmark propositions that behave ‘classically’ when interacting with non-classical negations. Unlike traditional semantical investigations, which are carried out in natural language (extended with mathematical shorthand), our formal meta-language is a system of higher-order logic (HOL) for which automated reasoning tools exist. In our approach, topological Boolean algebras are encoded as algebras of sets via their Stone-type representation. We use our higher-order meta-logic to define and interrelate several transformations on unary set operations, which naturally give rise to a topological cube of opposition. Additionally, our approach enables a uniform characterization of propositional, first-order and higher-order quantification, including restrictions to constant and varying domains. With this work, we aim to make a case for the utilization of automated theorem proving technology for conducting computer-supported research in non-classical logics. All the results presented in this paper have been formally verified, and in many cases obtained, using the Isabelle/HOL proof assistant. (shrink)

The study of the theory of operators over modal pseudocomplemented De Morgan algebras was begun in papers [20] and [21]. In this paper, we introduce and study the class of modal pseudocomplemented De Morgan algebras enriched by a k-periodic automorphism -algebras). We denote by \ the automorphism where k is a positive integer. For \, the class coincides with the one studied in [20] where the automorphism works as a new unary operator which can be considered as a negation. In (...) the first place, we develop an algebraic study of the class of \-algebras; as consequence, we prove the class \-algebras is a semisimple variety and determine the generating algebras. After doing the algebraic study and using these properties, we built two families of sentential logics that we denote with \ and \ for every k. \ is a 1-assertional logic and \ is the degree-preserving logic both associated with the class of \-algebras. Working over these logics, we prove that \ is paraconsistent with respect to the de Morgan negation \, which is protoalgebraic and finitely equivalential but not algebraizable. In contrast, we prove that \ is algebraizable, sharing the same theorems with \, but not paraconsistent with respect to \. Furthermore, we show that \ and \ are paracomplete logics with respect to \ and \ and paraconsistent logics with respecto to \, for every k. (shrink)

In this paper I probe the idea that neither possibilism nor trivialism could be ruled out on a purely logical basis. I use the apparatus of relational structures used in the semantics for modal logics to engineer some models of possibilism and trivialism and I discuss a philosophical stance about logic, truth values and the meaning of connectives underlying such analysis.

In this paper, we use a ‘normality operator’ in order to generate logics of formal inconsistency and logics of formal undeterminedness from any subclassical many-valued logic that enjoys a truth-functional semantics. Normality operators express, in any many-valued logic, that a given formula has a classical truth value. In the first part of the paper we provide some setup and focus on many-valued logics that satisfy some of the three properties, namely subclassicality and two properties that we call fixed-point negation property (...) and conservativeness. In the second part of the paper, we introduce normality operators and explore their formal behaviour. In the third and final part of the paper, we establish a number of classical recapture results for systems of formal inconsistency and formal undeterminedness that satisfy some or all the properties above. These are the main formal results of the paper. Also, we illustrate concrete cases of recapture by discussing the logics $\mathsf{K}^{\circledast }_{3}$, $\mathsf{LP}^{\circledast }$, $\mathsf{K}^{w\circledast }_{3}$, $\mathsf{PWK}^{\circledast }$ and $\mathsf{E_{fde}}^{\circledast }$, that are in turn extensions of $\mathsf{{K}_{3}}$, $\mathsf{LP}$, $\mathsf{K}^{w}_{3}$, $\mathsf{PWK}$ and $\mathsf{E_{fde}}$, respectively. (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.

There are two foundational, but not fully developed, ideas in paraconsistency, namely, the duality between paraconsistent and intuitionistic paradigms, and the introduction of logical operators that express metalogical notions in the object language. The aim of this paper is to show how these two ideas can be adequately accomplished by the logics of formal inconsistency and by the logics of formal undeterminedness. LFIs recover the validity of the principle of explosion in a paraconsistent scenario, while LFUs recover the validity of (...) the principle of excluded middle in a paracomplete scenario. We introduce definitions of duality between inference rules and connectives that allow comparing rules and connectives that belong to different logics. Two formal systems are studied, the logics mbC and mbD, that display the duality between paraconsistency and paracompleteness as a duality between inference rules added to a common core—in the case studied here, this common core is classical positive propositional logic. The logics mbC and mbD are equipped with recovery operators that restore classical logic for, respectively, consistent and determined propositions. These two logics are then combined obtaining a pair of LFI and undeterminedness, namely, mbCD and mbCDE. The logic mbCDE exhibits some nice duality properties. Besides, it is simultaneously paraconsistent and paracomplete, and able to recover the principles of excluded middle and explosion one at a time. The last sections offer an algebraic account for such logics by adapting the swap structures semantics framework of the LFIs the LFUs. This semantics highlights some subtle aspects of these logics, and allows us to prove decidability by means of finite nondeterministic matrices. (shrink)

From the technical point of view, philosophically neutral, the duality between a paraconsistent and a paracomplete logic lies in the fact that explosion does not hold in the former and excluded middle does not hold in the latter. From the point of view of the motivations for rejecting explosion and excluded middle, this duality can be interpreted either ontologically or epistemically. An ontological interpretation of intuitionistic logic is Brouwer’s idealism; of paraconsistency is dialetheism. The epistemic interpretation of intuitionistic logic is (...) in terms of preservation of constructive proof; of paraconsistency is in terms of preservation of evidence. In this paper, we explain and defend the epistemic approach to paraconsistency. We argue that it is more plausible than dialetheism and allows a peaceful and fruitful coexistence with classical logic. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

The purpose of this paper is to present a paraconsistent formal system and a corresponding intended interpretation according to which true contradictions are not tolerated. Contradictions are, instead, epistemically understood as conflicting evidence, where evidence for a proposition A is understood as reasons for believing that A is true. The paper defines a paraconsistent and paracomplete natural deduction system, called the Basic Logic of Evidence, and extends it to the Logic of Evidence and Truth. The latter is a logic of (...) formal inconsistency and undeterminedness that is able to express not only preservation of evidence but also preservation of truth. LETj is anti-dialetheist in the sense that, according to the intuitive interpretation proposed here, its consequence relation is trivial in the presence of any true contradiction. Adequate semantics and a decision method are presented for both BLE and LETj, as well as some technical results that fit the intended interpretation. (shrink)

The Fregean-inspired Principle of Compositionality of Meaning for formal languages asserts that the meaning of a compound expression is analysable in terms of the meaning of its constituents, taking into account the mode in which these constituents are combined so as to form the compound expression. From a logical point of view, this amounts to prescribing a constraint—that may or may not be respected—on the internal mechanisms that build and give meaning to a given formal system. Within the domain of (...) formal semantics and of the structure of logical derivations, the PoC is often directly reflected by metaproperties such as truth-functionality and analyticity, characteristic of computationally well-behaved logical systems. (shrink)

In this paper, we investigate the family LS0.5 of many-valued modal logics LS0.5's. We prove that the modalities of necessity and possibility of the logics LS0.5's capture well-defined bivalent concepts of logical validity and logical consistency. We also show that these modalities can be used as recovery operators.

The fundamental problem of Christology is the apparent contradiction of Christ as recorded at Chalcedon. Christ is human and Christ is divine. Being divine entails being immutable. Being human entails being mutable. Were Christ two different persons there’d be no apparent contradiction. But Chalcedon rules as much out. Were Christ only partly human or only partly divine there’d be no apparent contradiction. But Chalcedon rules as much out. Were the very meaning of ‘mutable’ and/or ‘immutable’ other than what they are, (...) there’d be no apparent contradiction. But the meaning is what it is, and changing the meaning of our terms to avoid the apparent contradiction of Christ is an apparent flight from reality. What, in the end, is the explanation of the apparent contradiction of Christ? Theologians and philosophers have long advanced many consistency-seeking answers, all of which increase the metaphysical or semantical complexity of the otherwise strikingly simple but radical core of Christianity’s GodMan. In this paper, I put the simplest explanation on the theological table: namely, Christ appears to be contradictory because Christ is contradictory. This explanation may sound complicated to the many who are steeped in the mainstream account of logic according to which logic precludes the possibility of true contradictions. But the mainstream account of logic can and should be rejected. Ridding theology of the dogma of mainstream logic illuminates the simple though striking explanation of the apparent contradiction of Christ — namely, that Christ is a contradictory being. Just as the simplest explanation to the apparent roundness of the earth has earned due acceptance, so too should the simplest explanation of the apparent contradiction of Christ. (shrink)

A proof is presented showing that there is no paraconsistent logics with a standard implication which have a three-valued characteristic matrix, and in which the replacement principle holds.

Paraconsistent logics are logics that, in contrast to classical and intuitionistic logic, do not trivialize inconsistent theories. In this paper we take a paraconsistent view on two famous modal logics: B and S5. We use for this a well-known general method for turning modal logics to paraconsistent logics by defining a new negation as $\neg \varphi =_{Def} \sim \Box \varphi$. We show that while that makes both B and S5 members of the well-studied family of paraconsistent C-systems, they differ from (...) most other C-systems in having the important replacement property. We further show that B is a very robust C-system in the sense that almost any axiom which has been considered in the context of C-systems is either already a theorem of B or its addition to B leads to a logic that is no longer paraconsistent. There is exactly one notable exception, and the result of adding this exception to B leads to the other logic studied here, S5. (shrink)

This paper introduces the logic _Q__L__E__T_ _F_, a quantified extension of the logic of evidence and truth _L__E__T_ _F_, together with a corresponding sound and complete first-order non-deterministic valuation semantics. _L__E__T_ _F_ is a paraconsistent and paracomplete sentential logic that extends the logic of first-degree entailment (_FDE_) with a classicality operator ∘ and a non-classicality operator ∙, dual to each other: while ∘_A_ entails that _A_ behaves classically, ∙_A_ follows from _A_’s violating some classically valid inferences. The semantics of _Q__L__E__T_ (...) _F_ combines structures that interpret negated predicates in terms of anti-extensions with first-order non-deterministic valuations, and completeness is obtained through a generalization of Henkin’s method. By providing sound and complete semantics for first-order extensions of _FDE_, _K3_, and _LP_, we show how these tools, which we call here the method of _anti-extensions + valuations_, can be naturally applied to a number of non-classical logics. (shrink)

Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...) is demonstrated that any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction. We conclude that our mathematical frame work is inappropriate for Theory of Computation. Furthermore, the result provides us a reason that many problems in Complexity Theory resist to be solved.(This work is completed in 2017 -5- 2, it is in vixra in 2017-5-14, presented in Unilog 2018, Vichy). (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)

The purpose of this paper is twofold. First we want to extent a specific paranormal modal logic in such a way as obtain a paraconsistent and paracomplete multimodal logic able to formalize the notions of plausibility and certainty. With this logic at hand, and this is our second purpose, we shall use a modified version of Reiter‘s default logic to build a sort of inductive logic of plausibility and certainty able to represent some basic principles of epistemic inductive reasoning, such (...) as a negative autoepistemic principle, an `error-prone feature of induction' principle and a confirmation by enumeration principle. (shrink)

This paper reviews the central points and presents some recent developments of the epistemic approach to paraconsistency in terms of the preservation of evidence. Two formal systems are surveyed, the basic logic of evidence (BLE) and the logic of evidence and truth (LET J ), designed to deal, respectively, with evidence and with evidence and truth. While BLE is equivalent to Nelson’s logic N4, it has been conceived for a different purpose. Adequate valuation semantics that provide decidability are given for (...) both BLE and LET J . The meanings of the connectives of BLE and LET J , from the point of view of preservation of evidence, is explained with the aid of an inferential semantics. A formalization of the notion of evidence for BLE as proposed by M. Fitting is also reviewed here. As a novel result, the paper shows that LET J is semantically characterized through the so-called Fidel structures. Some opportunities for further research are also discussed. (shrink)