Deontic logicDeontic logic is the field of philosophical logic that is concerned with obligation, permission, and related concepts. Alternatively, a deontic logic is a formal system that attempts to capture the essential logical features of these concepts. It can be used to formalize imperative logic, or directive modality in natural languages. Typically, a deontic logic uses OA to mean it is obligatory that A (or it ought to be (the case) that A), and PA to mean it is permitted (or permissible) that A, which is defined as .
Law of identityIn logic, the law of identity states that each thing is identical with itself. It is the first of the historical three laws of thought, along with the law of noncontradiction, and the law of excluded middle. However, few systems of logic are built on just these laws. The earliest recorded use of the law appears to occur in Plato's dialogue Theaetetus (185a), wherein Socrates attempts to establish that what we call "sounds" and "colours" are two different classes of thing: Socrates: With regard to sound and colour, in the first place, do you think this about both: that they both are? Theaetetus: Yes.
Informal logicInformal logic encompasses the principles of logic and logical thought outside of a formal setting (characterized by the usage of particular statements). However, the precise definition of "informal logic" is a matter of some dispute. Ralph H. Johnson and J. Anthony Blair define informal logic as "a branch of logic whose task is to develop non-formal standards, criteria, procedures for the analysis, interpretation, evaluation, criticism and construction of argumentation.
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.
Type–token distinctionThe type–token distinction is the difference between naming a class (type) of objects and naming the individual instances (tokens) of that class. Since each type may be exemplified by multiple tokens, there are generally more tokens than types of an object. For example, the sentence "A rose is a rose is a rose" contains three word types: three word tokens of the type a, three word tokens of the type rose and two word tokens of the type is. The distinction is important in disciplines such as logic, linguistics, metalogic, typography and computer programming.
Converse (logic)In logic and mathematics, the converse of a categorical or implicational statement is the result of reversing its two constituent statements. For the implication P → Q, the converse is Q → P. For the categorical proposition All S are P, the converse is All P are S. Either way, the truth of the converse is generally independent from that of the original statement. Let S be a statement of the form P implies Q (P → Q). Then the converse of S is the statement Q implies P (Q → P).
NegationIn logic, negation, also called the logical not or logical complement, is an operation that takes a proposition to another proposition "not ", standing for " is not true", written , or . It is interpreted intuitively as being true when is false, and false when is true. Negation is thus a unary logical connective. It may be applied as an operation on notions, propositions, truth values, or semantic values more generally. In classical logic, negation is normally identified with the truth function that takes truth to falsity (and vice versa).
Truth valueIn logic and mathematics, a truth value, sometimes called a logical value, is a value indicating the relation of a proposition to truth, which in classical logic has only two possible values (true or false). In some programming languages, any expression can be evaluated in a context that expects a Boolean data type. Typically (though this varies by programming language) expressions like the number zero, the empty string, empty lists, and null evaluate to false, and strings with content (like "abc"), other numbers, and objects evaluate to true.
Formalism (philosophy of mathematics)In the philosophy of mathematics, formalism is the view that holds that statements of mathematics and logic can be considered to be statements about the consequences of the manipulation of strings (alphanumeric sequences of symbols, usually as equations) using established manipulation rules. A central idea of formalism "is that mathematics is not a body of propositions representing an abstract sector of reality, but is much more akin to a game, bringing with it no more commitment to an ontology of objects or properties than ludo or chess.
Free logicA free logic is a logic with fewer existential presuppositions than classical logic. Free logics may allow for terms that do not denote any object. Free logics may also allow models that have an empty domain. A free logic with the latter property is an inclusive logic. In classical logic there are theorems that clearly presuppose that there is something in the domain of discourse. Consider the following classically valid theorems. 1. 2. 3. A valid scheme in the theory of equality which exhibits the same feature is 4.
