Content deleted Content added
→Predicate logic: singulars |
removed stub template |
||
(21 intermediate revisions by 16 users not shown) | |||
Line 1:
{{short description|Variable 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
==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. ▼
▲== Uses ==
▲Formulas in logic are typically built up recursively from some propositional variables, some number of [[logical connective]]s, and some [[logical quantifier]]s.
;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]] ''¬X'' is a formula.
* Given two formulas ''X'' and ''Y'', and a [[binary connective]] ''b'' (such as the [[logical conjunction]] ∧),
== Predicate logic ==
Propositional variables
The internal structure of propositional variables contains [[predicate symbol|predicate letters]] such as P and Q, in association with [[bound variable|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>
==See also==▼
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|colwidth=22em}}
* [[Boolean algebra (logic)]]
* [[Boolean
* [[Boolean ___domain]]
* [[Boolean function]]
* [[Logical value]]
* [[Predicate variable]]
* [[Propositional logic]]
{{div col
== References ==
{{reflist}}
*Smullyan, Raymond M. ''First-Order Logic''. 1968. Dover edition, 1995. Chapter 1.1: Formulas of Propositional Logic.▼
== 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]]
|