Key Logic Terms: Definitions Every Reader Should Know

Logic becomes much easier to read once its core terms are understood precisely. Many disagreements about reasoning are really disagreements about vocabulary. People use words like valid, sound, inference, contradiction, proof, necessary, and fallacy as though they were interchangeable, but in logic they are not. Getting the terms right sharpens analysis, prevents category mistakes, and makes both formal and informal argument easier to follow. Readers who want the wider field beside this glossary can pair it with How Logic Is Studied: Methods, Tools, and Evidence, Argument Analysis: Main Topics, Key Debates, and Essential Background, and Formal Logic: Main Topics, Key Debates, and Essential Background.

Core Terms for Claims and Inference

Proposition is the content of what is asserted, denied, believed, or questioned. Different sentences can express the same proposition if they convey the same claim. Logic usually studies propositions rather than the sound or style of the sentences that express them.

Statement is often used for a declarative sentence that can be true or false. In introductory settings, statement and proposition are sometimes treated as near equivalents, though proposition usually names the content and statement the linguistic vehicle.

Premise is a claim offered in support of another claim. In an argument, premises are the reasons or grounds from which a conclusion is drawn.

Conclusion is the claim an argument is trying to establish. It is what the premises are supposed to support.

Inference is the move from one or more claims to another. Logic studies when that move is good, bad, necessary, defeasible, probabilistic, or invalid.

Argument in logic does not mean quarrel. It means a structured set of premises advanced in support of a conclusion. The important question is not whether an argument is heated, but whether its support relation succeeds.

Terms for Evaluating Arguments

Validity is a property of deductive arguments. An argument is valid when it is impossible for the premises to be true and the conclusion false at the same time. Validity concerns structure, not whether the premises are actually true.

Soundness means validity plus true premises. A sound argument is deductively valid and starts from premises that are in fact true. Soundness therefore guarantees a true conclusion, while validity by itself does not.

Invalidity means the support structure fails. The premises may still happen to be true, and the conclusion may still happen to be true, but the conclusion does not follow necessarily from those premises.

Cogency is often used for strong non-deductive reasoning, especially inductive argument. A cogent argument has acceptable premises that give substantial support to its conclusion, even though they do not guarantee it with deductive necessity.

Deductive argument aims at necessity. If it succeeds, the conclusion follows with no room for the premises to be true and the conclusion false.

Inductive argument aims at probability or support rather than guarantee. Evidence from samples, repeated observations, or patterns may make a conclusion reasonable without making it certain.

Abductive reasoning is inference to the best explanation. It asks which available hypothesis best explains the evidence, even though the explanation may later be revised.

Truth, Consistency, and Logical Relations

Truth value is the status of a proposition as true or false. Classical logic usually assumes every proposition has exactly one of these two truth values, though nonclassical logics sometimes complicate that assumption.

Contradiction is a statement or pair of statements that cannot be true together. In classical logic, a contradiction is always false.

Contrary refers to propositions that cannot both be true, though they may both be false. This differs from contradiction, where one must be true and the other false.

Consistency means freedom from contradiction. A set of claims is consistent if they can all be true together.

Tautology is a formula true under every possible assignment of truth values to its components. Tautologies are important because they express forms that are logically guaranteed.

Contingent statement is one that is true in some cases and false in others. Most everyday claims are contingent rather than tautological or contradictory.

Logical equivalence means two statements always share the same truth value. If they are equivalent, each can replace the other without changing logical consequences.

Entailment is the relation in which one claim or set of claims guarantees another. If A entails B, then whenever A is true, B must also be true.

Form, Language, and Symbolization

Logical form is the underlying structure relevant to validity. Two arguments can differ in subject matter yet share the same logical form, which is why logic can generalize across content.

Formalization is the process of translating ordinary-language reasoning into a more precise symbolic or regimented form. This helps expose hidden assumptions, ambiguity, and structural relations.

Syntax in logic refers to the formal rules governing how symbols may be combined. It concerns well-formedness, not meaning.

Semantics concerns meaning, interpretation, and truth conditions. In formal logic, semantics explains how formulas receive values in models or structures.

Symbolic logic uses formal notation to represent inference patterns with precision. Symbols reduce the distraction of surface wording and make complex structures easier to test.

Natural language is ordinary human language such as English. Logic often studies where natural language tracks formal structure well and where it introduces ambiguity, vagueness, or context dependence.

Quantifiers, Predicates, and Scope

Predicate is an expression that attributes a property or relation, such as “is mortal” or “loves.” Predicate logic studies how such expressions combine with names, variables, and quantifiers.

Variable is a symbol that can stand for unspecified objects in a domain. Variables are crucial for general claims.

Quantifier is a device that indicates how many objects a claim ranges over. The two most common are the universal quantifier, meaning roughly “for all,” and the existential quantifier, meaning roughly “there exists.”

Domain is the set of objects under discussion in a formal interpretation. A quantified statement can change truth value if the domain changes.

Scope tells us how far a quantifier, negation, or connective reaches within a formula. Many reasoning errors come from misunderstanding scope.

Identity expresses that something is the very same object as something else. Identity claims become important when reasoning about uniqueness, substitution, and reference.

Proof, Models, and Demonstration

Proof is a finite sequence of justified steps showing that a conclusion follows from premises or axioms according to specified rules. Proof belongs to the syntactic side of logic.

Rule of inference is a licensed pattern for moving from some formulas to another. Modus ponens and universal instantiation are classic examples.

Axiom is a starting statement accepted within a formal system without proof inside that system. Different systems use different axioms.

Theorem is a statement derivable from axioms by valid rules of inference. Once proven, it belongs to the formal consequences of the system.

Model is an interpretation in which the relevant formulas come out true. Model theory studies classes of such interpretations and the relation between formulas and structures.

Countermodel is a model showing that an argument or formula does not have the alleged property. If premises are true and the conclusion false in a countermodel, the argument is invalid.

Completeness usually refers to a match between syntactic provability and semantic truth in a system. Roughly speaking, whatever is semantically valid is also provable.

Soundness at the system level means the rules never prove anything semantically invalid. This is related to, but distinct from, the earlier notion of a sound argument.

Common Terms in Informal and Applied Logic

Fallacy is a recurring pattern of bad reasoning. Some fallacies are formal, involving invalid structure. Others are informal, involving relevance, ambiguity, burden of proof, or misuse of evidence.

Equivocation occurs when a key term shifts meaning during an argument, making the reasoning look stronger than it is.

Begging the question means assuming, often in disguised form, what the argument is supposed to prove. It is circular support, not merely raising an issue.

Burden of proof refers to the responsibility to provide adequate support for a claim, especially when disagreement exists.

Necessary condition is something that must be present for another thing to occur. Sufficient condition is something that, if present, guarantees the other thing. Confusing the two is one of the most common reasoning errors.

Defeasible reasoning is reasoning that can be withdrawn when new information appears. Much everyday and legal reasoning works this way, unlike strict deductive proof.

Modal and Meta-Level Terms Readers Often Meet Next

Converse, inverse, and contrapositive are also worth keeping straight. From “if P, then Q,” the converse is “if Q, then P,” the inverse is “if not P, then not Q,” and the contrapositive is “if not Q, then not P.” Only the contrapositive is logically equivalent to the original conditional, and confusion among these forms causes countless mistakes in everyday reasoning.

Necessity means a claim could not be false, while possibility means a claim could be true. Modal logic studies these operators and related ideas such as obligation, knowledge, and time.

Possible world is a technical device used in semantics to evaluate modal claims. It does not have to mean a physically existing universe; it is often a way of representing alternative ways things might have been.

Metalanguage is the language used to talk about another language, called the object language. This distinction prevents confusion when discussing formulas, truth, and proof.

Decidability concerns whether there is a procedure that can always determine, in finite time, whether a formula or problem belongs to a given class. Logic often asks not only what is true, but what can be effectively determined.

Paradox names a result or argument that produces contradiction, absurdity, or severe tension among assumptions that initially seemed acceptable. Paradoxes are important because they often expose hidden weaknesses in a theory or language.

These terms matter because modern logic extends far beyond simple syllogisms. It studies modality, knowledge, time, computation, provability, and systems that behave differently from standard classical assumptions. A reader equipped with the core vocabulary can enter those advanced areas without losing the thread or confusing fundamentally different kinds of questions and methods.

Why These Terms Matter Beyond the Classroom

These terms are not pedantic decoration. They let readers distinguish airtight support from plausible support, meaning from form, contradiction from mere disagreement, and proof from persuasive rhetoric. They also allow people to move between ordinary argument, mathematics, computer science, legal reasoning, and philosophical analysis without losing track of what kind of support is actually on offer.

That is why learning logic begins with vocabulary. Once the terms are precise, stronger questions become possible. Is an argument invalid or simply unsupported? Is a conclusion entailed or merely suggested? Is a dispute about truth, meaning, scope, evidence, or hidden premises? Logic becomes far more useful when its language is used carefully, because careful language is one of the main tools by which careful reasoning becomes visible, teachable, comparable, and easier to evaluate.