Logical symbols
Reading logical symbolism frightens many people more than it should. The very term symbolic logic sounds terrifying, and the presence of even a small amount of symbolism may deter many readers from otherwise perfectly intelligible texts. The following explanation introduces the symbolism used in this work, and lists some of the variations that may be encountered in other works. It should be noticed that technical terms used are also explained under their own headwords, and cross-references have been given where appropriate.
Lower-case italic letters from this part of the alphabet: p, q, r …, are used as propositional variables. This means that they stand for propositions or statements. Some logicians dislike these categories, and prefer to call them sentence letters, or sentential variables. In either event, they occur where a sentence can be substituted, just as the x and y of algebra stand where an expression for a number can be substituted. A statement like ‘if someone believes that p and q then he believes that p ’ says that in any case in which someone believes a conjunction (such as ‘it is raining and it is windy’, then they believe its individual parts (that it is raining). Variations encountered include capitals (P, Q,…), or italic capitals P, Q,
Lower-case italic letters from the end of the alphabet: x, y, z …, are used as object variables. This means that they stand where reference to a person, or a thing, or a number might take place. Using such a variable, the example above could be phrased: ‘if x believes that p and q then x believes that p ’, where x stands for any person. This notation is virtually universal, although the typographical appearance of the variables varies.
As in common mathematical usage, lower case roman letters, especially n, k, j…, are used in a context to refer to specific numbers. From the beginning of the alphabet, a, b, c…, are also individual constants, or terms used in a context to refer to specific things or people. Fa means that some specific thing, a, is F, and is therefore a self-standing sentence, true or false as the case may be. F x by contrast is not, because nothing is picked out by the variable x.
Capital roman letters, F, G, R, stand for predicates and relational expressions. Particular instances of these are standard: for instance, identity (=), non-identity (?), greater than and less than (>, <), and other mathematical relations. The usual convention is for predicate letters to stand before the terms to which they apply. Fn means that n is F; Rab means that a bears the relation R to b. In some works this would be written aRb.
The most simple relations between propositions studied in logic are the truth-functions. These include:
Not. not-p is the negation of p. Classically, it is the proposition that is false when p is true, and vice versa. In this work it is written not- p where the context is informal, and ¬ p in more formal contexts. These mean exactly the same. Variations encountered include - p and Logical symbols p.
And. p and q is the conjunction of the two propositions. It is true if and only if they are both true. In this work it is written p & q. Variations encountered include p . q, and, more commonly, p ? q.
Or. p or q is the disjunction of the two propositions. It is true if and only if at least one of them is true. In this work it is written p ? q, and this is standard. Exclusive disjunction, meaning that one of p, q is true, but not both, is sometimes encountered, written pq.
Implication. Logic studies various kinds of implication. The most simple is called material implication. Here it is written pq. The most common variation is pq.
Equivalence. If pq and qp then p and q are said to be equivalent (they have the same truth value). Informally this is often expressed as p iff q. It is written p ? q. The most common alternative is p = q.
This is the basic set of truth-functions, in terms of which others are usually defined. In the predicate calculus the internal structure of propositions, as well as relations between them, is studied. The key notions are the two quantifiers:
The universal quantifier. In this work this is written ∀. (∀x ) F x means that everything is F. Variations that may be met include (A x ) F x and (x ) F x.
The existential quantifier. In this work this is written ∃. (∃x ) F x means that something is F. The principal variation that may be met is (E x ) F x.
In the predicate calculus numerical quantifiers can be defined, e.g. (∃n x ) (F x ') means that there are n x s such that F x. The principal variation is (∃!x )Fx, meaning that there is exactly one x such that x is F.
Terms may be defined from definite descriptions. The main examples encountered are (ɩx ) F x (the unique x such that x is F) and (µ x ) F x (the least x such that x is F).
Modal logic studies the notion of propositions being necessary or possible. The basic notation is:
Necessarily p. Written ⎕p. The main variation is Np.
Possibly p. Written ⋄p. The main variation is M p.
In metatheory, or the theory of logical systems, formulae and their relations become the topic. In this work capital roman A, B are variables for formulae, with A1 … An referring to a sequence of formulae. In other works, Greek in various forms (α, ß …) may be encountered. The principal relations that matter are:
There is a proof of B from A. This is standardly written A ⊦ B.
B is true in all interpretations in which A is true. This is standardly written A ⊧ B.
In traditional, or Aristotelian logic, there is not the same array of notions. Sentences are thought of as made up from terms, such as a subject and predicate, or the middle term of a syllogism. Capital roman letters (S, P, M) are used for these in this work. Set theory introduces a small new range of fundamental terms:
x: F x refers to the set of things, x, that meet a condition F. This is now standard. A set may also be referred to by listing its members (‘extensionally’): a, b, c is the set whose members are a, b, and c.
The set with no members, or null set, is written Ø. An older variation is Λ.
Sets themselves are denoted by capital roman S, T, etc. There are many typographical variations possible.
∈ denotes set-membership. xS means that x is a member of the set S.
xy : G y means that x is a member of the set of things that is G.
<…> refers to an ordered n-tuple.
The main notions used to construct sets include:
Intersection. S n R is the set of things that belong to both S and R. The notation is standard.
Union. S ? R is the set of things that belong either to S or to R. This too is standard.
Complement. s̄ is the set of things that do not belong to S.
Cartesian product. S × R is the set of ordered pairs whose first member belongs to S, and second belongs to R.
Relations between sets include:
Subset : S ⊆ R means that all members of S are members of R (notice that S ⊆ S).
Proper subset : S ⊂ R means that S is included in R (it is a subset, but not identical with R).
The main non-standard notation that may be encountered is Polish notation, which is explained in the body of the dictionary, as is substitutional quantification and its notation.

Philosophy dictionary. . 2011.

Look at other dictionaries:

  • Logical connective — This article is about connectives in classical logic. For connectors in natural languages, see discourse connective. For connectives and operators in other logics, see logical constant. For other logical symbols, see table of logic symbols. In… …   Wikipedia

  • logical constants — The expressions selected to indicate the logical form of a sentence. A sentence will play a proper role in inference in virtue of a structure that can be exhibited by means of these expressions. The basic logical constants include expressions for …   Philosophy dictionary

  • Logical positivism — (also known as logical empiricism, scientific philosophy, and neo positivism) is a philosophy that combines empiricism the idea that observational evidence is indispensable for knowledge with a version of rationalism incorporating mathematical… …   Wikipedia

  • Logical truth — is one of the most fundamental concepts in logic, and there are different theories on its nature. A logical truth is a statement which is true and remains true under all reinterpretations of its components other than its logical constants. It is… …   Wikipedia

  • Logical implication — In logic and mathematics, logical implication is a logical relation that holds between a set T of formulae and a formula B when every model (or interpretation or valuation) of T is also a model of B . In symbols,# T models B, # T Rightarrow B # T …   Wikipedia

  • Logical constant — In symbolic logic, a logical constant of a language L is a symbol that has the same semantic value in all models of (the expressions of) L . Two important types of logical constants are logical connectives and quantifiers. The equality predicate… …   Wikipedia

  • Logical equivalence — In logic, statements p and q are logically equivalent if they have the same logical content.Syntactically, p and q are equivalent if each can be proved from the other. Semantically, p and q are equivalent if they have the same truth value in… …   Wikipedia

  • Logical equality — For the corresponding concept in combinational logic, see XNOR gate. XNOR Logic Gate Symbol Logical equality is a logical operator that corresponds to equality in Boolean algebra and to the logical biconditional in propositional calculus. It… …   Wikipedia

  • logical form — The logical form of a sentence is the structure, shareable with other sentences, responsible for its powers in inferences. That is, its logical form determines the way in which it can be validly deduced from other sentences, and the way other… …   Philosophy dictionary

  • Non-logical symbol — In logic, the formal languages used to create expressions consist of symbols which can be broadly divided into constants and variables. The constants of a language can further be divided into logical symbols and non logical symbols (sometimes… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”