We argue that formal logical systems are four-valued, these four values being determined by the four deductive outcomes: A without ~A, ~A without A, neither A nor ~A, and both A and ~A. We further argue that such systems ought to be three-valued, as any contradiction, A and ~A, should be removed by reconceptualisation of the concepts captured by the system. We follow by considering suitable conditions for the removal of the third value, neither A nor ~A, yielding (...) a classically valued system. We then consider what values are appropriate for the meta-theory, arguing that it should be three-valued, but reducible to the two classical values upon the decidability of the object system. (shrink)

This book provides an incisive, basic introduction to many-valued logics and to the constructions that are "many-valued" at their origin. Using the matrix method, the author sheds light on the profound problems of many-valuedness criteria and its classical characterizations. The book also includes information concerning the main systems of many-valued logic, related axiomatic constructions, and conceptions inspired by many-valuedness. With its selective bibliography and many useful historical references, this book provides logicians, computer scientists, philosophers, and mathematicians with a valuable survey (...) of the subject. (shrink)

The Polish logician Roman Suszko has extensively pleaded in the 1970s for a restatement of the notion of many-valuedness. According to him, as he would often repeat, “there are but two logical values, true and false.” As a matter of fact, a result by W´ojcicki-Lindenbaum shows that any tarskian logic has a many-valued semantics, and results by Suszko-da Costa-Scott show that any many-valued semantics can be reduced to a two-valued one. So, why should one even consider using logics (...) with more than two values? Because, we argue, one has to decide how to deal with bivalence and settle down the tradeoff between logical 2-valuedness and truth-functionality, from a pragmatical standpoint. -/- This paper will illustrate the ups and downs of a two-valued reduction of logic. Suszko’s reductive result is quite non-constructive.We will exhibit here a way of effectively constructing the two-valued semantics of any logic that has a truth-functional finite-valued semantics and a sufficiently expressive language. From there, as we will indicate, one can easily go on to provide those logics with adequate canonical systems of sequents or tableaux. The algorithmic methods developed here can be generalized so as to apply to many non-finitely valued logics as well —or at least to those that admit of computable quasi tabular two-valued semantics, the so-called dyadic semantics. (shrink)

The most natural and straightforward step beyond two‐valued logic is to introduce more logical values, thereby rejecting the principle of bivalence. Another, indirect, way consists in challenging the classical laws concerning the sentence connectives and introducing other non‐two‐valued connectives into the language. Either way, prepositional logic seems fundamental to many‐valuedness, rather than its first‐order extension. Hence, although there has been interesting research into first‐order many‐valued logics, we shall confine our discussion here to the 0‐order case.

Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. Second, we show that for every S5-model there is an equivalent three-valued valuation and vice versa. In general, our Translation Manual gives rise to translations that are exponentially longer than their originals. This fact raises the question whether there are (...) three-valued logics for which there is a shorter translation into S5. The answer is affirmative: we present an elegant linear translation of the Logic of Paradox and of Strong Three-valued Logic into S5. (shrink)

The four-valued semantics of Belnap–Dunn logic, consisting of the truth values True, False, Neither, and Both, gives rise to several nonclassical logics depending on which feature of propositions we wish to preserve: truth, nonfalsity, or exact truth. Interpreting equality of truth values in this semantics as material equivalence of propositions, we can moreover see the equational consequence relation of this four-element algebra as a logic of material equivalence. In this paper, we axiomatize all combinations of these four-valued logics, (...) for example, the logic of truth and exact truth or the logic of truth and material equivalence. These combined systems are consequence relations which allow us to express implications involving more than one of these features of propositions. (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)

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)

Suszko's Thesis maintains that many-valued logics do not exist at all. In order to support it, R. Suszko offered a method for providing any structural abstract logic with a complete set of bivaluations. G. Malinowski challenged Suszko's Thesis by constructing a new class of logics (called q-logics by him) for which Suszko's method fails. He argued that the key for logical two-valuedness was the "bivalent" partition of the Lindenbaum bundle associated with all structural abstract logics, while his q-logics were (...) generated by "trivalent" matrices. This paper will show that contrary to these intuitions, logical two-valuedness has more to do with the geometrical properties of the deduction relation of a logical structure than with the algebraic properties embedded on it. (shrink)

Paradefinite logics are logics that can be used for handling contradictory or partial information. As such, paradefinite logics should be both paraconsistent and paracomplete. In this paper we consider the simplest semantic framework for introducing paradefinite logics. It consists of the four-valued matrices that expand the minimal matrix which is characteristic for first degree entailments: Dunn–Belnap matrix. We survey and study the expressive power and proof theory of the most important logics that can be developed in this framework.

Prior's three-valued modal logic Q was developed as a philosophically interesting modal logic. Thus, we should be able to modify Q as a temporal logic. Although a temporal version of Q was suggested by Prior, the subject has not been fully explored in the literature. In this paper, we develop a three-valued temporal logic $Q_t $ and give its axiomatization and semantics. We also argue that $Q_t $ provides a smooth solution to the problem of future contingents.

Non-deterministic matrices are multiple-valued structures in which the value assigned by a valuation to a complex formula can be chosen non-deterministically out of a certain nonempty set of options. We consider two different types of semantics which are based on Nmatrices: the dynamic one and the static one . We use the Rasiowa-Sikorski decomposition methodology to get sound and complete proof systems employing finite sets of mv-signed formulas for all propositional logics based on such structures with either of the above (...) types of semantics. Later we demonstrate how these systems can be converted into cut-free ordinary Gentzen calculi which are also sound and complete for the corresponding non-deterministic semantics. As a by-product, we get new semantic characterizations for some well-known logics. (shrink)

In some presentations of classical and intuitionistic logics, the objectlanguage is assumed to contain (two) truth-value constants: ⊤ (verum) and ⊥ (falsum), that are, respectively, true and false under every bivalent valuation. We are interested to define and study analogical constants ‡, 1 ≤ i ≤ n, that in an arbitrary multi-valued logic over truth-values V = {v1,..., vn} have the truth-value vi under every (multi-valued) valuation. As is well known, the absence or presence of such constants has a (...) significant deductive impact on the logics studied. We define such constants proof-theoretically via their associated I/E-rules in a natural-deduction proof system. In particular, we propose a generalization of the notions of contradiction and explosiveness of a logic to the context of multi-valued logics. (shrink)

The paper turns attention to some very general questions that concern the nature of logic – it deals with the problem of the identity of logic. It suggests that we can view the notion of value as one through which we can approach the elusive issues which surround the question of the nature of logic. The first part of the paper addresses the question of the value of logic as a discipline. In other words – it aims at answering the (...) question what is (or could/should be) the benefit of exercising logic. The second part focuses on the question of what role values play (or could/should play) ‘inside’ of logic. It suggests that the elusive and general term “value” can perhaps turn out quite useful in the project of delineation of the realm of logic. The conclusion can be formulated in the provocative slogan: logic can be seen as a kind of general formal theory of values. (shrink)

In so-called full second-order logic, the second-order variables range over all subsets and relations of the domain in question. In so-called Henkin second-order logic, every model is endowed with a set of subsets and relations which will serve as the range of the second-order variables. In our Boolean-valued second-order logic, the second-order variables range over all Boolean-valued subsets and relations on the domain. We show that under large cardinal assumptions Boolean-valued second-order logic is more robust than full second-order logic. Its (...) validity is absolute under forcing, and its Hanf and Löwenheim numbers are smaller than those of full second-order logic. (shrink)

In this paper I reject the normative interpretation of logic and give reasons for a realistic account based on the ontological treatment of logical values.

This chapter contains sections titled: Two‐and Three‐Valued Logics Finite Valued Systems with more than Three Values Infinite Valued Systems Vagueness, Many‐valued and Fuzzy Logics Boolean Valued Systems Supervaluations are Boolean Valued Logics Free Logic Intuitionism Conclusions.

Łukasiewicz three-valued logic Ł3 is often understood as the set of all 3-valued valid formulas according to Łukasiewicz’s 3-valued matrices. Following Wojcicki, in addition, we shall consider two alternative interpretations of Ł3: “well-determined” Ł3a and “truth-preserving” Ł3b defined by two different consequence relations on the 3-valued matrices. The aim of this paper is to provide (by using Dunn semantics) dual equivalent two-valued under-determined and over-determined interpretations for Ł3, Ł3a and Ł3b. The logic Ł3 is axiomatized as an extension of Routley (...) and Meyer’s basic positive logic following Brady’s strategy for axiomatizing many-valued logics by employing two-valued under-determined or over-determined interpretations. Finally, it is proved that “well determined” Łukasiewicz logics are paraconsistent. (shrink)

The present note offers a proof for separating the truth-values of an arbitrary finitely many valued Łukasiewicz logic by making use of Gray codes.

Various interrelationships between two-valued and many-valued logics are examined in . In the present article we propose to discuss questions bearing on these interrelations which have either not been clearly identified as philosophical in that book, were not given sufficiently detailed explanation, or were not touched upon at all.

This article investigates Kripke-style semantics for two sorts of logics: pseudo-Boolean and weak-Boolean logics. As examples of the first, we introduce G3 and S53pB.G3 is the three-valued Dummett–Gödel logic; S53pB is the modal logic S5 but with its orthonegation replaced by a pB negation. Examples of wB logic are G3wB and S53wB.G3wB is G3 with a wB negation in place of its pB negation; S53wB is S5 with a wB negation replacing its orthonegation. For each system, we provide a three-valued (...) Kripke-style semantics with and without star operation . We prove soundness and completeness theorems in each case. Note that wB logics may be equivalent to logics with Baaz’s projection Δ. We finally introduce the G3 and the S53pB both with Δ and show that they are equivalent to G3wB and S53wB, respectively. (shrink)

ukasiewicz''s four-valued modal logic is surveyed and analyzed, together with ukasiewicz''s motivations to develop it. A faithful interpretation of it in classical (non-modal) two-valued logic is presented, and some consequences are drawn concerning its classification and its algebraic behaviour. Some counter-intuitive aspects of this logic are discussed in the light of the presented results, ukasiewicz''s own texts, and related literature.

Among non-monotonic systems of reasoning, non-monotonic modal logics, and autoepistemic logic in particular, have had considerable success. The presence of explicit modal operators allows flexibility in the embedding of other approaches. Also several theoretical results of interest have been established concerning these logics. In this paper we introduce non-monotonic modal logics based on many-valued logics, rather than on classical logic. This extends earlier work of ours on many-valued modal logics. Intended applications are to situations involving several reasoners, not just one (...) as in the standard development. (shrink)

Formal axiology, as does every scientific system, stems from the unfolding of its axiom or axioms. The axiom of formal axiology is the following: Value is the degree in which a thing fulfills the attributes contained in the intension of its concept. "Fulfillment" means the possession by a thing of a set of properties corresponding to the set of attributes in the intension of its concept. A thing is good if it possesses all the properties in question. The development of (...) this axiom constitutes an axiological system, which establishes the dimensions of value, a hierarchy of value, a language of value and a logic of value. (shrink)

This paper tries to clarify the logical structure of the relationship between labor values and prices from an axiomatic perspective. The famous “transformation problem” is interpreted as an impossibility result for a specific interpretation of value theory based on specific assumptions and definitions. A comprehensive review of recent literature is provided, which shows that there are various theoretically relevant and logically consistent alternative interpretations based on different assumptions and definitions.

The aim of this paper is to study a particular family of non-deterministic semantics for modal logics that has eight truth-values. These eight-valued semantics can be traced back to Omori and Skurt (2016), where a particular member of this family was used to characterize the normal modal logic K. The truth-values in these semantics convey information about a proposition’s truth/falsity, whether the proposition is necessary/not necessary, and whether it is possible/not possible. Each of these triples is represented by (...) a unique value. In this paper we will study which modal logics can be obtained by changing the interpretation of the $$\Box $$ modality, assuming that the interpretation of other connectives stays constant. We will show what axioms are responsible for a particular interpretations of $$\Box $$. Furthermore, we will study subsets of these axioms. We show that some of the combinations of the axioms are equivalent to well-known modal axioms. We apply the level-valuation technique to all of the systems to regain the closure under the rule of necessitation. We also point out that some of the resulting logics are not sublogics of S5 and comment briefly on the corresponding frame conditions that are forced by these axioms. Ultimately, we sketch a proof of meta-completeness for all of these systems. (shrink)

Classical logic of formal provability includes Löb’s theorem, but not reflection. In contrast, intuitions about the inferential behavior of informal provability (in informal mathematics) seem to invalidate Löb’s theorem and validate reflection (after all, the intuition is, whatever mathematicians prove holds!). We employ a non-deterministic many-valued semantics and develop a modal logic T-BAT of an informal provability operator, which indeed does validate reflection and invalidates Löb’s theorem. We study its properties and its relation to known provability-related paradoxical arguments. We also (...) argue that T-BAT is a fairly sensible candidate for a formal logic of informal provability. (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 roots of the Lvov-Warsaw School can be traced back to Aristotle himself. But in later times we better put them into thinking GW Leibniz and who somehow inherited many of these ways of thinking, such as the philosopher and mathematician Bernhard Bolzano. Since he would pass the key figure of Franz Brentano, who had as one of his disciples to Kazimierz Twardowski, which starts with the brilliant Polish school of mathematics and philosophy dealt with. Among them, one of the (...) most interesting thinkers must be Jan Lukasiewicz, the father of many-valued logic.Jan Łukasiewicz began teaching at the University of Lvov, and then at Warsaw, but after World War II must to continue in Dublin. Some questions may be very astonishing in the CV of Łukasiewicz. For instance, that a firstly Polish Minister of Education in Paderewski cabinet, into the new Polish Republic, and also Rector for two times at Warsaw University, was awarded with a Doctorate ‘Honoris Causa’ in spring 1936, at University of Münster, into the maximum of effervescency of Nazism in Germany. The explanation must be their good relation with a very good friend, the former theologian, and then logician, Heinrich Schölz, who was the first Chairman of Mathematical Logic in German universities.Łukasiewicz firstly studied Law, and then Mathematics and Philosophy in Lvov. His doctoral supervisor was Kazimierz Twardowski, and in 1902 he obtain his Ph. D. title with a very special mention: ‘sub auspiciis Imperatoris’. Also he received a doctorate ring with diamonds from the Kaiser of the Austro-Hungarian Empire, Franz Joseph I.From 1902, Łukasiewicz was employed as a private teacher, and also as a desk in the Universitary Library of Lvov. So it was until 1904 when he obtained a scholarship to study abroad. He defends his ‘Habilitationschrift’ in 1906, entitled “Analysis and construction of the concept of cause”. This permits to give university courses. His first lectures were on the Algebra of Logic, according to the recent translation to Polish of this book of the French logician Louis Couturat.Between 1902 and 1906, Lukasiewicz continued his studies in the universities of Berlin and Leuwen. In 1906, by his ‘Habilitationschrift’, he obtain the qualification as university professor at Lvov. And the, in 1911, he was appointed as associate professor in his ‘alma mater’.Jan Łukasiewicz was also very active in historical research on logic, giving a new and up-to-date interpretation of Aristotle’s syllogism and of the Stoics’ propositional calculus. According to Scholz, the better pages on history of logic are due to him. And also, as Arianna Betti says, “Jan Lukasiewicz is first and foremost associated with the rejection of the Principle of Bivalence and the discovery of Many-Valued Logic.”The discovery of MVL by Lukasiewicz was in 1918, a little earlier than Emil Leon Post. According to Jan Wolenski, “although Post’s remarks were parenthetical and extremely condensed, Lukasiewicz explained his intuitions and motivations carefully and at length. He was guided by considerations about future contingents and the concept of possibility”. So, he introduces, firstly, three-valued logic, then four-valued logic, generalized to logics with an arbitrary finite number of veritative values, and finally, to logics with a countably infinite-valued number of such values.Very noteworthy is his treatment of the history of logic in the light of the new formal logic. Thus, not only he addressed the issue of future contingents departing from Aristotle, but also put in value logic of the Stoics, at least so far taken. In fact, Heinrich Scholz said, rightly, that Lukasiewicz had written the most lucid pages on the history of logic. (shrink)

In this article, I first analyze and assess the epistemological and semantic status of canonical value-range equations in the formal language of Frege’s Grundgesetze der Arithmetik. I subsequently scrutinize the relation between (a) his informal, metalinguistic stipulation in Grundgesetze I, Section 3, and (b) its formal counterpart, which is Basic Law V. One point I argue for is that the stipulation in Section 3 was designed not only to fix the references of value-range names, but that it was probably also (...) intended to play a regulative role with an eye to Basic Law V. I further intend to shed new light on the status of Frege’s identification of the truth-values with their unit classes in Grundgesetze I, Section 10 and determine its place and importance in his overall logicist project. In a subsequent section, I first discuss the hypothetical extendability of the logical system of Grundgesetze. In what follows, I analyze the incompleteness of that system—were it not inconsistent and hence trivially complete—by focusing on the role of the definite description operator and the axiom governing it (= Basic Law VI) as well as on the role of the application operator. The latter is defined by means of the former. I further comment on the redundancy of an axiom that could be designed to supplement Basic Law VI by incorporating the second clause of Frege’s two-part elucidation of the description operator. I argue that although it seems likely that Basic Law VI could have been shown to be dispensable in Grundgesetze, Frege would probably have been reluctant to dispense with it, despite his commitment to axiomatic parsimony. In my view, the reason is that he considers it essential that every primitive function-name of his formal language be governed and grounded by a basic law that is tailored to the nature and the role of the primitive name occurring at a key point in the law. Toward the end of the article, I propose solutions to two problems with Frege’s use of “=” in the concept-script sentences that result from his definitions involving the replacement of the double stroke of definition with the judgment-stroke. I conclude the article with a summary of the main results that I have achieved. (shrink)

This article is an exercise in the transposition of certain approaches in analytic philosophy to issues concerning business value and identity in business. We examine the notion of business value and several accounts of value that have been offered in the literature. Luciano Floridi’s formal logical account of a business is introduced and applied as a first step towards a logical framework of business value. Peter Peverelli has claimed that Chinese business identity is accounted for in terms of (...) competitors, administration levels, hierarchical structures, and those government agencies with jurisdiction over enterprises (viz. regulators). It is argued that this quadripartite method of identification cannot be fully generalized to all businesses in any geographical location since distinct businesses can exist which have the same competitors, administration levels, hierarchical structures, and governed by the same government agencies. In such a case the distinguishing features of the businesses are the job descriptions or duties of the employees. Hence job descriptions or duties play an important role in the identification of businesses. It turns out that the identification of business according to the job descriptions of employees has less in common with Peverelli's approach and more in common with Bang, Cleemann, and Drucker's notion of business value understood in terms of the technical and the social "as processes and as outputs of production”. (shrink)

The logic $G3^{<}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$ was introduced in Robles and Mendéz as a paraconsistent logic which is based on Gödel’s 3-valued matrix, except that Kleene–Łukasiewicz’s negation is added to the language and is used as the main negation connective. We show that $G3^{<}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$ is exactly the intersection of $G3^{\{1\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$ and $G3^{\{1,0.5\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$, the two truth-preserving 3-valued logics which are based on the same truth tables. We then construct a Hilbert-type system which has for $\to $ as its sole rule of inference, and is (...) strongly sound and complete for $G3^{<}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$. Then we show how, by adding one axiom or one new rule of inference, we get strongly sound and complete systems for $G3^{\{1\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$ and $G3^{\{1,0.5\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$. Finally, we provide quasi-canonical Gentzen-type systems which are sound and complete for those logics and show that they are all analytic, by proving the cut-elimination theorem for them. (shrink)

We continue a series of papers on a family of many-valued modal logics, a family whose Kripke semantics involves many-valued accessibility relations. Earlier papers in the series presented a motivation in terms of a multiple-expert semantics. They also proved completeness of sequent calculus formulations for the logics, formulations using a cut rule in an essential way. In this paper a novel cut-free tableau formulation is presented, and its completeness is proved.

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

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)

Four-valued semantics proved useful in many contexts from relevance logics to reasoning about computers. We extend this approach further. A sequent calculus is defined with logical connectives conjunction and disjunction that do not distribute over each other. We give a sound and complete semantics for this system and formulate the same logic as a tableaux system. Intensional conjunction and its residuals can be added to the sequent calculus straightforwardly. We extend a simplified version of the earlier semantics for this (...) system and prove soundness and completeness. Then, with some modifications to this semantics, we arrive at a mathematically elegant yet powerful semantics that we call generalized Kripke semantics. (shrink)

It is part of the current wisdom that the Liar and similar semantic paradoxes can be taken care of by the use of certain non-classical multivalued logics. In this paper I want to suggest that bivalent logic can do just as well. This is accomplished by using a non-deterministic matrix to define the negation connective. I show that the systems obtained in this way support a transparent truth predicate. The paper also contains some remarks on the conceptual interest of such (...) systems. (shrink)

This paper was read at University of Aarhus in 2016. An improved version was later published as Fitting-attitude Analysis and The Logical Consequence Argument”, in Philosophical Quarterly (2018).