GetWiki
propositional calculus
ARTICLE SUBJECTS
being →
database →
ethics →
fiction →
history →
internet →
language →
linux →
logic →
method →
news →
policy →
purpose →
religion →
science →
software →
truth →
unix →
wiki →
ARTICLE TYPES
essay →
feed →
help →
system →
wiki →
ARTICLE ORIGINS
critical →
forked →
imported →
original →
propositional calculus
please note:
- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
{{Distinguish|Propositional analysis}}{{Use dmy dates|date=May 2012}}{{Transformation rules}}Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions (which can be true or false) and argument flow. Compound propositions are formed by connecting propositions by logical connectives. The propositions without logical connectives are called atomic propositions. Unlike first-order logic, propositional logic does not deal with non-logical objects, predicates about them, or quantifiers. However, all the machinery of propositional logic is included in first-order logic and higher-order logics. In this sense, propositional logic is the foundation of first-order logic and higher-order logic.- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
Explanation
Logical connectives are found in natural languages. In English for example, some examples are "and" (conjunction), "or" (disjunction), "notâ€ (negation) and "if" (but only when used to denote material conditional).The following is an example of a very simple inference within the scope of propositional logic:
Premise 1: If it's raining then it's cloudy.
Premise 2: It's raining.
Conclusion: It's cloudy.
Both premises and the conclusion are propositions. The premises are taken for granted and then with the application of modus ponens (an inference rule) the conclusion follows.As propositional logic is not concerned with the structure of propositions beyond the point where they can't be decomposed any more by logical connectives, this inference can be restated replacing those atomic statements with statement letters, which are interpreted as variables representing statements:
Premise 1: P to Q
Premise 2: P
Conclusion: Q
The same can be stated succinctly in the following way:
P to Q, P vdash Q
When {{mvar|P}} is interpreted as â€œIt's rainingâ€ and {{mvar|Q}} as â€œit's cloudyâ€ the above symbolic expressions can be seen to exactly correspond with the original expression in natural language. Not only that, but they will also correspond with any other inference of this form, which will be valid on the same basis that this inference is.Propositional logic may be studied through a formal system in which formulas of a formal language may be interpreted to represent propositions. A system of inference rules and axioms allows certain formulas to be derived. These derived formulas are called theorems and may be interpreted to be true propositions. A constructed sequence of such formulas is known as a derivation or proof and the last formula of the sequence is the theorem. The derivation may be interpreted as proof of the proposition represented by the theorem.When a formal system is used to represent formal logic, only statement letters are represented directly. The natural language propositions that arise when they're interpreted are outside the scope of the system, and the relation between the formal system and its interpretation is likewise outside the formal system itself.Usually in truth-functional propositional logic, formulas are interpreted as having either a truth value of true or a truth value of false.{{clarify|reason=The difference between 'propositional calculus' in general and 'truth-functional propositional logic' in particular should be made more clear. While in the former, a (derived) formula 'may be interpreted to be a true proposition', in the latter it may be 'interpreted as having ... a truth value of true' - isn't that the same?|date=October 2013}} Truth-functional propositional logic and systems isomorphic to it, are considered to be zeroth-order logic.History
Although propositional logic (which is interchangeable with propositional calculus) had been hinted by earlier philosophers, it was developed into a formal logic (Stoic logic) by Chrysippus in the 3rd century BCBOOK,weblink The Stanford Encyclopedia of Philosophy, Susanne, Bobzien, Edward N., Zalta, 1 January 2016, Stanford Encyclopedia of Philosophy, and expanded by his successor Stoics. The logic was focused on propositions. This advancement was different from the traditional syllogistic logic which was focused on terms. However, later in antiquity, the propositional logic developed by the Stoics was no longer understood {{Who|date=October 2014}}. Consequently, the system was essentially reinvented by Peter Abelard in the 12th century.BOOK, Medieval philosophy: an historical and philosophical introduction, Marenbon, John, 2007, Routledge, 137, Propositional logic was eventually refined using symbolic logic. The 17th/18th-century mathematician Gottfried Leibniz has been credited with being the founder of symbolic logic for his work with the calculus ratiocinator. Although his work was the first of its kind, it was unknown to the larger logical community. Consequently, many of the advances achieved by Leibniz were recreated by logicians like George Boole and Augustus De Morgan completely independent of Leibniz.BOOK,weblink The Stanford Encyclopedia of Philosophy, Volker, Peckhaus, Edward N., Zalta, 1 January 2014, Stanford Encyclopedia of Philosophy, Just as propositional logic can be considered an advancement from the earlier syllogistic logic, Gottlob Frege's predicate logic was an advancement from the earlier propositional logic. One author describes predicate logic as combining "the distinctive features of syllogistic logic and propositional logic."BOOK, A Concise Introduction to Logic 10th edition, Hurley, Patrick, 2007, Wadsworth Publishing, 392, Consequently, predicate logic ushered in a new era in logic's history; however, advances in propositional logic were still made after Frege, including Natural Deduction, Truth-Trees and Truth-Tables. Natural deduction was invented by Gerhard Gentzen and Jan Åukasiewicz. Truth-Trees were invented by Evert Willem Beth.Beth, Evert W.; "Semantic entailment and formal derivability", series: Mededlingen van de Koninklijke Nederlandse Akademie van Wetenschappen, Afdeling Letterkunde, Nieuwe Reeks, vol. 18, no. 13, Noord-Hollandsche Uitg. Mij., Amsterdam, 1955, pp. 309â€“42. Reprinted in Jaakko Intikka (ed.) The Philosophy of Mathematics, Oxford University Press, 1969 The invention of truth-tables, however, is of uncertain attribution.Within works by Fregeweblink" title="web.archive.org/web/20120807235445weblink">Truth in Frege and Bertrand Russell,WEB,weblink Russell: the Journal of Bertrand Russell Studies, are ideas influential to the invention of truth tables. The actual tabular structure (being formatted as a table), itself, is generally credited to either Ludwig Wittgenstein or Emil Post (or both, independently). Besides Frege and Russell, others credited with having ideas preceding truth-tables include Philo, Boole, Charles Sanders PeirceJOURNAL, Anellis, Irving H., Peirce's Truth-functional Analysis and the Origin of the Truth Table, History and Philosophy of Logic, 2012, 33, 87â€“97, 10.1080/01445340.2011.621702, , and Ernst SchrÃ¶der. Others credited with the tabular structure include Jan Åukasiewicz, Ernst SchrÃ¶der, Alfred North Whitehead, William Stanley Jevons, John Venn, and Clarence Irving Lewis. Ultimately, some have concluded, like John Shosky, that "It is far from clear that any one person should be given the title of 'inventor' of truth-tables.".Terminology
In general terms, a calculus is a formal system that consists of a set of syntactic expressions (well-formed formulas), a distinguished subset of these expressions (axioms), plus a set of formal rules that define a specific binary relation, intended to be interpreted as logical equivalence, on the space of expressions.When the formal system is intended to be a logical system, the expressions are meant to be interpreted as statements, and the rules, known to be inference rules, are typically intended to be truth-preserving. In this setting, the rules (which may include axioms) can then be used to derive ("infer") formulas representing true statements from given formulas representing true statements.The set of axioms may be empty, a nonempty finite set, a countably infinite set, or be given by axiom schemata. A formal grammar recursively defines the expressions and well-formed formulas of the language. In addition a semantics may be given which defines truth and valuations (or interpretations).The language of a propositional calculus consists of- a set of primitive symbols, variously referred to as atomic formulas, placeholders, proposition letters, or variables, and
- a set of operator symbols, variously interpreted as logical operators or logical connectives.
Basic concepts
The following outlines a standard propositional calculus. Many different formulations exist which are all more or less equivalent but differ in the details of:- their language, that is, the particular collection of primitive symbols and operator symbols,
- the set of axioms, or distinguished formulas, and
- the set of inference rules.
- We then define truth-functional operators, beginning with negation. {{math|Â¬P}} represents the negation of {{mvar|P}}, which can be thought of as the denial of {{mvar|P}}. In the example above, {{math|Â¬P}} expresses that it is not raining outside, or by a more standard reading: "It is not the case that it is raining outside." When {{mvar|P}} is true, {{math|Â¬P}} is false; and when {{mvar|P}} is false, {{math|Â¬P}} is true. {{math|Â¬Â¬P}} always has the same truth-value as {{mvar|P}}.
- Conjunction is a truth-functional connective which forms a proposition out of two simpler propositions, for example, {{mvar|P}} and {{mvar|Q}}. The conjunction of {{mvar|P}} and {{mvar|Q}} is written {{math|P âˆ§ Q}}, and expresses that each are true. We read {{math|P âˆ§ Q}} for "{{mvar|P}} and {{mvar|Q}}". For any two propositions, there are four possible assignments of truth values:
- {{mvar|P}} is true and {{mvar|Q}} is true
- {{mvar|P}} is true and {{mvar|Q}} is false
- {{mvar|P}} is false and {{mvar|Q}} is true
- {{mvar|P}} is false and {{mvar|Q}} is false
The conjunction of {{mvar|P}} and {{mvar|Q}} is true in case 1 and is false otherwise. Where {{mvar|P}} is the proposition that it is raining outside and {{mvar|Q}} is the proposition that a cold-front is over Kansas, {{math|P âˆ§ Q}} is true when it is raining outside and there is a cold-front over Kansas. If it is not raining outside, then {{mvar|P âˆ§ Q}} is false; and if there is no cold-front over Kansas, then {{math|P âˆ§ Q}} is false.
- Disjunction resembles conjunction in that it forms a proposition out of two simpler propositions. We write it {{math|P âˆ¨ Q}}, and it is read "{{mvar|P}} or {{mvar|Q}}". It expresses that either {{mvar|P}} or {{mvar|Q}} is true. Thus, in the cases listed above, the disjunction of {{mvar|P}} with {{mvar|Q}} is true in all cases except case 4. Using the example above, the disjunction expresses that it is either raining outside or there is a cold front over Kansas. (Note, this use of disjunction is supposed to resemble the use of the English word "or". However, it is most like the English inclusive "or", which can be used to express the truth of at least one of two propositions. It is not like the English exclusive "or", which expresses the truth of exactly one of two propositions. That is to say, the exclusive "or" is false when both {{mvar|P}} and {{mvar|Q}} are true (case 1). An example of the exclusive or is: You may have a bagel or a pastry, but not both. Often in natural language, given the appropriate context, the addendum "but not both" is omitted but implied. In mathematics, however, "or" is always inclusive or; if exclusive or is meant it will be specified, possibly by "xor".)
- Material conditional also joins two simpler propositions, and we write {{math|P â†’ Q}}, which is read "if {{mvar|P}} then {{mvar|Q}}". The proposition to the left of the arrow is called the antecedent and the proposition to the right is called the consequent. (There is no such designation for conjunction or disjunction, since they are commutative operations.) It expresses that {{mvar|Q}} is true whenever {{mvar|P}} is true. Thus it is true in every case above except case 2, because this is the only case when {{mvar|P}} is true but {{mvar|Q}} is not. Using the example, if {{mvar|P}} then {{mvar|Q}} expresses that if it is raining outside then there is a cold-front over Kansas. The material conditional is often confused with physical causation. The material conditional, however, only relates two propositions by their truth-valuesâ€”which is not the relation of cause and effect. It is contentious in the literature whether the material implication represents logical causation.
- Biconditional joins two simpler propositions, and we write {{math|P â†” Q}}, which is read "{{mvar|P}} if and only if {{mvar|Q}}". It expresses that {{mvar|P}} and {{mvar|Q}} have the same truth-value, and so, in cases 1 and 4, {{mvar|P}} is true if and only if {{mvar|Q}} is true, and false otherwise.
Closure under operations
Propositional logic is closed under truth-functional connectives. That is to say, for any proposition {{mvar|Ï†}}, {{math|Â¬Ï†}} is also a proposition. Likewise, for any propositions {{mvar|Ï†}} and {{mvar|Ïˆ}}, {{math|Ï† âˆ§ Ïˆ}} is a proposition, and similarly for disjunction, conditional, and biconditional. This implies that, for instance, {{math|Ï† âˆ§ Ïˆ}} is a proposition, and so it can be conjoined with another proposition. In order to represent this, we need to use parentheses to indicate which proposition is conjoined with which. For instance, {{math|P âˆ§ Q âˆ§ R}} is not a well-formed formula, because we do not know if we are conjoining {{math|P âˆ§ Q}} with {{mvar|R}} or if we are conjoining {{mvar|P}} with {{math|Q âˆ§ R}}. Thus we must write either {{math|(P âˆ§ Q) âˆ§ R}} to represent the former, or {{math|P âˆ§ (Q âˆ§ R)}} to represent the latter. By evaluating the truth conditions, we see that both expressions have the same truth conditions (will be true in the same cases), and moreover that any proposition formed by arbitrary conjunctions will have the same truth conditions, regardless of the location of the parentheses. This means that conjunction is associative, however, one should not assume that parentheses never serve a purpose. For instance, the sentence {{math|P âˆ§ (Q âˆ¨ R)}} does not have the same truth conditions of {{math|(P âˆ§ Q) âˆ¨ R}}, so they are different sentences distinguished only by the parentheses. One can verify this by the truth-table method referenced above.Note: For any arbitrary number of propositional constants, we can form a finite number of cases which list their possible truth-values. A simple way to generate this is by truth-tables, in which one writes {{mvar|P}}, {{mvar|Q}}, ..., {{mvar|Z}}, for any list of {{mvar|k}} propositional constantsâ€”that is to say, any list of propositional constants with {{mvar|k}} entries. Below this list, one writes {{math|2k}} rows, and below {{mvar|P}} one fills in the first half of the rows with true (or T) and the second half with false (or F). Below {{mvar|Q}} one fills in one-quarter of the rows with T, then one-quarter with F, then one-quarter with T and the last quarter with F. The next column alternates between true and false for each eighth of the rows, then sixteenths, and so on, until the last propositional constant varies between T and F for each row. This will give a complete listing of cases or truth-value assignments possible for those propositional constants.Argument
The propositional calculus then defines an argument to be a list of propositions. A valid argument is a list of propositions, the last of which follows fromâ€”or is implied byâ€”the rest. All other arguments are invalid. The simplest valid argument is modus ponens, one instance of which is the following list of propositions:Generic description of a propositional calculus
A propositional calculus is a formal system mathcal{L} = mathcal{L} left( Alpha, Omega, Zeta, Iota right), where:- The alpha set Alpha is a countably infinite set of elements called proposition symbols or propositional variables. Syntactically speaking, these are the most basic elements of the formal language mathcal{L}, otherwise referred to as atomic formulas or terminal elements. In the examples to follow, the elements of Alpha are typically the letters {{mvar|p}}, {{mvar|q}}, {{mvar|r}}, and so on.
- The omega set {{math|Î©}} is a finite set of elements called operator symbols or logical connectives. The set {{math|Î©}} is partitioned into disjoint subsets as follows:
Omega = Omega_0 cup Omega_1 cup ldots cup Omega_j cup ldots cup Omega_m.
In this partition, Omega_j is the set of operator symbols of arity {{mvar|j}}.
In the more familiar propositional calculi, {{math|Î©}} is typically partitioned as follows:
Omega_1 = { lnot },
Omega_2 subseteq { land, lor, to, leftrightarrow }.
A frequently adopted convention treats the constant logical values as operators of arity zero, thus:
Omega_0 = { 0, 1 }.
Some writers use the tilde (~), or N, instead of {{math|Â¬}}; and some use the ampersand (&), the prefixed K, or cdot instead of wedge. Notation varies even more for the set of logical values, with symbols like {false, true}, {F, T}, or { bot, top } all being seen in various contexts instead of {0, 1}.
- The zeta set Zeta is a finite set of transformation rules that are called inference rules when they acquire logical applications.
- The iota set Iota is a countable set of initial points that are called axioms when they receive logical interpretations.
- Base: Any element of the alpha set Alpha is a formula of mathcal{L}.
- If p_1, p_2, ldots, p_j are formulas and f is in Omega_j, then left( f(p_1, p_2, ldots, p_j) right) is a formula.
- Closed: Nothing else is a formula of mathcal{L}.
- By rule 1, {{mvar|p}} is a formula.
- By rule 2, neg p is a formula.
- By rule 1, {{mvar|q}} is a formula.
- By rule 2, ( neg p lor q ) is a formula.
Example 1. Simple axiom system
Let mathcal{L}_1 = mathcal{L}(Alpha,Omega,Zeta,Iota), where Alpha, Omega, Zeta, Iota are defined as follows:- The alpha set Alpha, is a countably infinite set of symbols, for example:
Alpha = {p, q, r, s, t, u, p_2, ldots }.
- Of the three connectives for conjunction, disjunction, and implication (wedge, lor, and {{math|â†’}}), one can be taken as primitive and the other two can be defined in terms of it and negation ({{math|Â¬}}).Wernick, William (1942) "Complete Sets of Logical Functions," Transactions of the American Mathematical Society 51, pp. 117–132. Indeed, all of the logical connectives can be defined in terms of a sole sufficient operator. The biconditional ({{math|â†”}}) can of course be defined in terms of conjunction and implication, with a leftrightarrow b defined as (a to b) land (b to a).
Adopting negation and implication as the two primitive operations of a propositional calculus is tantamount to having the omega set Omega = Omega_1 cup Omega_2 partition as follows:
Omega_1 = { lnot },
Omega_2 = { to }.
- An axiom system discovered by Jan Åukasiewicz formulates a propositional calculus in this language as follows. The axioms are all substitution instances of:
* (p to (q to p))
* ((p to (q to r)) to ((p to q) to (p to r)))
* ((neg p to neg q) to (q to p))
- The rule of inference is modus ponens (i.e., from {{mvar|p}} and (p to q), infer {{mvar|q}}). Then a lor b is defined as neg a to b, and a land b is defined as neg(a to neg b). This system is used in Metamath set.mm formal proof database.
Example 2. Natural deduction system
Let mathcal{L}_2 = mathcal{L}(Alpha, Omega, Zeta, Iota), where Alpha, Omega, Zeta, Iota are defined as follows:- The alpha set Alpha, is a countably infinite set of symbols, for example:
- : Alpha = {p, q, r, s, t, u, p_2, ldots }.
- The omega set Omega = Omega_1 cup Omega_2 partitions as follows:
- : Omega_1 = { lnot },
- : Omega_2 = { land, lor, to, leftrightarrow }.
- The set of initial points is empty, that is, Iota = varnothing.
- The set of transformation rules, Zeta, is described as follows:
- Negation introduction: From (p to q) and (p to neg q), infer neg p.
- That is, { (p to q), (p to neg q) } vdash neg p.
- Negation elimination: From neg p, infer (p to r).
- That is, { neg p } vdash (p to r).
- Double negative elimination: From neg neg p, infer {{mvar|p}}.
- That is, neg neg p vdash p.
- Conjunction introduction: From {{mvar|p}} and {{mvar|q}}, infer (p land q).
- That is, { p, q } vdash (p land q).
- Conjunction elimination: From (p land q), infer {{mvar|p}}.
- From (p land q), infer {{mvar|q}}.
- That is, (p land q) vdash p and (p land q) vdash q.
- Disjunction introduction: From {{mvar|p}}, infer (p lor q).
- From {{mvar|q}}, infer (p lor q).
- That is, p vdash (p lor q) and q vdash (p lor q).
- Disjunction elimination: From (p lor q) and (p to r) and (q to r), infer {{mvar|r}}.
- That is, {p lor q, p to r, q to r} vdash r.
- Biconditional introduction: From (p to q) and (q to p), infer (p leftrightarrow q).
- That is, {p to q, q to p} vdash (p leftrightarrow q).
- Biconditional elimination: From (p leftrightarrow q), infer (p to q).
- From (p leftrightarrow q), infer (q to p).
- That is, (p leftrightarrow q) vdash (p to q) and (p leftrightarrow q) vdash (q to p).
- Modus ponens (conditional elimination) : From {{mvar|p}} and (p to q), infer {{mvar|q}}.
- That is, { p, p to q} vdash q.
- Conditional proof (conditional introduction) : From [accepting {{mvar|p}} allows a proof of {{mvar|q}}], infer (p to q).
- That is, (p vdash q) vdash (p to q).
Basic and derived argument forms
{| style="margin:auto;" class="wikitable"|+ Basic and Derived Argument Formsp}} then {{mvar | p}}; therefore {{mvar|q}} |
p}} then {{mvar | q}}; therefore not {{mvar|p}} |
p}} then {{mvar | q}} then {{mvar | p}} then {{mvar|r}} |
Disjunctive syllogism>Disjunctive Syllogism| ((p lor q) land neg p) vdash q | p}} or {{mvar | p}}; therefore, {{mvar|q}} |
Constructive dilemma>Constructive Dilemma| ((p to q) land (r to s) land (p lor r)) vdash (q lor s) | p}} then {{mvar | r}} then {{mvar | p}} or {{mvar | q}} or {{mvar|s}} |
Destructive dilemma>Destructive Dilemma| ((p to q) land (r to s) land(neg q lor neg s)) vdash (neg p lor neg r) | p}} then {{mvar | r}} then {{mvar | q}} or not {{mvar | p}} or not {{mvar|r}} |
p}} then {{mvar | r}} then {{mvar | p}} or not {{mvar | q}} or not {{mvar|r}} |
Conjunction elimination>Simplification| (p land q) vdash p | p}} and {{mvar | p}} is true |
Logical conjunction>Conjunction| p, q vdash (p land q) | p}} and {{mvar|q}} are true separately; therefore they are true conjointly |
Logical disjunction>Addition| p vdash (p lor q) | p}} is true; therefore the disjunction ({{mvar | q}}) is true |
Distributive property>Composition| ((p to q) land (p to r)) vdash (p to (q land r)) | p}} then {{mvar | p}} then {{mvar | p}} is true then {{mvar | r}} are true |
De Morgan's laws>De Morgan's Theorem (1)| neg (p land q) vdash (neg p lor neg q) | p}} and {{mvar | p}} or not {{mvar|q}}) |
De Morgan's laws>De Morgan's Theorem (2)| neg (p lor q) vdash (neg p land neg q) | p}} or {{mvar | p}} and not {{mvar|q}}) |
Commutative property>Commutation (1)| (p lor q) vdash (q lor p) | p}} or {{mvar | q}} or {{mvar|p}}) |
Commutative property>Commutation (2)| (p land q) vdash (q land p) | p}} and {{mvar | q}} and {{mvar|p}}) |
Commutative property>Commutation (3)| (p leftrightarrow q) vdash (q leftrightarrow p) | p}} is equiv. to {{mvar | q}} is equiv. to {{mvar|p}}) |
Associative property>Association (1)| (p lor (q lor r)) vdash ((p lor q) lor r) | p}} or ({{mvar | r}}) is equiv. to ({{mvar | q}}) or {{mvar|r}} |
Associative property>Association (2)| (p land (q land r)) vdash ((p land q) land r) | p}} and ({{mvar | r}}) is equiv. to ({{mvar | q}}) and {{mvar|r}} |
Distributive property>Distribution (1)| (p land (q lor r)) vdash ((p land q) lor (p land r)) | p}} and ({{mvar | r}}) is equiv. to ({{mvar | q}}) or ({{mvar | r}}) |
Distributive property>Distribution (2)| (p lor (q land r)) vdash ((p lor q) land (p lor r)) | p}} or ({{mvar | r}}) is equiv. to ({{mvar | q}}) and ({{mvar | r}}) |
Double negative elimination>Double Negation| p vdash neg neg p | p}} is equivalent to the negation of not {{mvar|p}} |
Transposition (logic)>Transposition| (p to q) vdash (neg q to neg p) | p}} then {{mvar | q}} then not {{mvar|p}} |
Material implication (rule of inference)>Material Implication| (p to q) vdash (neg p lor q) | p}} then {{mvar | p}} or {{mvar|q}} |
Material equivalence>Material Equivalence (1)| (p leftrightarrow q) vdash ((p to q) land (q to p)) | p}} iff {{mvar | p}} is true then {{mvar | q}} is true then {{mvar|p}} is true) |
Material equivalence>Material Equivalence (2)| (p leftrightarrow q) vdash ((p land q) lor (neg p land neg q)) | p}} iff {{mvar | p}} and {{mvar | p}} and {{mvar|q}} are false) |
Material equivalence>Material Equivalence (3)| (p leftrightarrow q) vdash ((p lor neg q) land (neg p lor q)) | p}} iff {{mvar | p}} or not {{mvar | p}} or {{mvar|q}} is true) |
Exportation (logic)>ExportationHTTP://WWW.CS.ODU.EDU/~TOIDA/NERZIC/CONTENT/LOGIC/PROP_LOGIC/IMPLICATIONS/IMPLICATION_PROOF.HTML > TITLE = PROOF OF IMPLICATIONS | DATE = 2 AUGUST 2009 | FIRST = SHUNICHI | PUBLISHER = DEPARTMENT OF COMPUTER SCIENCE, OLD DOMINION UNIVERSITY, | ((p land q) to r) vdash (p to (q to r)) | p}} and {{mvar | r}} is true) we can prove (if {{mvar | r}} is true, if {{mvar|p}} is true) |
Exportation (logic)>Importation| (p to (q to r)) vdash ((p land q) to r) | p}} then (if {{mvar | r}}) is equivalent to if {{mvar | q}} then {{mvar|r}} |
Tautology (rule of inference)>Tautology (1)| p vdash (p lor p) | p}} is true is equiv. to {{mvar | p}} is true |
Tautology (rule of inference)>Tautology (2)| p vdash (p land p) | p}} is true is equiv. to {{mvar | p}} is true |
Law of excluded middle>Tertium non datur (Law of Excluded Middle)| vdash (p lor neg p) | p}} or not {{mvar|p}} is true |
Law of noncontradiction>Law of Non-Contradiction| vdash neg (p land neg p) | p}} and not {{mvar|p}} is false, is a true statement |
Proofs in propositional calculus
One of the main uses of a propositional calculus, when interpreted for logical applications, is to determine relations of logical equivalence between propositional formulas. These relationships are determined by means of the available transformation rules, sequences of which are called derivations or proofs.In the discussion to follow, a proof is presented as a sequence of numbered lines, with each line consisting of a single formula followed by a reason or justification for introducing that formula. Each premise of the argument, that is, an assumption introduced as an hypothesis of the argument, is listed at the beginning of the sequence and is marked as a "premise" in lieu of other justification. The conclusion is listed on the last line. A proof is complete if every line follows from the previous ones by the correct application of a transformation rule. (For a contrasting approach, see proof-trees).Example of a proof
- To be shown that {{math|A â†’ A}}.
- One possible proof of this (which, though valid, happens to contain more steps than are necessary) may be arranged as follows:
1}} | A | premise |
2}} | A lor A | From ({{EquationNote|1}}) by disjunction introduction |
3}} | (A lor A) land A | From ({{EquationNote | 2}}) by conjunction introduction |
4}} | A | From ({{EquationNote|3}}) by conjunction elimination |
5}} | A vdash A | Summary of ({{EquationNote | 4}}) |
6}} | vdash A to A | From ({{EquationNote|5}}) by conditional proof |
Soundness and completeness of the rules
The crucial properties of this set of rules are that they are sound and complete. Informally this means that the rules are correct and that no other rules are required. These claims can be made more formal as follows.We define a truth assignment as a function that maps propositional variables to true or false. Informally such a truth assignment can be understood as the description of a possible state of affairs (or possible world) where certain statements are true and others are not. The semantics of formulas can then be formalized by defining for which "state of affairs" they are considered to be true, which is what is done by the following definition.We define when such a truth assignment {{mvar|A}} satisfies a certain well-formed formula with the following rules:- {{mvar|A}} satisfies the propositional variable {{mvar|P}} if and only if {{math|A(P) {{=}} true}}
- {{mvar|A}} satisfies {{math|Â¬Ï†}} if and only if {{mvar|A}} does not satisfy {{mvar|Ï†}}
- {{mvar|A}} satisfies {{math|(Ï† âˆ§ Ïˆ)}} if and only if {{mvar|A}} satisfies both {{mvar|Ï†}} and {{mvar|Ïˆ}}
- {{mvar|A}} satisfies {{math|(Ï† âˆ¨ Ïˆ)}} if and only if {{mvar|A}} satisfies at least one of either {{mvar|Ï†}} or {{mvar|Ïˆ}}
- {{mvar|A}} satisfies {{math|(Ï† â†’ Ïˆ)}} if and only if it is not the case that {{mvar|A}} satisfies {{mvar|Ï†}} but not {{mvar|Ïˆ}}
- {{mvar|A}} satisfies {{math|(Ï† â†” Ïˆ)}} if and only if {{mvar|A}} satisfies both {{mvar|Ï†}} and {{mvar|Ïˆ}} or satisfies neither one of them
Sketch of a soundness proof
(For most logical systems, this is the comparatively "simple" direction of proof)Notational conventions: Let {{mvar|G}} be a variable ranging over sets of sentences. Let {{mvar|A, B}} and {{mvar|C}} range over sentences. For "{{mvar|G}} syntactically entails {{mvar|A}}" we write "{{mvar|G}} proves {{mvar|A}}". For "{{mvar|G}} semantically entails {{mvar|A}}" we write "{{mvar|G}} implies {{mvar|A}}".We want to show: {{math|(A)(G)}} (if {{mvar|G}} proves {{mvar|A}}, then {{mvar|G}} implies {{mvar|A}}).We note that "{{mvar|G}} proves {{mvar|A}}" has an inductive definition, and that gives us the immediate resources for demonstrating claims of the form "If {{mvar|G}} proves {{mvar|A}}, then ...". So our proof proceeds by induction.{{ordered list|list-style-type=upper-romanA}} is a member of {{mvarG}} implies {{mvar|A}}. A}} is an axiom, then {{mvarA}}. n}}, the length of the proof):{hide}ordered list|list-style-type=lower-alpha
| Assume for arbitrary {{mvar|G{edih} and {{mvar|A}} that if {{mvar|G}} proves {{mvar|A}} in {{mvar|n}} or fewer steps, then {{mvar|G}} implies {{mvar|A}}.
| For each possible application of a rule of inference at step {{math|n + 1}}, leading to a new theorem {{mvar|B}}, show that {{mvar|G}} implies {{mvar|B}}.
}}
}}Notice that Basis Step II can be omitted for natural deduction systems because they have no axioms. When used, Step II involves showing that each of the axioms is a (semantic) logical truth.The Basis steps demonstrate that the simplest provable sentences from {{mvar|G}} are also implied by {{mvar|G}}, for any {{mvar|G}}. (The proof is simple, since the semantic fact that a set implies any of its members, is also trivial.) The Inductive step will systematically cover all the further sentences that might be provableâ€”by considering each case where we might reach a logical conclusion using an inference ruleâ€”and shows that if a new sentence is provable, it is also logically implied. (For example, we might have a rule telling us that from "{{mvar|A}}" we can derive "{{mvar|A}} or {{mvar|B}}". In III.a We assume that if {{mvar|A}} is provable it is implied. We also know that if {{mvar|A}} is provable then "{{mvar|A}} or {{mvar|B}}" is provable. We have to show that then "{{mvar|A}} or {{mvar|B}}" too is implied. We do so by appeal to the semantic definition and the assumption we just made. {{mvar|A}} is provable from {{mvar|G}}, we assume. So it is also implied by {{mvar|G}}. So any semantic valuation making all of {{mvar|G}} true makes {{mvar|A}} true. But any valuation making {{mvar|A}} true makes "{{mvar|A}} or {{mvar|B}}" true, by the defined semantics for "or". So any valuation which makes all of {{mvar|G}} true makes "{{mvar|A}} or {{mvar|B}}" true. So "{{mvar|A}} or {{mvar|B}}" is implied.) Generally, the Inductive step will consist of a lengthy but simple case-by-case analysis of all the rules of inference, showing that each "preserves" semantic implication.By the definition of provability, there are no sentences provable other than by being a member of {{mvar|G}}, an axiom, or following by a rule; so if all of those are semantically implied, the deduction calculus is sound.| For each possible application of a rule of inference at step {{math|n + 1}}, leading to a new theorem {{mvar|B}}, show that {{mvar|G}} implies {{mvar|B}}.
}}
Sketch of completeness proof
(This is usually the much harder direction of proof.)We adopt the same notational conventions as above.We want to show: If {{mvar|G}} implies {{mvar|A}}, then {{mvar|G}} proves {{mvar|A}}. We proceed by contraposition: We show instead that if {{mvar|G}} does not prove {{mvar|A}} then {{mvar|G}} does not imply {{mvar|A}}. If we show that there is a model where {{mvar|A}} does not hold despite {{mvar|G}} being true, then obviously {{mvar|G}} does not imply {{mvar|A}}. The idea is to build such a model out of our very assumption that {{mvar|G}} does not prove {{mvar|A}}.{{ordered list|list-style-type=upper-romanG}} does not prove {{mvar|A}}. (Assumption) G}} does not prove {{mvarMaximal Set, {{math>Gâˆ—}}, which is a superset of {{mvarA}}.
{{ordered list|list-style-type=lower-latin
|1= Place an ordering (with order type ω) on all the sentences in the language (e.g., shortest first, and equally long ones in extended alphabetical ordering), and number them {{math|(E1, E2, ...)}}
|2= Define a series {{mvar|Gn}} of sets {{math|(G0, G1, ...)}} inductively:
{{ordered list|list-style-type=lower-roman
|1= G_0 = G
|2= If G_k cup { E_{k+1} } proves {{mvar|A}}, then G_{k+1} = G_k
|3= If G_k cup { E_{k+1} } does not prove {{mvar|A}}, then G_{k+1} = G_k cup { E_{k+1} }
}}
|3= Define {{math|Gâˆ—}} as the union of all the {{mvar|Gn}}. (That is, {{math|Gâˆ—}} is the set of all the sentences that are in any {{mvar|Gn}}.)
|4= It can be easily shown that
{{ordered list|list-style-type=lower-roman
|1= {{math|Gâˆ—}} contains (is a superset of) {{mvar|G}} (by (b.i));
|2= {{math|Gâˆ—}} does not prove {{mvar|A}} (because the proof would contain only finitely many sentences and when the last of them is introduced in some {{mvar|Gn}}, that {{mvar|Gn}} would prove {{mvar|A}} contrary to the definition of {{mvar|Gn}}); and
|3= {{math|Gâˆ—}} is a Maximal Set with respect to {{mvar|A}}: If any more sentences whatever were added to {{math|Gâˆ—}}, it would prove {{mvar|A}}. (Because if it were possible to add any more sentences, they should have been added when they were encountered during the construction of the {{mvar|Gn}}, again by definition)
}}
}}
Gâˆ—}} is a Maximal Set with respect to {{mvartruth-like. This means that it contains {{mvar>C}} only if it does not contain {{mvarC}} and contains "If {{mvarB}}" then it also contains {{mvar|B}}; and so forth. Gâˆ—}} is truth-like there is a {{mathGâˆ—}}-Canonical valuation of the language: one that makes every sentence in {{math>Gâˆ—}} true and everything outside {{math|Gâˆ—}} false while still obeying the laws of semantic composition in the language. Gâˆ—}}-canonical valuation will make our original set {{mvarA}} false. G}} are true and {{mvarG}} does not (semantically) imply {{mvar|A}}. }}QED|1= Place an ordering (with order type ω) on all the sentences in the language (e.g., shortest first, and equally long ones in extended alphabetical ordering), and number them {{math|(E1, E2, ...)}}
|2= Define a series {{mvar|Gn}} of sets {{math|(G0, G1, ...)}} inductively:
{{ordered list|list-style-type=lower-roman
|1= G_0 = G
|2= If G_k cup { E_{k+1} } proves {{mvar|A}}, then G_{k+1} = G_k
|3= If G_k cup { E_{k+1} } does not prove {{mvar|A}}, then G_{k+1} = G_k cup { E_{k+1} }
}}
|3= Define {{math|Gâˆ—}} as the union of all the {{mvar|Gn}}. (That is, {{math|Gâˆ—}} is the set of all the sentences that are in any {{mvar|Gn}}.)
|4= It can be easily shown that
{{ordered list|list-style-type=lower-roman
|1= {{math|Gâˆ—}} contains (is a superset of) {{mvar|G}} (by (b.i));
|2= {{math|Gâˆ—}} does not prove {{mvar|A}} (because the proof would contain only finitely many sentences and when the last of them is introduced in some {{mvar|Gn}}, that {{mvar|Gn}} would prove {{mvar|A}} contrary to the definition of {{mvar|Gn}}); and
|3= {{math|Gâˆ—}} is a Maximal Set with respect to {{mvar|A}}: If any more sentences whatever were added to {{math|Gâˆ—}}, it would prove {{mvar|A}}. (Because if it were possible to add any more sentences, they should have been added when they were encountered during the construction of the {{mvar|Gn}}, again by definition)
}}
}}
Another outline for a completeness proof
If a formula is a tautology, then there is a truth table for it which shows that each valuation yields the value true for the formula. Consider such a valuation. By mathematical induction on the length of the subformulas, show that the truth or falsity of the subformula follows from the truth or falsity (as appropriate for the valuation) of each propositional variable in the subformula. Then combine the lines of the truth table together two at a time by using "({{mvar|P}} is true implies {{mvar|S}}) implies (({{mvar|P}} is false implies {{mvar|S}}) implies {{mvar|S}})". Keep repeating this until all dependencies on propositional variables have been eliminated. The result is that we have proved the given tautology. Since every tautology is provable, the logic is complete.Interpretation of a truth-functional propositional calculus
An interpretation of a truth-functional propositional calculus mathcal{P} is an assignment to each propositional symbol of mathcal{P} of one or the other (but not both) of the truth values truth (T) and falsity (F), and an assignment to the connective symbols of mathcal{P} of their usual truth-functional meanings. An interpretation of a truth-functional propositional calculus may also be expressed in terms of truth tables.BOOK, Hunter, Geoffrey, Metalogic: An Introduction to the Metatheory of Standard First-Order Logic, University of California Pres, 1971, 0-520-02356-0, For n distinct propositional symbols there are 2^n distinct possible interpretations. For any particular symbol a, for example, there are 2^1=2 possible interpretations:- a is assigned T, or
- a is assigned F.
- both are assigned T,
- both are assigned F,
- a is assigned T and b is assigned F, or
- a is assigned F and b is assigned T.
Interpretation of a sentence of truth-functional propositional logic
If {{mvar|Ï†}} and {{mvar|Ïˆ}} are formulas of mathcal{P} and mathcal{I} is an interpretation of mathcal{P} then:- A sentence of propositional logic is true under an interpretation mathcal{I} iff mathcal{I} assigns the truth value T to that sentence. If a sentence is true under an interpretation, then that interpretation is called a model of that sentence.
- {{mvar|Ï†}} is false under an interpretation mathcal{I} iff {{mvar|Ï†}} is not true under mathcal{I}.
- A sentence of propositional logic is logically valid if it is true under every interpretation
modelsphi means that {{mvar|Ï†}} is logically valid
- A sentence {{mvar|Ïˆ}} of propositional logic is a semantic consequence of a sentence {{mvar|Ï†}} iff there is no interpretation under which {{mvar|Ï†}} is true and {{mvar|Ïˆ}} is false.
- A sentence of propositional logic is consistent iff it is true under at least one interpretation. It is inconsistent if it is not consistent.
- For any given interpretation a given formula is either true or false.
- No formula is both true and false under the same interpretation.
- {{mvar|Ï†}} is false for a given interpretation iff negphi is true for that interpretation; and {{mvar|Ï†}} is true under an interpretation iff negphi is false under that interpretation.
- If {{mvar|Ï†}} and (phi to psi) are both true under a given interpretation, then {{mvar|Ïˆ}} is true under that interpretation.
- If models_{mathrm P}phi and models_{mathrm P}(phi to psi), then models_{mathrm P}psi.
- negphi is true under mathcal{I} iff {{mvar|Ï†}} is not true under mathcal{I}.
- (phi to psi) is true under mathcal{I} iff either {{mvar|Ï†}} is not true under mathcal{I} or {{mvar|Ïˆ}} is true under mathcal{I}.
- A sentence {{mvar|Ïˆ}} of propositional logic is a semantic consequence of a sentence {{mvar|Ï†}} iff (phi to psi) is logically valid, that is, phi models_{mathrm P} psi iff models_{mathrm P}(phi to psi).
Alternative calculus
It is possible to define another version of propositional calculus, which defines most of the syntax of the logical operators by means of axioms, and which uses only one inference rule.Axioms
Let {{mvar|Ï†}}, {{mvar|Ï‡}}, and {{mvar|Ïˆ}} stand for well-formed formulas. (The well-formed formulas themselves would not contain any Greek letters, but only capital Roman letters, connective operators, and parentheses.) Then the axioms are as follows:{| style="margin:auto;" class="wikitable"|+ AxiomsTHEN-1}}| phi to (chi to phi) | Ï‡}}, implication introduction |
THEN-2}}| (phi to (chi to psi)) to ((phi to chi) to (phi to psi)) | Ï†}} over implication |
AND-1}}| phi land chi to phi| Eliminate conjunction |
AND-2}}| phi land chi to chi| |
AND-3}}| phi to (chi to (phi land chi))| Introduce conjunction |
OR-1}}| phi to phi lor chi| Introduce disjunction |
OR-2}}| chi to phi lor chi| |
OR-3}}| (phi to psi) to ((chi to psi) to (phi lor chi to psi))| Eliminate disjunction |
NOT-1}}| (phi to chi) to ((phi to neg chi) to neg phi)| Introduce negation |
NOT-2}}| phi to (neg phi to chi)| Eliminate negation |
NOT-3}}| phi lor neg phi| Excluded middle, classical logic |
IFF-1}}| (phi leftrightarrow chi) to (phi to chi)| Eliminate equivalence |
IFF-2}}| (phi leftrightarrow chi) to (chi to phi)| |
IFF-3}}| (phi to chi) to ((chi to phi) to (phi leftrightarrow chi))| Introduce equivalence |
- Axiom {{EquationNote|THEN-2}} may be considered to be a "distributive property of implication with respect to implication."
- Axioms {{EquationNote|AND-1}} and {{EquationNote|AND-2}} correspond to "conjunction elimination". The relation between {{EquationNote|AND-1}} and {{EquationNote|AND-2}} reflects the commutativity of the conjunction operator.
- Axiom {{EquationNote|AND-3}} corresponds to "conjunction introduction."
- Axioms {{EquationNote|OR-1}} and {{EquationNote|OR-2}} correspond to "disjunction introduction." The relation between {{EquationNote|OR-1}} and {{EquationNote|OR-2}} reflects the commutativity of the disjunction operator.
- Axiom {{EquationNote|NOT-1}} corresponds to "reductio ad absurdum."
- Axiom {{EquationNote|NOT-2}} says that "anything can be deduced from a contradiction."
- Axiom {{EquationNote|NOT-3}} is called "tertium non datur" (Latin: "a third is not given") and reflects the semantic valuation of propositional formulas: a formula can have a truth-value of either true or false. There is no third truth-value, at least not in classical logic. Intuitionistic logicians do not accept the axiom {{EquationNote|NOT-3}}.
Inference rule
The inference rule is modus ponens:
phi, phi to chi vdash chi .
Meta-inference rule
Let a demonstration be represented by a sequence, with hypotheses to the left of the turnstile and the conclusion to the right of the turnstile. Then the deduction theorem can be stated as follows:
If the sequence
This deduction theorem (DT) is not itself formulated with propositional calculus: it is not a theorem of propositional calculus, but a theorem about propositional calculus. In this sense, it is a meta-theorem, comparable to theorems about the soundness or completeness of propositional calculus.On the other hand, DT is so useful for simplifying the syntactical proof process that it can be considered and used as another inference rule, accompanying modus ponens. In this sense, DT corresponds to the natural conditional proof inference rule which is part of the first version of propositional calculus introduced in this article.The converse of DT is also valid:
phi_1, phi_2, ... , phi_n, chi vdash psi
has been demonstrated, then it is also possible to demonstrate the sequence
phi_1, phi_2, ..., phi_n vdash chi to psi .
If the sequence
in fact, the validity of the converse of DT is almost trivial compared to that of DT:
phi_1, phi_2, ..., phi_n vdash chi to psi
has been demonstrated, then it is also possible to demonstrate the sequence
phi_1, phi_2, ... , phi_n, chi vdash psi
If
The converse of DT has powerful implications: it can be used to convert an axiom into an inference rule. For example, the axiom AND-1,
phi_1, ... , phi_n vdash chi to psi
then
1: phi_1, ... , phi_n, chi vdash chi to psi
2: phi_1, ... , phi_n, chi vdash chi
and from (1) and (2) can be deduced
3: phi_1, ... , phi_n, chi vdash psi
by means of modus ponens, Q.E.D.
vdash phi wedge chi to phi
can be transformed by means of the converse of the deduction theorem into the inference rule
phi wedge chi vdash phi
which is conjunction elimination, one of the ten inference rules used in the first version (in this article) of the propositional calculus.Example of a proof
The following is an example of a (syntactical) demonstration, involving only axioms {{EquationNote|THEN-1}} and {{EquationNote|THEN-2}}:Prove: A to A (Reflexivity of implication).Proof:- (A to ((B to A) to A)) to ((A to (B to A)) to (A to A))
- : Axiom {{EquationNote|THEN-2}} with phi = A, chi = B to A, psi = A
- A to ((B to A) to A)
- : Axiom {{EquationNote|THEN-1}} with phi = A, chi = B to A
- (A to (B to A)) to (A to A)
- : From (1) and (2) by modus ponens.
- A to (B to A)
- : Axiom {{EquationNote|THEN-1}} with phi = A, chi = B
- A to A
- : From (3) and (4) by modus ponens.
Equivalence to equational logics
The preceding alternative calculus is an example of a Hilbert-style deduction system. In the case of propositional systems the axioms are terms built with logical connectives and the only inference rule is modus ponens. Equational logic as standardly used informally in high school algebra is a different kind of calculus from Hilbert systems. Its theorems are equations and its inference rules express the properties of equality, namely that it is a congruence on terms that admits substitution.Classical propositional calculus as described above is equivalent to Boolean algebra, while intuitionistic propositional calculus is equivalent to Heyting algebra. The equivalence is shown by translation in each direction of the theorems of the respective systems. Theorems phi of classical or intuitionistic propositional calculus are translated as equations phi = 1 of Boolean or Heyting algebra respectively. Conversely theorems x = y of Boolean or Heyting algebra are translated as theorems (x to y) land (y to x) of classical or intuitionistic calculus respectively, for which x equiv y is a standard abbreviation. In the case of Boolean algebra x = y can also be translated as (x land y) lor (neg x land neg y), but this translation is incorrect intuitionistically.In both Boolean and Heyting algebra, inequality x le y can be used in place of equality. The equality x = y is expressible as a pair of inequalities x le y and y le x. Conversely the inequality x le y is expressible as the equality x land y = x, or as x lor y = y. The significance of inequality for Hilbert-style systems is that it corresponds to the latter's deduction or entailment symbol vdash. An entailment
phi_1, phi_2, dots, phi_n vdash psi
phi_1 land phi_2 land dots land phi_n le psi
x vdash y.
Graphical calculi
{{Unreferenced section|date=March 2011}}It is possible to generalize the definition of a formal language from a set of finite sequences over a finite basis to include many other sets of mathematical structures, so long as they are built up by finitary means from finite materials. What's more, many of these families of formal structures are especially well-suited for use in logic.For example, there are many families of graphs that are close enough analogues of formal languages that the concept of a calculus is quite easily and naturally extended to them. Indeed, many species of graphs arise as parse graphs in the syntactic analysis of the corresponding families of text structures. The exigencies of practical computation on formal languages frequently demand that text strings be converted into pointer structure renditions of parse graphs, simply as a matter of checking whether strings are well-formed formulas or not. Once this is done, there are many advantages to be gained from developing the graphical analogue of the calculus on strings. The mapping from strings to parse graphs is called parsing and the inverse mapping from parse graphs to strings is achieved by an operation that is called traversing the graph.Other logical calculi
Propositional calculus is about the simplest kind of logical calculus in current use. It can be extended in several ways. (Aristotelian "syllogistic" calculus, which is largely supplanted in modern logic, is in some ways simpler â€“ but in other ways more complex â€“ than propositional calculus.) The most immediate way to develop a more complex logical calculus is to introduce rules that are sensitive to more fine-grained details of the sentences being used.First-order logic (a.k.a. first-order predicate logic) results when the "atomic sentences" of propositional logic are broken up into terms, variables, predicates, and quantifiers, all keeping the rules of propositional logic with some new ones introduced. (For example, from "All dogs are mammals" we may infer "If Rover is a dog then Rover is a mammal".) With the tools of first-order logic it is possible to formulate a number of theories, either with explicit axioms or by rules of inference, that can themselves be treated as logical calculi. Arithmetic is the best known of these; others include set theory and mereology. Second-order logic and other higher-order logics are formal extensions of first-order logic. Thus, it makes sense to refer to propositional logic as "zeroth-order logic", when comparing it with these logics.Modal logic also offers a variety of inferences that cannot be captured in propositional calculus. For example, from "Necessarily {{mvar|p}}" we may infer that {{mvar|p}}. From {{mvar|p}} we may infer "It is possible that {{mvar|p}}". The translation between modal logics and algebraic logics concerns classical and intuitionistic logics but with the introduction of a unary operator on Boolean or Heyting algebras, different from the Boolean operations, interpreting the possibility modality, and in the case of Heyting algebra a second operator interpreting necessity (for Boolean algebra this is redundant since necessity is the De Morgan dual of possibility). The first operator preserves 0 and disjunction while the second preserves 1 and conjunction.Many-valued logics are those allowing sentences to have values other than true and false. (For example, neither and both are standard "extra values"; "continuum logic" allows each sentence to have any of an infinite number of "degrees of truth" between true and false.) These logics often require calculational devices quite distinct from propositional calculus. When the values form a Boolean algebra (which may have more than two or even infinitely many values), many-valued logic reduces to classical logic; many-valued logics are therefore only of independent interest when the values form an algebra that is not Boolean.Solvers
Finding solutions to propositional logic formulas is an NP-complete problem. However, practical methods exist (e.g., DPLL algorithm, 1962; Chaff algorithm, 2001) that are very fast for many useful cases. Recent work has extended the SAT solver algorithms to work with propositions containing arithmetic expressions; these are the SMT solvers.See also
Higher logical levels
Related topics
{{col-begin}}{{col-break}}- Boolean algebra (logic)
- Boolean algebra (structure)
- Boolean algebra topics
- Boolean domain
- Boolean function
- Boolean-valued function
- Categorical logic
- Combinational logic
- Combinatory logic
- Conceptual graph
- Disjunctive syllogism
- Entitative graph
- Equational logic
- Existential graph
- Frege's propositional calculus
- Implicational propositional calculus
- Intuitionistic propositional calculus
- Jean Buridan
- Laws of Form
- Logical graph
- Logical NOR
- Logical value
- Operation
- Paul of Venice
- Peirce's law
- Peter of Spain
- Propositional formula
- Symmetric difference
- Truth function
- Truth table
- Walter Burley
- William of Sherwood
References
{{Reflist|30em}}Further reading
- Brown, Frank Markham (2003), Boolean Reasoning: The Logic of Boolean Equations, 1st edition, Kluwer Academic Publishers, Norwell, MA. 2nd edition, Dover Publications, Mineola, NY.
- Chang, C.C. and Keisler, H.J. (1973), Model Theory, North-Holland, Amsterdam, Netherlands.
- Kohavi, Zvi (1978), Switching and Finite Automata Theory, 1st edition, McGrawâ€“Hill, 1970. 2nd edition, McGrawâ€“Hill, 1978.
- Korfhage, Robert R. (1974), Discrete Computational Structures, Academic Press, New York, NY.
- Lambek, J. and Scott, P.J. (1986), Introduction to Higher Order Categorical Logic, Cambridge University Press, Cambridge, UK.
- Mendelson, Elliot (1964), Introduction to Mathematical Logic, D. Van Nostrand Company.
Related works
- BOOK, Hofstadter, Douglas, Douglas Hofstadter, (GÃ¶del, Escher, Bach, GÃ¶del, Escher, Bach: An Eternal Golden Braid), 1979, Basic Books, 978-0-465-02656-2,
External links
- Klement, Kevin C. (2006), "Propositional Logic", in James Fieser and Bradley Dowden (eds.), Internet Encyclopedia of Philosophy, Eprint.
- Formal Predicate Calculus, contains a systematic formal development along the lines of Alternative calculus
- forall x: an introduction to formal logic, by P.D. Magnus, covers formal semantics and proof theory for sentential logic.
- Chapter 2 / Propositional Logic from Logic In Action
- Propositional sequent calculus prover on Project Nayuki. (note: implication can be input in the form !X|Y, and a sequent can be a single formula prefixed with > and having no commas)
- Propositional Logic - A Generative Grammar
- content above as imported from Wikipedia
- "propositional calculus" does not exist on GetWiki (yet)
- time: 2:02pm EST - Sat, Dec 15 2018
- "propositional calculus" does not exist on GetWiki (yet)
- time: 2:02pm EST - Sat, Dec 15 2018
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 09 MAY 2016
GetMeta:About
GetWiki
GetWiki
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
Biographies
GETWIKI 20 AUG 2014
GetMeta:News
GetWiki
GetWiki
GETWIKI 19 AUG 2014
GETWIKI 18 AUG 2014
Wikinfo
Culture
Culture
© 2018 M.R.M. PARROTT | ALL RIGHTS RESERVED