Assigned Literal
Jump to navigation
Jump to search
An Assigned Literal is a Literal with a Constant (not a Variable).
- AKA: Grounded Literal.
- …
- Counter-Example(s):
- See: Satisfiable Logic Sentence, Computer Programming Literal, Ground Atomic Formula, Predicate Logic.
References
2018a
- (Wikipedia, 2018) ⇒ https://en.wikipedia.org/wiki/Ordinal_data_type Retrieved:2018-5-13.
- In computer programming, an ordinal data type is a data type with the property that its values can be counted. That is, the values can be put in a one-to-one correspondence with the positive integers. For example, characters are ordinal because we can call 'A' the first character, 'B' the second, etc. The term is often used in programming for variables that can take one of a finite (often small) number of values. While the values are often implemented as integers (or similar types such as bytes) they are assigned literal names and the programming language (and the compiler for that language) can enforce that variables only be assigned those literals.
2018b
- (Wikipedia, 2018) ⇒ https://en.wikipedia.org/wiki/Ground_expression Retrieved:2018-5-13.
- In mathematical logic, a ground term of a formal system is a term that does not contain any free variables.
Similarly, a ground formula is a formula that does not contain any free variables. In first-order logic with identity, the sentence x (x=x) is a ground formula.
A ground expression is a ground term or ground formula.
- In mathematical logic, a ground term of a formal system is a term that does not contain any free variables.
----