Propositional variable: Difference between revisions

Revision as of 00:18, 13 June 2021

Latest revision as of 13:26, 10 July 2025

(13 intermediate revisions by 11 users not shown)

Line 1:

{{short description|A variableVariable that can either be true or false.}}

In [[mathematical logic]], a '''propositional variable''' (also called a '''sentence letter,<ref name=":13">{{Cite book |last=Howson |first=Colin |author-link=Colin Howson |title=Logic with trees: an introduction to symbolic logic |date=1997 |publisher=Routledge |isbn=978-0-415-13342-5 |___location=London; New York |pages=5}}</ref>''' '''sentential variable,''' or '''sentential letter''') is aan input [[variable (mathematics)|variable]] (that can either be '''true''' or '''false''') of a [[truth function]]. Propositional variables are the basic building-blocks of [[propositional formula]]s, used in [[propositional logic]] and [[Higherhigher-order logic|higher-order logics]]s.

== Uses ==

Formulas in logic are typically built up recursively from some propositional variables, some number of [[logical connective]]s, and some [[logical quantifier]]s. Propositional variables are the [[atomic formula]]s of propositional logic, and are often denoted using capital [[Latin script|roman letters]] such as <math>P</math>, <math>Q</math> and <math>R</math>.<ref name=":0">{{Cite web|date=2020-04-06|title=Comprehensive List of Logic Symbols|url=https://mathvault.ca/hub/higher-math/math-symbols/logic-symbols/|access-date=2020-08-20|website=Math Vault|language=en-US}}</ref><ref>{{Cite web|title=Predicate Logic {{!}} Brilliant Math & Science Wiki|url=https://brilliant.org/wiki/predicate-logic/|access-date=2020-08-20|website=brilliant.org|language=en-us}}</ref>

;Example

Line 10:

* Every propositional variable is a formula.

* Given a formula ''X'', the [[negation]] ''¬X'' is a formula.

* Given two formulas ''X'' and ''Y'', and a [[binary connective]] ''b'' (such as the [[logical conjunction]] ∧), 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]]s, which appear in the [[Propositional_logic#Example_1._Simple_axiom_system|typical axioms of [[propositional calculus]]; the latter effectively range over well-formed formulae, and are often denoted using lower-case greek letters such as <math>\alpha</math>, <math>\beta</math> and <math>\gamma</math>.<ref name=":0" />

== 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 symbol|predicate letters]] such as P and Q, in association with [[freebound variable|free or bound]] individual variables (e.g., x, ''y''), individual constants such as ''a'' and ''b'' ([[singular term]]s from a [[___domain of discourse]] D), ultimately taking a form such as P''a'', ''a''R''b''.(or with parenthesis, <math>P(11)</math> and <math>R(1, 3)</math>).<ref>{{Cite web|date=2015-06-24|title=Mathematics {{!}} Predicates and Quantifiers {{!}} Set 1|url=https://www.geeksforgeeks.org/mathematic-logic-predicates-quantifiers/|access-date=2020-08-20|website=GeeksforGeeks|language=en-US}}</ref>

Propositional logic is sometimes called [[zeroth-order logic]] due to not considering the internal structure in contrast with [[first-order logic]] which analyzes the internal structure of the atomic sentences.

== See also ==

{{div col-begin|colwidth=22em}}

{{col-break}}

* [[Boolean algebra (logic)]]

* [[Boolean datatypedata type]]

* [[Boolean ___domain]]

* [[Boolean function]]

{{col-break}}

* [[Logical value]]

* [[Predicate variable]]

* [[Propositional logic]]

{{div col- end}}

== References ==

Line 40 ⟶ 37:

== Bibliography ==

* Smullyan, Raymond M. ''First-Order Logic''. 1968. Dover edition, 1995. Chapter 1.1: Formulas of Propositional Logic.

{{Mathematical logic}}

[[Category:Propositional calculus]]

[[Category:Concepts in logic]]

[[Category:Logic symbols]]

{{logic-stub}}