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)

Płonka sums consist of an algebraic construction similar, in some sense, to direct limits, which allows to represent classes of algebras defined by means of regular identities. Recently, Płonka sums have been connected to logic, as they provide algebraic semantics to logics obtained by imposing a syntactic filter to given logics. In this paper, I present a very general topological duality for classes of algebras admitting a Płonka sum representation in terms of dualisable algebras.

Paraconsistent weak Kleene logic is the $3$-valued logic based on the weak Kleene matrices and with two designated values. In this paper, we investigate the poset of prevarieties of generalized involutive bisemilattices, focussing in particular on the order ideal generated by Α$\textrm{lg} $. Applying to this poset a general result by Alexej Pynko, we prove that, exactly like Priest’s logic of paradox, $\textrm{PWK}$ has only one proper nontrivial extension apart from classical logic: $\textrm{PWK}_{\textrm{E}}\textrm{,}$ PWK logic plus explosion. This $6$-valued logic, (...) unlike $\textrm{PWK} $, fails to be paraconsistent. We describe its consequence relation via a variable inclusion criterion and identify its Suszko-reduced models. (shrink)

The paper aims at studying, in full generality, logics defined by imposing a variable inclusion condition on a given logic $$\vdash $$. We prove that the description of the algebraic counterpart of the left variable inclusion companion of a given logic $$\vdash $$ is related to the construction of Płonka sums of the matrix models of $$\vdash $$. This observation allows to obtain a Hilbert-style axiomatization of the logics of left variable inclusion, to describe the structure of their reduced models, (...) and to locate them in the Leibniz hierarchy. (shrink)

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)

Bochvar algebras consist of the quasivariety $\mathsf {BCA}$ playing the role of equivalent algebraic semantics for Bochvar (external) logic, a logical formalism introduced by Bochvar [4] in the realm of (weak) Kleene logics. In this paper, we provide an algebraic investigation of the structure of Bochvar algebras. In particular, we prove a representation theorem based on Płonka sums and investigate the lattice of subquasivarieties, showing that Bochvar (external) logic has only one proper extension (apart from classical logic), algebraized by the (...) subquasivariety $\mathsf {NBCA}$ of $\mathsf {BCA}$. Furthermore, we address the problem of (passive) structural completeness ((P)SC) for each of them, showing that $\mathsf {NBCA}$ is SC, while $\mathsf {BCA}$ is not even PSC. Finally, we prove that both $\mathsf {BCA}$ and $\mathsf {NBCA}$ enjoy the amalgamation property (AP). (shrink)

In this paper, we study logical systems which represent entailment relations of two kinds. We extend the approach of finding ‘exactly true’ and ‘non-falsity’ versions of four-valued logics that emerged in series of recent works [Pietz & Rivieccio (2013). Nothing but the truth. Journal of Philosophical Logic, 42(1), 125–135; Shramko (2019). Dual-Belnap logic and anything but falsehood. Journal of Logics and their Applications, 6, 413–433; Shramko et al. (2017). First-degree entailment and its relatives. Studia Logica, 105(6), 1291–1317] to the case (...) of infectious logics, namely to the case of Deutsch's logic Sfde introduced in Deutsch [Relevant analytic entailment. The Relevance Logic Newsletter, 2(1), 26–44; The completeness of S. Studia Logica, 38(2), 137–147]. The particular systems obtained in this way are Setl and Snfl. We present them in the form of sequent calculi and prove corresponding soundness and completeness theorems. We illuminate the connection between Setl, Snfl and two well-known systems, strong Kleene three-valued logic K3 and Priest's Logic of Paradox LP. This connection allows us to investigate the characterisation of the entailment relations associated with Setl and Snfl as well as to introduce the notion of ‘infectious analogue’ of a certain logic. We also study implicative extensions of Setl and Snfl and prove soundness and completeness theorems for them as well. (shrink)