A mapping that assigns truth values (commonly True or False) to propositional variables or to ground atomic formulas in a given structure, used as the basis for evaluating formulas or testing satisfiability.

Principle

Provide a complete function from the set of atomic propositions (or ground atoms) to truth values so that the truth of complex formulas can be determined compositionally from these atomic assignments.

Demonstration

A truth assignment v with v(p)=T, v(q)=F yields v(p ∨ q)=T and v(p ∧ q)=F; in model checking, a truth assignment that satisfies all ground atoms of a theory corresponds to a candidate model on the propositional layer.

Misapplication

Confusing a partial assignment (values for some atoms only) with a total truth assignment when testing global satisfiability can produce false negatives; also using inconsistent assignments (assigning both T and F) is ill-formed.

Consequence

A well-defined truth assignment permits constructive evaluation and algorithmic satisfiability checks (e.g., via SAT solvers) and underpins countermodel construction for refuting entailments.

Reversal

The inverted perspective treats semantic valuation as model-based structures (interpretations of non-atomic symbols) rather than as mere mappings from atoms to truth values.

Boundary

Refers to assignments of propositional atoms or ground atoms in a fixed domain; it excludes semantic valuations that assign non-Boolean semantic objects (e.g., denotations of terms in first-order models) unless reduced to truth values.

Semantic Tension

Tension exists between viewing truth assignments as finite computational objects used in algorithms and viewing semantic valuations as structural maps carrying richer interpretive content beyond truth-values.

Synthesis

A truth assignment is the explicit function that fixes truth values for atomic constituents, enabling compositional evaluation of formulas and serving as the computational substrate for satisfiability and model-finding tasks.