Generalized linear array model: Difference between revisions
en>Melcombe revise cats |
Misprint fixed. |
||
| Line 1: | Line 1: | ||
In [[mathematical logic]], a '''literal''' is an [[atomic formula]] (atom) or its [[negation]]. | |||
The definition mostly appears in [[proof theory]] (of [[classical logic]]), e.g. in [[conjunctive normal form]] and the method of [[resolution (logic)|resolution]]. | |||
Literals can be divided into two types: | |||
* A '''positive literal''' is just an atom. | |||
* A '''negative literal''' is the negation of an atom. | |||
For a literal <math>l</math>, the '''complementary literal''' is a literal corresponding to the negation of <math>l</math>, | |||
we can write <math>\bar{l}</math> to denote the complementary literal of <math>l</math>. More precisely, if <math>l\equiv x</math> then <math>\bar{l}</math> is <math>\lnot x</math> and if <math>l\equiv \lnot x</math> then <math>\bar{l}</math> is <math>x</math>. | |||
In the context of a formula in the [[conjunctive normal form]], a literal is '''pure''' if the literal's complement does not appear in the formula. | |||
== Examples == | |||
In [[propositional calculus]] a literal is simply a [[propositional variable]] or its negation. | |||
In [[predicate calculus]] a literal is an [[atomic formula]] or its negation, where an atomic formula is a [[Predicate (mathematical logic)|predicate]] symbol applied to some [[term (logic)|terms]], <math>P(t_1,\ldots,t_n)</math> with the terms [[recursive definition|recursively defined]] starting from constant symbols, variable symbols, and [[function (mathematics)|function]] symbols. For example, <math>\neg Q(f(g(x), y, 2), x)</math> is a negative literal with the constant symbol 2, the variable symbols ''x'', ''y'', the function symbols ''f'', ''g'', and the predicate symbol ''Q''. | |||
==References== | |||
*{{cite book | author = Samuel R. Buss | chapter= An introduction to proof theory | editor = Samuel R. Buss | title=Handbook of proof theory | pages = 1–78 | url = http://math.ucsd.edu/~sbuss/ResearchWeb/handbookI/ | publisher = Elsevier | date = 1998 | id = ISBN 0-444-89840-9 }} | |||
[[Category:Propositional calculus]] | |||
[[Category:Logic symbols]] | |||
{{logic-stub}} | |||
Revision as of 20:30, 9 November 2013
In mathematical logic, a literal is an atomic formula (atom) or its negation. The definition mostly appears in proof theory (of classical logic), e.g. in conjunctive normal form and the method of resolution.
Literals can be divided into two types:
- A positive literal is just an atom.
- A negative literal is the negation of an atom.
For a literal , the complementary literal is a literal corresponding to the negation of , we can write to denote the complementary literal of . More precisely, if then is and if then is .
In the context of a formula in the conjunctive normal form, a literal is pure if the literal's complement does not appear in the formula.
Examples
In propositional calculus a literal is simply a propositional variable or its negation.
In predicate calculus a literal is an atomic formula or its negation, where an atomic formula is a predicate symbol applied to some terms, with the terms recursively defined starting from constant symbols, variable symbols, and function symbols. For example, is a negative literal with the constant symbol 2, the variable symbols x, y, the function symbols f, g, and the predicate symbol Q.
References
- 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534