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.

In this work we study the decidability of a class of global modal logics arising from Kripke frames evaluated over certain residuated lattices, known in the literature as modal many-valued logics. We exhibit a large family of these modal logics which are undecidable, in contrast with classical modal logic and propositional logics defined over the same classes of algebras. This family includes the global modal logics arising from Kripke (...) frames evaluated over the standard Łukasiewicz and Product algebras. We later refine the previous result, and prove that global modal Łukasiewicz and Product logics are not even recursively axiomatizable. We conclude by closing negatively the open question of whether each global modal logic coincides with its local modal logic closed under the unrestricted necessitation rule. (shrink)

Extensively classroom-tested, Possibilities and Paradox provides an accessible and carefully structured introduction to modal and many-valued logic. The authors cover the basic formal frameworks, enlivening the discussion of these different systems of logic by considering their philosophical motivations and implications. Easily accessible to students with no background in the subject, the text features innovative learning aids in each chapter, including exercises that provide hands-on experience, examples that demonstrate the application of concepts, and guides to further reading.

This paper explores the modal interpretation of ?ukasiewicz's n -truth-values, his conditional and the puzzles they generate by exploring his suggestion that by ?necessity? he intends the concept used in traditional philosophy. Scalar adjectives form families with nested extensions over the left and right fields of an ordering relation described by an associated comparative adjective. Associated is a privative negation that reverses the ?rank? of a predicate within the field. If the scalar semantics is interpreted over a totally ordered (...) domain of cardinality n and metric ?, an n-valued Lukasiewicz algebra is definable. Privation is analysed in terms of non-scalar adjectives. Any Boolean algebra of 2 n ?properties? determines an n + 1 valued Lukasiewicz algebra. The Neoplatonic ?hierarchy of Being? is essentially the order presupposed by natural language modal scalars. ?ukasiewicz's ≈ is privative negation, and ? proves to stand for the extensional (antitonic) dual if ? then for scalar adjectives, especially modals. Relations to product logics and frequency interpretations of probability are sketched. (shrink)

Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds also to be many-valued. Gentzen sequent calculi are given for both versions, and soundness and completeness are established.

1.1 In standard modal logics, the worlds are 2-valued in the following sense: there are 2 values that a sentence may take at a world. Technically, however, there is no reason why this has to be the case. The worlds could be many-valued. This paper presents one simple approach to a major family of many-valued modal logics, together with an illustration of why this family is philosophically interesting.

Suppose there are several experts, with some dominating others (expert A dominates expert B if B says something is true whenever A says it is). Suppose, further, that each of the experts has his or her own view of what is possible — in other words each of the experts has their own Kripke model in mind (subject, of course, to the dominance relation that may hold between experts). How will they assign truth values to sentences in a common (...) class='Hi'>modal language, and on what sentences will they agree? This problem can be reformulated as one about many-valued Kripke models, allowing many-valued accessibility relations. This is a natural generalization of conventional Kripke models that has only recently been looked at. The equivalence between the many-valued version and the multiple expert one will be formally established. Finally we will axiomatize many-valued modal logics, and sketch a proof of completeness. (shrink)

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)

Originally published in 1967. An introduction to the literature of nonstandard logic, in particular to those nonstandard logics known as many-valued logics. Part I expounds and discusses implicational calculi, modal logics and many-valued logics and their associated calculi. Part II considers the detailed development of various many-valued calculi, and some of the important metathereoms which have been proved for them. Applications of the calculi to problems in the philosophy are (...) also surveyed. This work combines criticism with exposition to form a comprehensive but concise survey of the field. (shrink)

Originally published in 1967. An introduction to the literature of nonstandard logic, in particular to those nonstandard logics known as many-valued logics. Part I expounds and discusses implicational calculi, modal logics and many-valued logics and their associated calculi. Part II considers the detailed development of various many-valued calculi, and some of the important metathereoms which have been proved for them. Applications of the calculi to problems in the philosophy are (...) also surveyed. This work combines criticism with exposition to form a comprehensive but concise survey of the field. (shrink)

This paper deals with Kripke-style semantics for many-valued logics. We introduce various types of Kripke semantics, and we connect them with algebraic semantics. As for modal logics, we relate the axioms of logics extending MTL to properties of the Kripke frames in which they are valid. We show that in the propositional case most logics are complete but not strongly complete with respect to the corresponding class of complete Kripke frames, whereas in the (...) predicate case there are important many-valued logics like BL, Ł and Π, which are not even complete with respect to the class of all predicate Kripke frames in which they are valid. Thus although very natural, Kripke semantics seems to be slightly less powerful than algebraic semantics. (shrink)

The proceedings of an international colloquium held at Helsinki in 1962, containing twenty papers likely to further debate in the title areas. Contributors include Anderson, Geach, Hintikka, Lemmon, Marcus, Montague, Prior, Rescher and others.—N. S. C.

In this paper we consider the class of truth-functional modal many-valued logics with the complete lattice of truth-values. The conjunction and disjunction logic operators correspond to the meet and join operators of the lattices, while the negation is independently introduced as a hierarchy of antitonic operators which invert bottom and top elements. The non-constructive logic implication will be defined for a subclass of modular lattices, while the constructive implication for distributive lattices (Heyting algebras) is based on (...) relative pseudo-complements as in intuitionistic logic. We show that the complete lattices are intrinsically modal, with banal identity modal operator. We define the autoreferential set-based representation for the class of modal algebras, and show that the autoreferential Kripke-style semantics for this class of modal algebras is based on the set of possible worlds equal to the complete lattice of algebraic truth-values. The philosophical assumption is based on the consideration that each possible world represents a level of credibility, so that only propositions with the right logic value (i.e., level of credibility) can be accepted by this world, then we connect it with paraconsistent properties and LFI logics. The bottom truth value in this complete lattice corresponds to the trivial world in which each formula is satisfied, that is, to the world with explosive inconsistency. The top truth value corresponds to the world with classical logics, while all intermediate possible worlds represent the different levels of paraconsistent logics. (shrink)

In 1979, H. Lewis shows that the computational complexity of the Boolean satisfiability problem dichotomizes, depending on the Boolean operations available to formulate instances: intractable (NP-complete) if negation of implication is definable, and tractable (in P) otherwise [21]. Recently, an investigation in the same spirit has been extended to nonclassical propositional logics, modal logics in particular [2, 3]. In this note, we pursue this line in the realm of many-valued propositional logics, and obtain complexity (...) classifications for the parameterized satisfiability problem of two pertinent samples, Kleene and Gödel logics. (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.

A philosopher who has mastered the standard two-valued propositional calculus and who is curious to find out what the systems of many-valued logic, strict implication and modal logic are all about, should reach for this small booklet from the series Monographs in Modern Logic It explains in a compact but remarkably lucid way the rationale of these non-standard logics and gives access to the literature of the field. There are numerous references to a selected bibliography, (...) the most recent titles of which are from 1965. But the reader is not only informed about the technical properties of these systems, he is also given a sound perspective in which to see their intuitive significance. It is characteristic that the author distinguishes on the very first page between a logic and a calculus associated with a logic. (shrink)

We consider a modal language over crisp frames and formulas evaluated on a finite MTL-chain (a linearly ordered commutative integral residuated lattice). We first show that the basic modal abstract logic with constants for the values of the MTL-chain is the maximal abstract logic satisfying Compactness, the Tarski Union Property and strong invariance for bisimulations. Finally, we improve this result by replacing the Tarski Union Property by a relativization property.

The serious formal investigation of n-valued systems of logic for n>2 dates back to Post's 1921 doctoral dissertation. The primary use for such structures, however, has been as model-theoretic devices in the investigation of systems of lower order. Ackermann's short book now comes as a welcome addition to the literature dealing with the formal properties and applications of n-valued systems in their own right. Ackermann begins with a general discussion of implicational calculi in which fundamental ideas of validity, (...) well-formedness, and other basic notions are set forth elegantly and clearly. While assuming the classical implicational calculus as an underlying substructure, Ackermann next motivates a consideration of possible modifications of the formal system in the direction of greater generality by means of the standard Lewis objections to the reading of "⊃" as "implies." This leads to the well known story of strict entailment, introduction of modal operators, and then a four-valued matrix as an underlying semantics for the expanded system. There then follows a good general discussion of the properties of many-valued logics, various nonstandard propositional calculi, and an admirable presentation of the Lukasiewicz-Tarski propositional calculus, accompanied by a number of important metatheorems. Ackermann also includes chapters on alternative multivalued [[sic]] systems and a glance at their applications. One would like to see, however, some discussion of such controversial matters as n-valued quantificational theory and the well-known objections to the entire program of nonstandard logistic theory. There is a good bibliography of important books and articles in the field.—H. P. K. (shrink)

In this paper we provide frame definability results for weak versions of classical modal axioms that can be expressed in Fitting's many-valued modal languages. These languages were introduced by M. Fitting in the early '90s and are built on Heyting algebras which serve as the space of truth values. The possible-worlds frames interpreting these languages are directed graphs whose edges are labelled with an element of the underlying Heyting algebra, providing us a form of many- (...) class='Hi'>valued accessibility relation. Weak axioms of the form we treat here have been examined from the completeness perspective and further explored for applications in non-monotonic reasoning. Here, we introduce more weak many-valued modal axioms and prove a frame correspondence result for all of them. The classes of corresponding labelled frames possess algebraic properties which are strongly reminiscent of many classical ones, such as the Church-Rosser property, reflexivity, transitivity, partial functionality, etc. (shrink)

The papers in this special issue are based on presentations delivered at the conference Epistemic Aspects of Many-valued Logics, held at the Institute of Philosophy of the Academy of Sciences of the Czech Republic, in Prague, 2010. All papers consequently revolve around the application of non-classical logical tools—mathematical fuzzy logic and/or probability theory—to epistemological issues.Timothy Williamson employs a modal epistemic logic enriched with probabilities to generalize an argument against the KK-principle. He argues that we can know (...) a proposition even if our evidential probability for that proposition is low. In fact he argues that the evidential probability of a known proposition can be (arbitrarily) close to 0. The argument is first presented with a basic idealized model, which is then extended to much more complicated and realistic models. This then raises a problem for decision theory, since you can know that p, while your evidence tells you (strongly) that not p. Wil .. (shrink)

Łukasiewicz presented two different analyses of modal notions by means of many-valued logics: the linearly ordered systems Ł3,..., Open image in new window,..., \; the 4-valued logic Ł he defined in the last years of his career. Unfortunately, all these systems contain “Łukasiewicz type paradoxes”. On the other hand, Brady’s 4-valued logic BN4 is the basic 4-valued bilattice logic. The aim of this paper is to show that BN4 can be strengthened with (...) class='Hi'>modal operators following Łukasiewicz’s strategy for defining truth-functional modal logics. The systems we define lack “Łukasiewicz type paradoxes”. Following Brady, we endow them with Belnap–Dunn type bivalent semantics. (shrink)