In a recent paper we have defined an analytic tableau calculus PL_16 for a functionally complete extension of Shramko and Wansing's logic based on the trilattice SIXTEEN_3. This calculus makes it possible to define syntactic entailment relations that capture central semantic relations of the logic---such as the relations |=_t, |=_f, and |=_i that each correspond to a lattice order in SIXTEEN_3; and |=, the intersection of |=_t and |=_f,. -/- It turns out that our method of characterising these semantic relations---as (...) intersections of auxiliary relations that can be captured with the help of a single calculus---lends itself well to proving interpolation. All entailment relations just mentioned have the interpolation property, not only when they are defined with respect to a functionally complete language, but also in a range of cases where less expressive languages are considered. For example, we will show that |=, when restricted to L_{tf}, the language originally considered by Shramko and Wansing, enjoys interpolation. This answers a question that was recently posed by M. Takano. (shrink)

By and large, the conditional connective in three-valued logic has two different functions. First, by means of a deduction theorem, it can express a specific relation of logical consequence in the logical language itself. Second, it can represent natural language structures such as "if/then'' or "implies''. This chapter surveys both approaches, shows why none of them will typically end up with a three-valued material conditional, and elaborates on connections to probabilistic reasoning.

2nd edition. Many-valued logics are those logics that have more than the two classical truth values, to wit, true and false; in fact, they can have from three to infinitely many truth values. This property, together with truth-functionality, provides a powerful formalism to reason in settings where classical logic—as well as other non-classical logics—is of no avail. Indeed, originally motivated by philosophical concerns, these logics soon proved relevant for a plethora of applications ranging from switching (...) theory to cognitive modeling, and they are today in more demand than ever, due to the realization that inconsistency and vagueness in knowledge bases and information processes are not only inevitable and acceptable, but also perhaps welcome. The main modern applications of (any) logic are to be found in the digital computer, and we thus require the practical knowledge how to computerize—which also means automate—decisions (i.e. reasoning) in many-valued logics. This, in turn, necessitates a mathematical foundation for these logics. This book provides both these mathematical foundation and practical knowledge in a rigorous, yet accessible, text, while at the same time situating these logics in the context of the satisfiability problem (SAT) and automated deduction. The main text is complemented with a large selection of exercises, a plus for the reader wishing to not only learn about, but also do something with, many-valued logics. (shrink)

1971. Discourse Grammars and the Structure of Mathematical Reasoning II: The Nature of a Correct Theory of Proof and Its Value, Journal of Structural Learning 3, #2, 1–16. REPRINTED 1976. Structural Learning II Issues and Approaches, ed. J. Scandura, Gordon & Breach Science Publishers, New York, MR56#15263. -/- This is the second of a series of three articles dealing with application of linguistics and logic to the study of mathematical reasoning, especially in the setting of a concern for improvement of (...) mathematical education. The present article presupposes the previous one. Herein we develop our ideas of the purposes of a theory of proof and the criterion of success to be applied to such theories. In addition we speculate at length concerning the specific kinds of uses to which a successful theory of proof may be put vis-a-vis improvement of various aspects of mathematical education. The final article will deal with the construction of such a theory. The 1st is the 1971. Discourse Grammars and the Structure of Mathematical Reasoning I: Mathematical Reasoning and Stratification of Language, Journal of Structural Learning 3, #1, 55–74. https://www.academia.edu/s/fb081b1886?source=link . (shrink)

Lockdowns, or modern quarantines, involve the use of novel restrictive non-pharmaceutical interventions (NPIs) to suppress the transmission of COVID-19. In this paper, I aim to critically analyze the emerging history and philosophy of lockdowns, with an emphasis on the communication of health evidence and risk for informing policy decisions. I draw a distinction between evidence-based and modeling-based decision-making. I argue that using the normative framework of evidence-based medicine would have recommended against the use of lockdowns. I first review the World (...) Health Organization’s evidence-based pandemic preparedness plans for respiratory viruses. I then provide a very brief history of COVID-19 modeling, which was cited as justification for the use of lockdowns in the U.K., the U.S., and much of the world. I focus on the so-called Imperial College model designed by Neil Ferguson et al. as well as the so-called Oxford model designed by José Lourenço et al. I analyze the evidence-based pandemic response known as ‘mitigation’, and I compare it with Ferguson et al.’s experimental strategy known as ‘suppression’. I summarize the strengths and weaknesses of these strategies based on their diametric aims and each model’s parametric assumptions. Based on my critical analysis of the suppression strategy, I attempt to expose what has been called the ‘logic of lockdowns’, which Sunetra Gupta of the Oxford model group has suggested is flawed. Finally, I consider Trisha Greenhalgh’s objection to evidence-based policy based on the precautionary principle, and I attempt to offer a response. I conclude with a brief narrative review of the emerging randomized evidence on restrictive NPIs, which seems to support my claim that mitigation was the strategy that would have been recommended by evidence-based medicine. If this is true, then COVID-19 modeling may serve as an important reminder of the enduring lesson of evidence-based medicine: that one should always ‘Trust the Evidence!’ for better health policy. (shrink)

This paper is an original attempt to understand the foundations of economic reasoning. It endeavors to rigorously define the relationship between subjective interpretations and objective valuations of such interpretations in the context of theoretical economics. This analysis is substantially expanded through a dynamic approach, where the truth of a valuation results in an updated interpretation or changes in the agent's subjective belief regarding the effectiveness of the selected action as well as the objective reality of the effectiveness of all other (...) possible actions (i.e. consequence realization). Complications arise when the economic agent is presented with a set of actions that render ambiguous preference, or when the effectiveness of an action cannot be perceived upon its selection, thereby necessitating a different theory of choice and consequence realization. (shrink)

The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof (...) theory of finite-valued first order logics in a general way, and to present some of the more important results in this area. In Systems covered are the resolution calculus, sequent calculus, tableaux, and natural deduction. This report is actually a template, from which all results can be specialized to particular logics. (shrink)

A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite -valued logic if the labels are interpreted as sets of truth values. Furthermore, it is shown that any finite -valued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic (...) in the number of truth values, and it is shown that this bound is tight. (shrink)

Łukasiewicz has often been criticized for his motive for inventing his three-valued logic, namely the avoidance of determinism. First of all, I want to show that almost all of the critcism along this line was wrong. Second I will indicate that he made mistakes, however, in constructing his system, because he had other motives at the same time. Finally I will propose some modification of his system and its interpretation which can attain his original purpose in some sense.

Does it make sense to employ modern logical tools for ancient philosophy? This well-known debate2 has been re-launched by the indologist Piotr Balcerowicz, questioning those who want to look at the Eastern school of Jainism with Western glasses. While plainly acknowledging the legitimacy of Balcerowicz's mistrust, the present paper wants to propose a formal reconstruction of one of the well-known parts of the Jaina philosophy, namely: the saptabhangi, i.e. the theory of sevenfold predication. Before arguing for this formalist approach to (...) philosophy, let us return to the reasons to be reluctant at it. (shrink)

I apply Kooi and Tamminga's (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K3). First, I characterize each possible single entry in the truth-table of a unary or a binary truth-functional operator that could be added to K3 by a basic inference scheme. Second, I define a class of natural deduction systems on the basis of these characterizing basic inference schemes and a natural deduction system for K3. Third, I show that each of (...) the resulting natural deduction systems is sound and complete with respect to its particular semantics. Among other things, I thus obtain a new proof system for Lukasiewicz's three-valued logic. (shrink)

هو أول كتاب باللغة العربية يعرض لمراحل وآليات تطور المنطق الرمزي المعاصر متعدد القيم بأنساقه المختلفة، مركزًا على مشكلة الغموض المعرفي للإنسان بأبعادها اللغوية والإبستمولوجية والأنطولوجية، والتي تتجلى – على سبيل المثال – فيما تحفل به الدراسات الفلسفية والمنطقية والعلمية من مفارقات تمثل تحديًا قويًا لثنائية الصدق والكذب الكلاسيكية، وكذلك في اكتشاف «هيزنبرج» لمبدأ اللايقين، وتأكيده وعلماء الكمّ على ضرورة التفسيرات الإحصائية في المجال دون الذري، الأمر الذي يؤكد عدم فعالية قانون الثالث المرفوع في التعامل مع معطيات الواقع الفعلي، واستحالة (...) مشروع إقامة لغة مثالية أو اصطناعية أو كاملة منطقيًا تتجاوز عيوب ونقائص اللغة العادية التي نفكر ونتعامل بها. وينتهي الكتاب إلى نتيجة مؤداها أن ما واجهه المنطق الكلاسيكي – ثنائي القيم – من مشكلات أدت إلى تطويره، لاسيما مشكلة الغموض، لابد وأن يواجهه بالمثل المنطق متعدد القيم، ذلك أن الغموض ظاهرة إبستمولوجية في المحل الأول، مردودها إلى الذات العارفة وقصور إمكاناتها الإدراكية والقياسية، لا إلى الوجود ذاته. وأننا حتى لو سمحنا لأية قضية منطقية بقيمة صدق ثالثة، أو بأكثر من قيمة تتوسط بين الصدق التام والكذب التام، فسوف تظل القضية – كتمثيل لغوي لإحدى وقائع العالم – صادقة أو كاذبة، سواء أدركنا ذلك أو لم ندركه، وذلك تأكيد لنزعة أفلاطون الواقعية القائلة بوجود أزلي وثابت للحقائق في عالم المثل، تحول دون معرفتنا الظنية بظلالها في عالم الحس المتغير. ويعني ذلك بعبارة أخرى أن الشك في قانون الثالث المرفوع هو إسقاط من الذات على الموضوع، مبعثه عدم اكتمال العملية المعرفية ومحدوديتها، وأن ظهور الأنساق المنطقية ذات القيم المتعددة ما هو إلا حلقة من حلقات العلاقة الجدلية اللامنتهية بين الإنسان والطبيعة، أو بيم ما هو مُدرك وما هو موجود بالفعل. والكتاب بصفة عامة هو أول كتاب باللغة العربية يعرض لأنساق المنطق متعدد القيم بعد مرحلة البرينكيبيا ماثيماتيكا. (shrink)

Intuitionistic Propositional Logic is proved to be an infinitely many valued logic by Gödel (Kurt Gödel collected works (Volume I) Publications 1929–1936, Oxford University Press, pp 222–225, 1932), and it is proved by Jaśkowski (Actes du Congrés International de Philosophie Scientifique, VI. Philosophie des Mathématiques, Actualités Scientifiques et Industrielles 393:58–61, 1936) to be a countably many valued logic. In this paper, we provide alternative proofs for these theorems by using models of Kripke (J Symbol Logic 24(1):1–14, 1959). Gödel’s (...) proof gave rise to an intermediate propositional logic (between intuitionistic and classical), that is known nowadays as Gödel or the Gödel-Dummett Logic, and is studied by fuzzy logicians as well. We also provide some results on the inter-definability of propositional connectives in this logic. (shrink)

How to say no less, no more about conditional than what is needed? From a logical analysis of necessary and sufficient conditions (Section 1), we argue that a stronger account of conditional can be obtained in two steps: firstly, by reminding its historical roots inside modal logic and set-theory (Section 2); secondly, by revising the meaning of logical values, thereby getting rid of the paradoxes of material implication whilst showing the bivalent roots of conditional as a speech-act based on affirmations (...) and rejections (Section 3). Finally, the two main inference rules for conditional, viz. Modus Ponens and Modus Tollens, are reassessed through a broader definition of logical consequence that encompasses both a normal relation of truth propagation and a weaker relation of falsity non-propagation from premises to conclusion (Section 3). (shrink)

The aim of this paper is to emphasize the fact that for all finitely-many-valued logics there is a completely systematic relation between sequent calculi and tableau systems. More importantly, we show that for both of these systems there are al- ways two dual proof sytems (not just only two ways to interpret the calculi). This phenomenon may easily escape one’s attention since in the classical (two-valued) case the two systems coincide. (In two-valued logic the assignment of (...) a truth value and the exclusion of the opposite truth value describe the same situation.). (shrink)

A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established. As an application, an analog of Herbrand’s theorem for the four-valued knowledge-representation logic of Belnap and Ginsberg is presented. It is indicated how this theorem can be used for reasoning about knowledge bases with incomplete and inconsistent information.

Fred shows how problems with Slater's restriction of the classical propositional logic can be solved.

The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that (...) the optimal candidate matrices for (1) can be computed from the calculus. (shrink)

Recently, Bourne constructed a system of three-valued logic that he supposed to replace Łukasiewicz’s three-valued logic in view of the problems of future contingents. In this paper, I will show first that Bourne’s system makes no improvement to Łukasiewicz’s system. However, finding some good motivations and lessons in his attempt, next I will suggest a better way of achieving his original goal in some sense. The crucial part of my way lies in reconsidering the significance of the intermediate (...) truth-value so as to reconstruct Łukasiewicz’s three-valued logic as a kind of extensional modal logic based on partial logic. (shrink)

A construction principle for natural deduction systems for arbitrary, finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness, and normal-form theorems for natural deduction systems.

FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists (...) of linear operational rules and only two branching structural rules, the latter expressing a generalized rule of bivalence. This system naturally leads to defining an infinite hierarchy of tractable depth-bounded approximations to FDE. Namely, approximations in which the number of nested applications of the two branching rules is bounded. (shrink)

Etude de l'extension par la negation semi-intuitionniste de la logique positive des propositions appelee logique C, developpee par A. Urquhart afin de definir une semantique relationnelle valable pour la logique des valeurs infinies de Lukasiewicz (Lw). Evitant les axiomes de contraction et de reduction propres a la logique classique de Dummett, l'A. propose une semantique de type Routley-Meyer pour le systeme d'Urquhart (CI) en tant que celle-la ne fournit que des theories consistantes pour la completude de celui-ci.

Angell's logic of analytic containment AC has been shown to be characterized by a 9-valued matrix NC by Ferguson, and by a 16-valued matrix by Fine. We show that the former is the image of a surjective homomorphism from the latter, i.e., an epimorphic image. The epimorphism was found with the help of MUltlog, which also provides a tableau calculus for NC extended by quantifiers that generalize conjunction and disjunction.

A wide family of many-valued logics—for instance, those based on the weak Kleene algebra—includes a non-classical truth-value that is ‘contaminating’ in the sense that whenever the value is assigned to a formula φ⁠, any complex formula in which φ appears is assigned that value as well. In such systems, the contaminating value enjoys a wide range of interpretations, suggesting scenarios in which more than one of these interpretations are called for. This calls for an evaluation of systems with (...) multiple contaminating values. In this paper, we consider the countably infinite family of multiple-conclusion consequence relations in which classical logic is enriched with one or more contaminating values whose behavior is determined by a linear ordering between them. We consider some motivations and applications for such systems and provide general characterizations for all consequence relations in this family. Finally, we provide sequent calculi for a pair of four-valued logics including two linearly ordered contaminating values before defining two-sided sequent calculi corresponding to each of the infinite family of many-valued logics studied in this paper. (shrink)

The thesis that the two-valued system of classical logic is insufficient to explanation the various intermediate situations in the entity, has led to the development of many-valued and fuzzy logic systems. These systems suggest that this limitation is incorrect. They oppose the law of excluded middle (tertium non datur) which is one of the basic principles of classical logic, and even principle of non-contradiction and argue that is not an obstacle for things both to exist and to not (...) exist at the same time. However, contrary to these claims, there is no inadequacy in the two-valued system of classical logic in explanation the intermediate situations in existence. The law of exclusion and the intermediate situations in the external world are separate things. The law of excluded middle has been inevitably accepted by other logic systems which are considered to reject this principle. The many-valued and the fuzzy logic systems do not transcend the classical logic. Misconceptions from incomplete information and incomplete research are effective in these criticisms. In addition, it is also effective to move the discussion about the intellectual conception (tasawwur) into the field of judgmental assent (tasdiq) and confusion of the mawhum (imaginable) with the ma‘kûl (intellegible). (shrink)

In this paper we re-assess the philosophical foundation of Exactly True Logic ($$\mathcal {ET\!L}$$ ET L ), a competing variant of First Degree Entailment ($$\mathcal {FDE}$$ FDE ). In order to do this, we first rebut an argument against it. As the argument appears in an interview with Nuel Belnap himself, one of the fathers of $$\mathcal {FDE}$$ FDE, we believe its provenance to be such that it needs to be taken seriously. We submit, however, that the argument ultimately fails, (...) and that $$\mathcal {ET\!L}$$ ET L cannot easily be dismissed. We then proceed to give an overview of the research that was inspired by this logic over the last decade, thus providing further motivation for the study of $$\mathcal {ET\!L}$$ ET L and, more generally, of $$\mathcal {FDE}$$ FDE -related logics that result from semantical analyses alternative to Belnap’s canonical one. We focus, in particular, on philosophical questions that these developments raise. (shrink)

(1) This paper is about how to build an account of the normativity of logic around the claim that logic is constitutive of thinking. I take the claim that logic is constitutive of thinking to mean that representational activity must tend to conform to logic to count as thinking. (2) I develop a natural line of thought about how to develop the constitutive position into an account of logical normativity by drawing on constitutivism in metaethics. (3) I argue that, while (...) this line of thought provides some insights, it is importantly incomplete, as it is unable to explain why we should think. I consider two attempts at rescuing the line of thought. The first, unsuccessful response is that it is self-defeating to ask why we ought to think. The second response is that we need to think. But this response secures normativity only if thinking has some connection to human flourishing. (4) I argue that thinking is necessary for human flourishing. Logic is normative because it is constitutive of this good. (5) I show that the resulting account deals nicely with problems that vex other accounts of logical normativity. (shrink)

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have “nice” representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple—at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional (...) class='Hi'>logics represented in various ways can be approximated by finite-valued logics. It is shown that the minimal m-valued logic for which a given calculus is strongly sound can be calculated. It is also investigated under which conditions propositional logics can be characterized as the intersection of (effectively given) sequences of finite-valued logics. (shrink)

Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$, $ss$, $tt$, $ss\cap tt$, and $ts$, when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, (...) in which the middle value acts like one of the classical values). For $st$, the schemes in question are the Boolean normal schemes that are either monotonic or collapsible. (shrink)

In this paper, I consider a family of three-valued regular logics: the well-known strong and weak S.C. Kleene’s logics and two intermedi- ate logics, where one was discovered by M. Fitting and the other one by E. Komendantskaya. All these systems were originally presented in the semantical way and based on the theory of recursion. However, the proof theory of them still is not fully developed. Thus, natural deduction sys- tems are built only for strong Kleene’s (...) logic both with one (A. Urquhart, G. Priest, A. Tamminga) and two designated values (G. Priest, B. Kooi, A. Tamminga). The purpose of this paper is to provide natural deduction systems for weak and intermediate regular logics both with one and two designated values. (shrink)

In 2001, W. Carnielli and Marcos considered a 3-valued logic in order to prove that the schema ϕ ∨ (ϕ → ψ) is not a theorem of da Costa’s logic Cω. In 2006, this logic was studied (and baptized) as G'3 by Osorio et al. as a tool to define semantics of logic programming. It is known that the truth-tables of G'3 have the same expressive power than the one of Łukasiewicz 3-valued logic as well as the one (...) of Gödel 3-valued logic G3. From this, the three logics coincide up-to language, taking into acccount that 1 is the only designated truth-value in these logics. -/- From the algebraic point of view, Canals-Frau and Figallo have studied the 3-valued modal implicative semilattices, where the modal operator is the well-known Moisil-Monteiro-Baaz Δ operator, and the supremum is definable from this. We prove that the subvariety obtained from this by adding a bottom element 0 is term-equivalent to the variety generated by the 3-valued algebra of G'3. The algebras of that variety are called G'3-algebras. From this result, we obtain the equations which axiomatize the variety of G'3-algebras. Moreover, we prove that this variety is semisimple, and the 3-element and the 2-element chains are the unique simple algebras of the variety. Finally an extension of G'3 to first-order languages is presented, with an algebraic semantics based on complete G'3-algebras. The corresponding soundness and completeness theorems are obtained. (shrink)

This article argues that Nietzsche's transvaluation project refers not to a mere inversion or negation of a set of values but, instead, to a different conception of what a value is and how it functions. Traditional values function within a standard logical framework and claim legitimacy and bindingness based on exogenous authority with absolute extension. Nietzsche regards this framework as unnecessarily reductive in its attempted exclusion of contradiction and real opposition among competing values and proposes a nonstandard, dialetheic model of (...) valuation. (shrink)

This article explores the question of how the members of the Lvov-Warsaw School promoted values that can be regarded as components of so-called logical culture. The author argues that these values are strictly connected with science. With references to Łukasiewicz, Czeżowski, and Kotarbiński,the article explores how values shape the logical culture and determines society as directed towards values. The article connects the meta-philosophical perspective with the philosophical one.

In this paper, the relationship between the e-value of a complex hypothesis, H, and those of its constituent elementary hypotheses, Hj, j = 1… k, is analyzed, in the independent setup. The e-value of a hypothesis H, ev, is a Bayesian epistemic, credibility or truth value defined under the Full Bayesian Significance Testing mathematical apparatus. The questions addressed concern the important issue of how the truth value of H, and the truth function of the corresponding FBST structure M, relate to (...) the truth values of its elementary constituents, Hj, and to the truth functions of their corresponding FBST structures Mj, respectively. (shrink)

The premise that it is logically necessary for a necessary condition of value to be valuable is sometimes used in metaethics in support of the claim that agency, or some constitutive condition of agency or action, has value for all agents. I focus on the most recent application of this premise by Caroline T. Arruda and argue that the premise is false. Despite this defect the relevant evaluative step could still work just in case of agency if an additional condition (...) were satisfied. (shrink)

Infectious logics are systems that have a truth-value that is assigned to a compound formula whenever it is assigned to one of its components. This paper studies four-valued infectious logics as the basis of transparent theories of truth. This take is motivated as a way to treat different pathological sentences differently, namely, by allowing some of them to be truth-value gluts and some others to be truth-value gaps and as a way to treat the semantic pathology suffered (...) by at least some of these sentences as infectious. This leads us to consider four distinct four-valued logics: one where truth-value gaps are infectious, but gluts are not; one where truth-value gluts are infectious, but gaps are not; and two logics where both gluts and gaps are infectious, in some sense. Additionally, we focus on the proof theory of these systems, by offering a discussion of two related topics. On the one hand, we prove some limitations regarding the possibility of providing standard Gentzen sequent calculi for these systems, by dualizing and extending some recent results for infectious logics. On the other hand, we provide sound and complete four-sided sequent calculi, arguing that the most important technical and philosophical features taken into account to usually prefer standard calculi are, indeed, enjoyed by the four-sided systems. (shrink)

Logics based on weak Kleene algebra (WKA) and related structures have been recently proposed as a tool for reasoning about flaws in computer programs. The key element of this proposal is the presence, in WKA and related structures, of a non-classical truth-value that is “contaminating” in the sense that whenever the value is assigned to a formula ϕ, any complex formula in which ϕ appears is assigned that value as well. Under such interpretations, the contaminating states represent occurrences of (...) a flaw. However, since different programs and machines can interact with (or be nested into) one another, we need to account for different kind of errors, and this calls for an evaluation of systems with multiple contaminating values. In this paper, we make steps toward these evaluation systems by considering two logics, HYB1 and HYB2, whose semantic interpretations account for two contaminating values beside classical values 0 and 1. In particular, we provide two main formal contributions. First, we give a characterization of their relations of (multiple-conclusion) logical consequence—that is, necessary and sufficient conditions for a set Δ of formulas to logically follow from a set Γ of formulas in HYB1 or HYB2 . Second, we provide sound and complete sequent calculi for the two logics. (shrink)

The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, Löwenheim (...) and Skolem. Itinerary V surveys the work in logic connected to the Hilbert school, and itinerary V deals specifically with consistency proofs and metamathematics, including the incompleteness theorems. Itinerary VII traces the development of intuitionistic and many-valued logics. Itinerary VIII surveys the development of semantical notions from the early work on axiomatics up to Tarski's work on truth. (shrink)

One of the most prominent myths in analytic philosophy is the so- called “Fregean Axiom”, according to which the reference of a sentence is a truth value. In contrast to this referential semantics, a use-based formal semantics will be constructed in which the logical value of a sentence is not its putative referent but the information it conveys. Let us call by “Question Answer Semantics” (thereafter: QAS) the corresponding formal semantics: a non-Fregean many-valued logic, where the meaning of any (...) sentence is an ordered n-tupled of yes-no answers to corresponding questions. A sample of philosophical problems will be approached in order to justify the relevance of QAS. These include: (1) illocutionary forces, and the logical analysis of speech-acts; (2) the variety of logical negations, and their characterization in terms of restricted ranges of logical values; (3) change in meaning, and the use of dynamic oppositions for belief sets. (shrink)

Complex logic is a novel logical framework, which formalizes the semantics of the categories of matter, space, and time in a system of logic that operates with complex logical objects. A complex logical object represents a superposition of a logical statement and its logical negation positioning any statement co-relatively to its logical negation. In the system of logical notations, where S is a logical statement and Not S is its logical negation, complex logic includes co-relative logical positions of S and (...) Not S with the probabilities of their truth within the scale 0... 1, excluding the boundary values of 0 and 1, into a single logical superposition. Thus, the logical superposition, summing up the probabilistic positions of S and Not S, has an invariant truth value equal to 1. In this context, complex logic proves to be invariant to reality, offering a unified logical interpretation of reality, spanning from quantum to cosmological scales. By defining the nature of matter and reality as a complex two-format processual essence with corresponding logical consequences, complex logic enhances our concept and understanding of reality. (shrink)

Prior’s Tonk is a famously horrible connective. It is defined by its inference rules. My aim in this article is to compare Tonk with some hitherto unnoticed nasty connectives, which are defined in semantic terms. I first use many-valued truth-tables for classical sentential logic to define a nasty connective, Knot. I then argue that we should refuse to add Knot to our language. And I show that this reverses the standard dialectic surrounding Tonk, and yields a novel solution to (...) the problem of many-valued truth-tables for classical sentential logic. I close by outlining the technicalities surrounding nasty connectives on many-valued truth-tables. (shrink)

This note clarifies an error in the proof of the main theorem of “The Ricean Objection: An Analogue of Rice’s Theorem for First-Order Theories”, Logic Journal of the IGPL, 16(6): 585–590(2008).

According to certain normative theories in epistemology, rationality requires us to be logically omniscient. Yet this prescription clashes with our ordinary judgments of rationality. How should we resolve this tension? In this paper, I focus particularly on the logical omniscience requirement in Bayesian epistemology. Building on a key insight by Hacking :311–325, 1967), I develop a version of Bayesianism that permits logical ignorance. This includes: an account of the synchronic norms that govern a logically ignorant individual at any given time; (...) an account of how we reduce our logical ignorance by learning logical facts and how we should update our credences in response to such evidence; and an account of when logical ignorance is irrational and when it isn’t. At the end, I explain why the requirement of logical omniscience remains true of ideal agents with no computational, processing, or storage limitations. (shrink)

In 2016, Béziau introduces a restricted notion of paraconsistency, the so-called genuine paraconsistency. A logic is genuine paraconsistent if it rejects the laws $\varphi,\neg \varphi \vdash \psi$ and $\vdash \neg (\varphi \wedge \neg \varphi)$. In that paper, the author analyzes, among the three-valued logics, which of them satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above-mentioned are $\vdash \varphi, \neg \varphi$ and $\neg (\varphi \vee \neg \varphi) \vdash$. We call genuine paracomplete (...) class='Hi'>logics those rejecting the mentioned properties. We present here an analysis of the three-valued genuine paracomplete logics. A very natural twist structures semantics for these logics is also found in a systematic way. This semantics produces automatically a simple and elegant Hilbert-style characterization for all these logics. Finally, we introduce the logic LGP which is genuine paracomplete is not genuine paraconsistent, not even paraconsistent and cannot be characterized by a single finite logical matrix. (shrink)

Boolean-valued models of set theory were independently introduced by Scott, Solovay and Vopěnka in 1965, offering a natural and rich alternative for describing forcing. The original method was adapted by Takeuti, Titani, Kozawa and Ozawa to lattice-valued models of set theory. After this, Löwe and Tarafder proposed a class of algebras based on a certain kind of implication which satisfy several axioms of ZF. From this class, they found a specific 3-valued model called PS3 which satisfies all (...) the axioms of ZF, and can be expanded with a paraconsistent negation *, thus obtaining a paraconsistent model of ZF. The logic (PS3 ,*) coincides (up to language) with da Costa and D'Ottaviano logic J3, a 3-valued paraconsistent logic that have been proposed independently in the literature by several authors and with different motivations such as CluNs, LFI1 and MPT. We propose in this paper a family of algebraic models of ZFC based on LPT0, another linguistic variant of J3 introduced by us in 2016. The semantics of LPT0, as well as of its first-order version QLPT0, is given by twist structures defined over Boolean agebras. From this, it is possible to adapt the standard Boolean-valued models of (classical) ZFC to twist-valued models of an expansion of ZFC by adding a paraconsistent negation. We argue that the implication operator of LPT0 is more suitable for a paraconsistent set theory than the implication of PS3, since it allows for genuinely inconsistent sets w such that [(w = w)] = 1/2 . This implication is not a 'reasonable implication' as defined by Löwe and Tarafder. This suggests that 'reasonable implication algebras' are just one way to define a paraconsistent set theory. Our twist-valued models are adapted to provide a class of twist-valued models for (PS3,*), thus generalizing Löwe and Tarafder result. It is shown that they are in fact models of ZFC (not only of ZF). (shrink)