# Propositional Calculus

A propositional calculus is a formal system, where:

• The alpha set is a finite set of elements called proposition symbols or propositional variables. Syntactically speaking, these are the most basic elements of the formal language, otherwise referred to as atomic formulæ or terminal elements. In the examples to follow, the elements of are typically the letters, and so on.
• The omega set is a finite set of elements called operator symbols or logical connectives. The set is partitioned into disjoint subsets as follows:
In this partition, is the set of operator symbols of arity .
In the more familiar propositional calculi, is typically partitioned as follows:
A frequently adopted convention treats the constant logical values as operators of arity zero, thus:
Some writers use the tilde (~), or N, instead of ; and some use the ampersand (&), the prefixed K, or instead of . Notation varies even more for the set of logical values, with symbols like {false, true}, {F, T}, or all being seen in various contexts instead of {0, 1}.
• The zeta set is a finite set of transformation rules that are called inference rules when they acquire logical applications.
• The iota set is a finite set of initial points that are called axioms when they receive logical interpretations.

The language of, also known as its set of formulæ, well-formed formulas or wffs, is inductively defined by the following rules:

1. Base: Any element of the alpha set is a formula of .
2. If are formulæ and is in, then is a formula.
3. Closed: Nothing else is a formula of .

Repeated applications of these rules permits the construction of complex formulæ. For example:

1. By rule 1, is a formula.
2. By rule 2, is a formula.
3. By rule 1, is a formula.
4. By rule 2, is a formula.

### Other articles related to "propositional calculus, propositional":

Boolean Algebra (structure) - Examples
... Starting with the propositional calculus with κ sentence symbols, form the Lindenbaum algebra (that is, the set of sentences in the propositional calculus modulo tautology) ... A truth assignment in propositional calculus is then a Boolean algebra homomorphism from this algebra to the two-element Boolean algebra ...
Propositional Calculus - Solvers
... Finding solutions to propositional logic formulas is an NP-complete problem ... However, practical methods exist (e.g ...
Implicational Propositional Calculus
... In mathematical logic, the implicational propositional calculus is a version of classical propositional calculus which uses only one connective, called implication or conditional ...
Boolean Algebra (logic) - Propositional Logic - Applications
... One motivating application of propositional calculus is the analysis of propositions and deductive arguments in natural language ... Propositional calculus restricts attention to abstract propositions, those built up from propositional variables using Boolean operations ... Instantiation is still possible within propositional calculus, but only by instantiating propositional variables by abstract propositions, such as instantiating Q by Q→P in P→(Q→P ...
Scott Information System - Examples - Propositional Calculus
... The propositional calculus gives us a very simple Scott information system as follows. ...

### Famous quotes containing the word calculus:

I try to make a rough music, a dance of the mind, a calculus of the emotions, a driving beat of praise out of the pain and mystery that surround me and become me. My poems are meant to make your mind get up and shout.
Judith Johnson Sherwin (b. 1936)