CounterexampleA counterexample is any exception to a generalization. In logic a counterexample disproves the generalization, and does so rigorously in the fields of mathematics and philosophy. For example, the fact that "student John Smith is not lazy" is a counterexample to the generalization “students are lazy”, and both a counterexample to, and disproof of, the universal quantification “all students are lazy.” In mathematics, the term "counterexample" is also used (by a slight abuse) to refer to examples which illustrate the necessity of the full hypothesis of a theorem.
Interpretation (logic)An interpretation is an assignment of meaning to the symbols of a formal language. Many formal languages used in mathematics, logic, and theoretical computer science are defined in solely syntactic terms, and as such do not have any meaning until they are given some interpretation. The general study of interpretations of formal languages is called formal semantics. The most commonly studied formal logics are propositional logic, predicate logic and their modal analogs, and for these there are standard ways of presenting an interpretation.
IntensionIn any of several fields of study that treat the use of signs—for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language—an intension is any property or quality connoted by a word, phrase, or another symbol. In the case of a word, the word's definition often implies an intension. For instance, the intensions of the word plant include properties such as "being composed of cellulose (not always true)", "alive", and "organism", among others. A comprehension is the collection of all such intensions.
Free variables and bound variablesIn mathematics, and in other disciplines involving formal languages, including mathematical logic and computer science, a variable may be said to be either free or bound. The terms are opposites. A free variable is a notation (symbol) that specifies places in an expression where substitution may take place and is not a parameter of this or any container expression. Some older books use the terms real variable and apparent variable for free variable and bound variable, respectively.
Classical modal logicIn modal logic, a classical modal logic L is any modal logic containing (as axiom or theorem) the duality of the modal operators that is also closed under the rule Alternatively, one can give a dual definition of L by which L is classical if and only if it contains (as axiom or theorem) and is closed under the rule The weakest classical system is sometimes referred to as E and is non-normal. Both algebraic and neighborhood semantics characterize familiar classical modal systems that are weaker than the weakest normal modal logic K.
If and only ifIn logic and related fields such as mathematics and philosophy, "if and only if" (shortened as "iff") is a biconditional logical connective between statements, where either both statements are true or both are false. The connective is biconditional (a statement of material equivalence), and can be likened to the standard material conditional ("only if", equal to "if ... then") combined with its reverse ("if"); hence the name. The result is that the truth of either one of the connected statements requires the truth of the other (i.
Compactness theoremIn mathematical logic, the compactness theorem states that a set of first-order sentences has a model if and only if every finite subset of it has a model. This theorem is an important tool in model theory, as it provides a useful (but generally not effective) method for constructing models of any set of sentences that is finitely consistent. The compactness theorem for the propositional calculus is a consequence of Tychonoff's theorem (which says that the product of compact spaces is compact) applied to compact Stone spaces, hence the theorem's name.
Subjunctive possibilitySubjunctive possibility (also called alethic possibility) is a form of modality studied in modal logic. Subjunctive possibilities are the sorts of possibilities considered when conceiving counterfactual situations; subjunctive modalities are modalities that bear on whether a statement might have been or could be true—such as might, could, must, possibly, necessarily, contingently, essentially, accidentally, and so on. Subjunctive possibilities include logical possibility, metaphysical possibility, nomological possibility, and temporal possibility.
Propositional variableIn mathematical logic, a propositional variable (also called a sentential variable or sentential letter) is an input variable (that can either be true or false) of a truth function. Propositional variables are the basic building-blocks of propositional formulas, used in propositional logic and higher-order logics. Formulas in logic are typically built up recursively from some propositional variables, some number of logical connectives, and some logical quantifiers.
Propositional formulaIn propositional logic, a propositional formula is a type of syntactic formula which is well formed and has a truth value. If the values of all variables in a propositional formula are given, it determines a unique truth value. A propositional formula may also be called a propositional expression, a sentence, or a sentential formula. A propositional formula is constructed from simple propositions, such as "five is greater than three" or propositional variables such as p and q, using connectives or logical operators such as NOT, AND, OR, or IMPLIES; for example: (p AND NOT q) IMPLIES (p OR q).
