In
mathematical logic
Mathematical logic is the study of Logic#Formal logic, formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory (also known as computability theory). Research in mathematical logic com ...
, a propositional variable (also called a sentence letter,
sentential variable, or sentential letter) is an input
variable (that can either be true or false) of a
truth function
In logic, a truth function is a function that accepts truth values as input and produces a unique truth value as output. In other words: the input and output of a truth function are all truth values; a truth function will always output exactly ...
. Propositional variables are the basic building-blocks of
propositional formula
In propositional logic, a propositional formula is a type of syntactic formula which is well formed. If the values of all variables in a propositional formula are given, it determines a unique truth value. A propositional formula may also be call ...
s, used in
propositional logic
The propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. Sometimes, it is called ''first-order'' propositional logic to contra ...
and
higher-order logic
In mathematics and logic, a higher-order logic (abbreviated HOL) is a form of logic that is distinguished from first-order logic by additional quantifiers and, sometimes, stronger semantics. Higher-order logics with their standard semantics are m ...
s.
Uses
Formulas in logic are typically built up recursively from some propositional variables, some number of
logical connective
In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant. Connectives can be used to connect logical formulas. For instance in the syntax of propositional logic, the ...
s, and some
logical quantifier
In logic, a quantifier is an operator that specifies how many individuals in the domain of discourse satisfy an open formula. For instance, the universal quantifier \forall in the first-order formula \forall x P(x) expresses that everything ...
s. Propositional variables are the
atomic formula
In mathematical logic, an atomic formula (also known as an atom or a prime formula) is a formula with no deeper propositional structure, that is, a formula that contains no logical connectives or equivalently a formula that has no strict subformu ...
s of propositional logic, and are often denoted using capital
roman letters
The Latin script, also known as the Roman script, is a writing system based on the letters of the classical Latin alphabet, derived from a form of the Greek alphabet which was in use in the ancient Greek city of Cumae in Magna Graecia. The Gree ...
such as
,
and
.
;Example
In a given propositional logic, a formula can be defined as follows:
* Every propositional variable is a formula.
* Given a formula ''X'', the
negation
In logic, negation, also called the logical not or logical complement, is an operation (mathematics), operation that takes a Proposition (mathematics), proposition P to another proposition "not P", written \neg P, \mathord P, P^\prime or \over ...
''¬X'' is a formula.
* Given two formulas ''X'' and ''Y'', and a
binary connective
In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant. Connectives can be used to connect logical formulas. For instance in the syntax of propositional logic, the ...
''b'' (such as the
logical conjunction
In logic, mathematics and linguistics, ''and'' (\wedge) is the Truth function, truth-functional operator of conjunction or logical conjunction. The logical connective of this operator is typically represented as \wedge or \& or K (prefix) or ...
∧), the expression ''(X b Y)'' is a formula. (Note the parentheses.)
Through this construction, all of the formulas of propositional logic can be built up from propositional variables as a basic unit. Propositional variables should not be confused with the
metavariable
In logic, a metavariable (also metalinguistic variable or syntactical variable) is a symbol or symbol string which belongs to a metalanguage and stands for elements of some object language. For instance, in the sentence
:''Let A and B be two sent ...
s, which appear in the typical axioms of
propositional calculus
The propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. Sometimes, it is called ''first-order'' propositional logic to contra ...
; the latter effectively range over well-formed formulae, and are often denoted using lower-case greek letters such as
,
and
.
Predicate logic
Propositional variables with no object variables such as ''x'' and ''y'' attached to predicate letters such as P''x'' and ''x''R''y'', having instead individual constants ''a'', ''b'', ..attached to predicate letters are propositional constants P''a'', ''a''R''b''. These propositional constants are atomic propositions, not containing propositional operators.
The internal structure of propositional variables contains
predicate letters such as P and Q, in association with
bound individual variables (e.g., x, ''y''), individual constants such as ''a'' and ''b'' (
singular term A singular term is a paradigmatic referring device in a language. Singular terms are defined as expressions that purport to denote or designate particular individual people, places, or other objects. They contrast with ''general terms'' (such as "ca ...
s from a
domain of discourse
In the formal sciences, the domain of discourse or universe of discourse (borrowing from the mathematical concept of ''universe'') is the set of entities over which certain variables of interest in some formal treatment may range.
It is also ...
D), ultimately taking a form such as P''a'', ''a''R''b''.(or with parenthesis,
and
).
Propositional logic is sometimes called
zeroth-order logic
The propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. Sometimes, it is called ''first-order'' propositional logic to contra ...
due to not considering the internal structure in contrast with
first-order logic
First-order logic, also called predicate logic, predicate calculus, or quantificational logic, is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over ...
which analyzes the internal structure of the atomic sentences.
See also
*
Boolean algebra (logic)
In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variable (mathematics), variables are the truth values ''true'' and ''false'', usually denot ...
*
Boolean data type
In computer science, the Boolean (sometimes shortened to Bool) is a data type that has one of two possible values (usually denoted ''true'' and ''false'') which is intended to represent the two truth values of logic and Boolean algebra. It is na ...
*
Boolean domain
In mathematics and abstract algebra, a Boolean domain is a set consisting of exactly two elements whose interpretations include ''false'' and ''true''. In logic, mathematics and theoretical computer science, a Boolean domain is usually written ...
*
Boolean function
In mathematics, a Boolean function is a function whose arguments and result assume values from a two-element set (usually , or ). Alternative names are switching function, used especially in older computer science literature, and truth functi ...
*
Logical value
In logic and mathematics, a truth value, sometimes called a logical value, is a value indicating the relation of a proposition to truth, which in classical logic has only two possible values ('' true'' or '' false''). Truth values are used in c ...
*
Predicate variable
In mathematical logic, a predicate variable is a predicate letter which functions as a "placeholder" for a relation (between terms), but which has not been specifically assigned any particular relation (or meaning). Common symbols for denoting pre ...
*
Propositional logic
The propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. Sometimes, it is called ''first-order'' propositional logic to contra ...
References
Bibliography
* Smullyan, Raymond M. ''First-Order Logic''. 1968. Dover edition, 1995. Chapter 1.1: Formulas of Propositional Logic.
Propositional calculus
Concepts in logic
Logic symbols
{{logic-stub