Logic/Propositional logic

From Internet Web School

(Difference between revisions)
Jump to: navigation, search
(Created page with 'Logic > Propositional logic * Category:Logic(Wikipedia) == Contents == *[[wikipedia:Propositional_calculus|Propositional calculus(logic)…')
(Propositional calculus)
Line 10: Line 10:
From Wikipedia, the free encyclopedia
From Wikipedia, the free encyclopedia
-
In [[mathematical logic]], a '''propositional calculus''' or '''logic''' (also called '''sentential calculus''' or '''sentential logic''') is a [[formal system]] in which [[well-formed formula|formulas]] of a [[formal language]] may be [[interpretation (logic)|interpreted]] to represent [[propositions]]. A [[deductive system|system]] of [[rule of inference|inference rules]] and [[axiom]]s allows certain formulas to be derived. These derived formulas are called [[theorem]]s and may be interpreted to be true propositions. Such a constructed sequence of formulas is known as a ''[[formal proof|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.
+
In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is 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. Such a constructed sequence of 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.
== CAI Exercise ==
== CAI Exercise ==

Revision as of 03:26, 23 May 2014

Logic > Propositional logic

Contents

Propositional calculus

From Wikipedia, the free encyclopedia

In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is 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. Such a constructed sequence of 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.

CAI Exercise

Personal tools
In other languages