Many-Valued Logics

In Gillian Russell & Delia Graff Fara (eds.), The Routledge Companion to Philosophy of Language. Routledge. pp. 636--51 (2012)
  Copy   BIBTEX

Abstract

A many-valued (aka multiple- or multi-valued) semantics, in the strict sense, is one which employs more than two truth values; in the loose sense it is one which countenances more than two truth statuses. So if, for example, we say that there are only two truth values—True and False—but allow that as well as possessing the value True and possessing the value False, propositions may also have a third truth status—possessing neither truth value—then we have a many-valued semantics in the loose but not the strict sense. A many-valued logic is one which arises from a many-valued semantics and does not also arise from any two-valued semantics [Malinowski, 1993, 30]. By a ‘logic’ here we mean either a set of tautologies, or a consequence relation. We can best explain these ideas by considering the case of classical propositional logic. The language contains the usual basic symbols (propositional constants p, q, r, . . .; connectives ¬, ∧, ∨, →, ↔; and parentheses) and well-formed formulas are defined in the standard way. With the language thus specified—as a set of well-formed formulas—its semantics is then given in three parts. (i) A model of a logical language consists in a free assignment of semantic values to basic items of the non-logical vocabulary. Here the basic items of the non-logical vocabulary are the propositional constants. The appropriate kind of semantic value for a proposition is a truth value, and so a model of the language consists in a free assignment of truth values to basic propositions. Two truth values are countenanced: 1 (representing truth) and 0 (representing falsity). (ii) Rules are presented which determine a truth value for every proposition of the language, given a model. The most common way of presenting these rules is via truth tables (Figure 1). Another way of stating such rules—which will be useful below—is first to introduce functions on the truth values themselves: a unary function ¬ and four binary functions ∧, ∨, → and ↔ (Figure 2)..

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Higher-Order Multi-Valued Resolution.Michael Kohlhase - 1999 - Journal of Applied Non-Classical Logics 9 (4):455-477.
Many-valued and Kripke semantics.Jean-Yves Béziau - 2006 - In Johan van Benthem, Gerhard Heinzman, M. Rebushi & H. Visser (eds.), The Age of Alternative Logics. Springer. pp. 89--101.
Partiality and its dual.J. Michael Dunn - 2000 - Studia Logica 66 (1):5-40.

Analytics

Added to PP
2010-02-18

Downloads
94 (#178,869)

6 months
5 (#652,053)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Nicholas J. J. Smith
University of Sydney

References found in this work

Outline of a theory of truth.Saul Kripke - 1975 - Journal of Philosophy 72 (19):690-716.
An Introduction to Non-Classical Logic: From If to Is.Graham Priest - 2008 - New York: Cambridge University Press.
Singular terms, truth-value gaps, and free logic.Bas C. van Fraassen - 1966 - Journal of Philosophy 63 (17):481-495.
Many-valued logic.Nicholas Rescher - 1969 - New York,: McGraw-Hill.
The logic of inexact concepts.J. A. Goguen - 1969 - Synthese 19 (3-4):325-373.

View all 11 references / Add more references