Satisfaction of formulas refers to the condition where a particular assignment of values to variables makes a logical formula true. It is a fundamental concept in logic, computer science, and mathematics, particularly in the fields of propositional logic and first-order logic, where determining the satisfiability of formulas is crucial for problem-solving and algorithm design.