词条 | Literal (mathematical logic) |
释义 |
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:
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. In Boolean functions, the variables that appear either in complemented or uncompleted form is a literal. For example, if , and are variables then the expressions contains three literal and contains three literals.[1] ExamplesIn 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. References1. ^{{Cite book|url=https://books.google.com.ph/books?redir_esc=y&id=fig900Q1eJ0C&q=literal#v=snippet&q=literal&f=false|title=Digital Logic Circuits|last=A.P.Godse|first=D. A. Godse|date=2008|publisher=Technical Publications|isbn=9788184314250|language=en}}
3 : Mathematical logic|Propositional calculus|Logic symbols |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。