I am trying to clear my doubts about various terms: tautology, contradiction, contingent, satisifiable, unsatisfiable, valid and invalid. I have read on them from various sources, and am putting all my understanding below in point form. I don't know whether I am overthinking. I just want exhaustive understanding. Could someone please check whether my understanding below is correct, and where my mistakes are?
Some of these definitions are straight up from other sources (so they must be correct), and the rest are written from my own understanding:
- Tautology: a formula or assertion that is true in every possible interpretation (that is, for all assignment of values to its propositional variables). Ref
- Contradiction: a formula or assertion that is false in every possible interpretation (that is, for all assignment of values to its propositional variables).
- A formula that is neither a tautology nor a contradiction is said to be logically contingent.
Such a formula can be either true or false based on the values assigned to its propositional variables.- A formula is satisfiable if it is true under at least one interpretation.
So, it's either contingent or a tautology. Ref- If a logic is a contradiction then it is said to be unsatisfiable.
- A formula is valid only if it is a tautology. Ref
- A formula is invalid if it is contingent or a contradiction.
Based on these definitions, I prepared a diagram showing how these concepts overlap:
Based on this diagram, I tried to answer questions like, "what is the negation of a tautology?" I felt that it could be either contingent or a contradiction: the above diagram means, "Given an assertion, if it is not a tautology, it can be either contingent or a contradiction." But it seems that I was wrong: the above diagram does not mean, "The negation of a tautology can be contingent or a contradiction." J.G.'s comment pointed out that I was simply negating definitions above, where I should have actually tried investigating how models (sets of values assigned to variables of formulae) satisfying a given formula behave for the negation of that formula. It took a while for me to understand that, and I have now come up with the following relations between any given assertion and its negation (I have given examples in brackets):



