Logic Literal
(Redirected from Mathematical Logic Literal)
Jump to navigation
Jump to search
A Logic Literal is a Logic Sentence in a Logic System without Logical Connectives.
- AKA: Literal.
- Context:
- It can be:
- a Positive Literal (is just an Logic Term)
- a Negative Literal (the negation of a Logic Term).
- It can be a part of a Logic Clause.
- It can be:
- Example(s):
- X
- Not X
- … (in Predicate Logic?)
- See: Logic Statement.
References
- (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Literal_(mathematical_logic)
- In mathematical logic, a literal is an atomic formula (atom) or its negation. Literals can be divided into two types:
- A positive literal is just an atom.
- A negative literal is the negation of an atom.
- A pure literal is a literal such that every occurrence of its variable (within some formula) has the same sign.
- In mathematical logic, a literal is an atomic formula (atom) or its negation. Literals can be divided into two types:
- CYC Glossary http://www.cyc.com/cycdoc/ref/glossary.html
- literal: Most generally, a literal is a CYC® expression of the form (predicate arg1 [arg2 … argn]), or its negation, where the number of arguments to the predicate can be any positive integer (but usually not more than 5), and the arguments can be any kind of term