Mathematical logic and foundations Definition
Negation
Builds on Proposition
Definition
Let be a proposition. The negation of is the proposition , read "not ". The proposition is true when is false, and is false when is true.
| T | F |
| F | T |
Remarks
Other notations for are and . In classical logic, has the same truth value as . This is the double negation law.
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Proposition concept
- Negation definition
Where this leads
113 pages build on this one.
- Cantor set is closed
- Closure is closed
- Contrapositive
- Truth table
- Negation of an existential statement
- Logical equivalence
- Predicate logic
- Propositional logic
- De Morgan's laws
- Intersection of closed sets is closed
- Proof by contrapositive
- Tautology
- A set is closed iff it equals its closure
- Set difference
- Counterexample
- Zermelo–Fraenkel set theory
- Russell's paradox
- Proof by contradiction
- Boundary
- Double negation law
- Negation of a universal statement
- Law of excluded middle
- Closure is the smallest closed superset
- De Morgan's laws for sets
- Symmetric difference
- Proof complexity
- Model theory
- Proof complexity
- Brouwer–Heyting–Kolmogorov interpretation
- Forcing
- Transfer principle
- Von Neumann universe
- Type theory
- Second-order logic
- Realizability
- Intuitionistic logic
- Woodin cardinal
- Naive set theory
- High indices theorem
- Diaconescu's theorem
- Many-valued logic
- Skolem's paradox
- Axiom of regularity
- Constructible universe
- Brouwer–Heyting–Kolmogorov interpretation
- Kunen's inconsistency theorem
- Interior algebra
- Borel determinacy theorem
- Singular cardinals hypothesis
- Axiom schema of replacement
- Internal set theory
- Constructive analysis
- Curry–Howard correspondence
- Cut-elimination theorem
- Ordinal analysis
- Algebraic logic
- Logical connective
- Burali-Forti paradox
- Axiom schema of replacement
- Hadamard gap theorem
- Realizability
- Harmonic measure
- Cohen's independence of CH
- Homotopy type theory
- Intuitionistic type theory
- Hilbert system
- Paraconsistent logic
- Whitehead problem
- Constructivism
- Infinitary logic
- Lindström's theorem
- Theory
- Nonstandard analysis
- Modal logic
- Constructivism
- Linear logic
- Zero sharp
- Constructive analysis
- Double-negation translation
- Homotopy type theory
- Set theory
- Von Neumann–Bernays–Gödel set theory
- Satisfiability
- Higher-order logic
- Intuitionistic type theory
- Logical consequence
- Lindenbaum–Tarski algebra
- Proof theory
- Axiom of regularity
- Natural deduction
- Signature
- Sequent calculus
- Axiom of constructibility
- Foundations of mathematics
- Type theory
- Gödel's consistency of CH and AC
- Double-negation translation
- Jensen's covering theorem
- Set theory
- Heyting arithmetic
- Proof theory
- Logicism
- Von Neumann–Bernays–Gödel set theory
- Church's theorem on undecidability of first-order logic
- Class
- Sequent calculus
- Axiom of determinacy
- Natural boundary
- Inner model
- Naive set theory
- Prime end
- Class
- Dialectica interpretation
Further reading
- Web https://en.wikipedia.org/wiki/Negation, lead section
About this page
| Tag | 0XR7A7RSXB |
|---|---|
| URI | m2://0XR7A7RSXB |
| Kind | definition |
| Writing | W1 stated |
| MSC | 03B05 |
| Defines | Negation |
| Uses | Proposition |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Used by
- Contrapositive
- Truth table
- Negation of an existential statement
- Propositional logic
- De Morgan's laws
- Set difference
- Proof by contradiction
- Double negation law
- Negation of a universal statement
- Law of excluded middle
- Brouwer–Heyting–Kolmogorov interpretation
- Double-negation translation
- Sequent calculus
- Double-negation translation