Supervaluationism

Last updated

In philosophical logic, supervaluationism is a semantics for dealing with irreferential singular terms and vagueness. [1] It allows one to apply the tautologies of propositional logic in cases where truth values are undefined.

Contents

According to supervaluationism, a proposition can have a definite truth value even when its components do not. The proposition "Pegasus likes licorice", for example, is often interpreted as having no truth-value given the assumption that the name "Pegasus" fails to refer. If indeed reference fails for "Pegasus", then it seems as though there is nothing that can justify an assignment of a truth-value to any apparent assertion in which the term "Pegasus" occurs. The statement "Pegasus likes licorice or Pegasus doesn't like licorice", however, is an instance of the valid schema (" or not-"), so, according to supervaluationism, it should be true regardless of whether or not its disjuncts have a truth value; that is, it should be true in all interpretations. If, in general, something is true in all precisifications, supervaluationism describes it as "supertrue", while something false in all precisifications is described as "superfalse". [2]

Supervaluations were first formalized by Bas van Fraassen. [3]

Example abstraction

Let v be a classical valuation defined on every atomic sentence of the language L and let At(x) be the number of distinct atomic sentences in a formula x. There are then at most 2At(x) classical valuations defined on every sentence x. A supervaluation V is a function from sentences to truth values such that x is supertrue (i.e. V(x)=True) if and only if v(x)=True for every v. Likewise for superfalse.

V(x) is undefined when there are exactly two valuations v and v* such that v(x)=True and v*(x)=False. For example, let Lp be the formal translation of "Pegasus likes licorice". There are then exactly two classical valuations v and v* on Lp, namely v(Lp)=True and v*(Lp)=False. So Lp is neither supertrue nor superfalse.

See also

Related Research Articles

In philosophy and logic, the classical liar paradox or liar's paradox or antinomy of the liar is the statement of a liar that they are lying: for instance, declaring that "I am lying". If the liar is indeed lying, then the liar is telling the truth, which means the liar just lied. In "this sentence is a lie" the paradox is strengthened in order to make it amenable to more rigorous logical analysis. It is still generally called the "liar paradox" although abstraction is made precisely from the liar making the statement. Trying to assign to this statement, the strengthened liar, a classical binary truth value leads to a contradiction.

<span class="mw-page-title-main">Logical connective</span> Symbol connecting sentential formulas in logic

In logic, a logical connective is a logical constant. They can be used to connect logical formulas. For instance in the syntax of propositional logic, the binary connective can be used to join the two atomic formulas and , rendering the complex formula .

Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions and relations between propositions, including the construction of arguments based on them. Compound propositions are formed by connecting propositions by logical connectives. Propositions that contain no logical connectives are called atomic propositions.

In logic, the semantic principleof bivalence states that every declarative sentence expressing a proposition has exactly one truth value, either true or false. A logic satisfying this principle is called a two-valued logic or bivalent logic.

In linguistics and philosophy, a vague predicate is one which gives rise to borderline cases. For example, the English adjective "tall" is vague since it is not clearly true or false for someone of middling height. By contrast, the word "prime" is not vague since every number is definitively either prime or not. Vagueness is commonly diagnosed by a predicate's ability to give rise to the Sorites paradox. Vagueness is separate from ambiguity, in which an expression has multiple denotations. For instance the word "bank" is ambiguous since it can refer either to a river bank or to a financial institution, but there are no borderline cases between both interpretations.

<span class="mw-page-title-main">Saul Kripke</span> American philosopher and logician (1940–2022)

Saul Aaron Kripke was an American philosopher and logician in the analytic tradition. He was a Distinguished Professor of Philosophy at the Graduate Center of the City University of New York and emeritus professor at Princeton University. Since the 1960s, Kripke has been a central figure in a number of fields related to mathematical logic, modal logic, philosophy of language, philosophy of mathematics, metaphysics, epistemology, and recursion theory. Much of his work remains unpublished or exists only as tape recordings and privately circulated manuscripts.

In logic and mathematics, a truth value, sometimes called a logical value, is a value indicating the relation of a proposition to truth.

Intuitionistic logic, sometimes more generally called constructive logic, refers to systems of symbolic logic that differ from the systems used for classical logic by more closely mirroring the notion of constructive proof. In particular, systems of intuitionistic logic do not include the law of the excluded middle and double negation elimination, which are fundamental inference rules in classical logic.

Relevance logic, also called relevant logic, is a kind of non-classical logic requiring the antecedent and consequent of implications to be relevantly related. They may be viewed as a family of substructural or modal logics. It is generally, but not universally, called relevant logic by British and, especially, Australian logicians, and relevance logic by American logicians.

<span class="mw-page-title-main">Sorites paradox</span> Logical paradox from vague predicates

The sorites paradox is a paradox that results from vague predicates. A typical formulation involves a heap of sand, from which grains are removed individually. With the assumption that removing a single grain does not cause a heap to become a non-heap, the paradox is to consider what happens when the process is repeated enough times that only one grain remains: is it still a heap? If not, when did it change from a heap to a non-heap?

In logic, a three-valued logic is any of several many-valued logic systems in which there are three truth values indicating true, false and some indeterminate third value. This is contrasted with the more commonly known bivalent logics which provide only for true and false.

Understood in a narrow sense, philosophical logic is the area of philosophy that studies the application of logical methods to philosophical problems, often in the form of extended logical systems like modal logic. Some theorists conceive philosophical logic in a wider sense as the study of the scope and nature of logic in general. In this sense, philosophical logic can be seen as identical to the philosophy of logic, which includes additional topics like how to define logic or a discussion of the fundamental concepts of logic. The current article treats philosophical logic in the narrow sense, in which it forms one field of inquiry within the philosophy of logic.

Modal logic is a collection of formal systems developed to represent statements about necessity and possibility. It plays a major role in philosophy of language, epistemology, metaphysics, and natural language semantics. Modal logics extend other systems by adding unary operators and , representing possibility and necessity respectively. For instance the modal formula can be read as "possibly " while can be read as "necessarily ". Modal logics can be used to represent different phenomena depending on what kind of necessity and possibility is under consideration. When is used to represent epistemic necessity, states that is epistemically necessary, or in other words that it is known. When is used to represent deontic necessity, states that is a moral or legal obligation.

A paraconsistent logic is an attempt at a logical system to deal with contradictions in a discriminating way. Alternatively, paraconsistent logic is the subfield of logic that is concerned with studying and developing "inconsistency-tolerant" systems of logic which reject the principle of explosion.

Dialetheism is the view that there are statements that are both true and false. More precisely, it is the belief that there can be a true statement whose negation is also true. Such statements are called "true contradictions", dialetheia, or nondualisms.

<span class="mw-page-title-main">Material conditional</span> Logical connective

The material conditional is an operation commonly used in logic. When the conditional symbol is interpreted as material implication, a formula is true unless is true and is false. Material implication can also be characterized inferentially by modus ponens, modus tollens, conditional proof, and classical reductio ad absurdum.

In mathematical logic, a tautology is a formula or assertion that is true in every possible interpretation. An example is "x=y or x≠y". Similarly, "either the ball is green, or the ball is not green" is always true, regardless of the colour of the ball.

Logic is the formal science of using reason and is considered a branch of both philosophy and mathematics and to a lesser extent computer science. Logic investigates and classifies the structure of statements and arguments, both through the study of formal systems of inference and the study of arguments in natural language. The scope of logic can therefore be very large, ranging from core topics such as the study of fallacies and paradoxes, to specialized analyses of reasoning such as probability, correct reasoning, and arguments involving causality. One of the aims of logic is to identify the correct and incorrect inferences. Logicians study the criteria for the evaluation of arguments.

An interpretation is an assignment of meaning to the symbols of a formal language. Many formal languages used in mathematics, logic, and theoretical computer science are defined in solely syntactic terms, and as such do not have any meaning until they are given some interpretation. The general study of interpretations of formal languages is called formal semantics.

In logic, a finite-valued logic is a propositional calculus in which truth values are discrete. Traditionally, in Aristotle's logic, the bivalent logic, also known as binary logic was the norm, as the law of the excluded middle precluded more than two possible values for any proposition. Modern three-valued logic allows for an additional possible truth value.

References

  1. Shapiro, Stewart, "Vagueness and Conversation" in Beall, Edited (2003). Liars and Heaps. Oxford, England: Clarendon. ISBN   0-19-926481-3.{{cite book}}: |first= has generic name (help)
  2. "Supervaluation: Definition from Answers.com". Oxford Dictionary of Philosophy. Oxford University Press. 2005. Retrieved 2012-03-04.
  3. Free Logic (Stanford Encyclopedia of Philosophy)