Double Negation Elimination Validator (¬¬P ⊢ P)

Validate double-negation elimination from an explicitly double-negated identifier to a claimed atom.

Description

Double-negation elimination permits an explicitly double-negated atom to be affirmed in classical logic.

Double-negation elimination permits an explicitly double-negated atom to be affirmed in classical logic. The supplied field represents the atom inside those two negations.^[1]

The tool returns matchesRule. Interpret the result under the rule and assumptions below; an encoded premise’s truth is not independently established.

When to use Double Negation Elimination Validator (¬¬P ⊢ P)

Use this for the following task: Validate double-negation elimination from an explicitly double-negated identifier to a claimed atom. Prepare the specified logical encoding before running the check or transformation.

How to use Double Negation Elimination Validator (¬¬P ⊢ P) 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 negatedAtom, conclusion according to the field table, then run the tool.
Read matchesRule. 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
negatedAtom	Negated Atom	string; maximum text length 100; pattern ^(?!(?:true\|false)$)[A-Za-z_][A-Za-z0-9_]*$(?![\s\S])	Required
conclusion	Conclusion	string; maximum text length 100; pattern ^(?!(?:true\|false)$)[A-Za-z_][A-Za-z0-9_]*$(?![\s\S])	Required

Enter the inner identifier in negatedAtom and the proposed identifier in conclusion. Return matchesRule when they are identical.

NOT NOT P ⊢ P

The symbols and boundary conditions refer to the supplied fields and the implementation described above.

Output field	Meaning	Value type
matchesRule	Matches Rule	boolean

json

{
  "input": {
    "negatedAtom": "p",
    "conclusion": "p"
  },
  "output": {
    "matchesRule": true
  }
}

Limitations and assumptions

Operands are case-sensitive identifier atoms, not complete expressions. The tool does not parse a proof or determine whether the premises are true. Supply p, not !!p, because the premise shape is implicit.

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 Involution Double Complement Cancel Checker when you need its operation: Cancel pairs of nested negations around an identifier atom using classical involution. Choose Simplification Rule Step Validator (P∧Q ⊢ P) for the complementary operation: Validate conjunction elimination when the claimed conclusion is one of the premise conjunction operands.

Background reference: Additional rules for TFL.

References

Additional rules for TFL — forallx Calgary, Open Logic Project

Similar or alternative tools

Involution Double Complement Cancel Checker
Cancel pairs of nested negations around an identifier atom using classical involution.
Simplification Rule Step Validator (P∧Q ⊢ P)
Validate conjunction elimination when the claimed conclusion is one of the premise conjunction operands.