Domination Law Annihilator Checker (P∨T=T, P∧F=F)
Check whether a Boolean constant is the annihilator of conjunction or disjunction.
Description
An annihilator forces a Boolean operation’s result regardless of its other operand.
An annihilator forces a Boolean operation’s result regardless of its other operand. False dominates AND, and true dominates OR.1
The tool returns annihilator. Interpret the result under the rule and assumptions below; an encoded premise’s truth is not independently established.
When to use Domination Law Annihilator Checker (P∨T=T, P∧F=F)
Use this for the following task: Check whether a Boolean constant is the annihilator of conjunction or disjunction. Prepare the specified logical encoding before running the check or transformation.
How to use Domination Law Annihilator Checker (P∨T=T, P∧F=F) and understand its results
- Prepare the requested Boolean values, complete truth-table rows, or identifier atoms. An atom is a name such as p or premise_1, not a natural-language sentence.
- Enter operator, constant according to the field table, then run the tool.
- Read annihilator. Use the matching rule, assignment order or nonempty-class assumptions below to interpret the result.
- For a false check, inspect the supplied encoding and matching rule. A well-formed false result is different from an input error.
| Input field | Meaning | Value type and bounds | Requirement |
|---|---|---|---|
| operator | Boolean operator | string; choices "and", "or" | Required |
| constant | Candidate annihilator | boolean | Required |
Choose and or or and a Boolean constant. Negate the constant for the and test or return it for the or test.
AND annihilator = false; OR annihilator = true The symbols and boundary conditions refer to the supplied fields and the implementation described above.
| Output field | Meaning | Value type |
|---|---|---|
| annihilator | Annihilator | boolean |
{
"input": {
"operator": "or",
"constant": true
},
"output": {
"annihilator": true
}
}Limitations and assumptions
The flag identifies the supplied constant’s role. The tool does not evaluate or simplify a complete expression.
The supplied encodings must represent the intended propositions or classes. No natural-language parsing or assessment of empirical premise truth is performed. Malformed input gives a tool error rather than a logical false result.
Alternative or Complementary methods
Choose Identity Law Neutral Element Checker (P∧T, P∨F) when you need its operation: Check whether a Boolean constant is the identity element of conjunction or disjunction. Choose Complement Law Contradiction Tautology Pair Checker for the complementary operation: Check for complementary signed identifier literals and apply their conjunction or disjunction law.
Background reference: Complete truth tables.
References
-
Complete truth tables — forallx Calgary, Open Logic Project
Similar or alternative tools
- Identity Law Neutral Element Checker (P∧T, P∨F)
Check whether a Boolean constant is the identity element of conjunction or disjunction.
- Complement Law Contradiction Tautology Pair Checker
Check for complementary signed identifier literals and apply their conjunction or disjunction law.