Interpretability — The concept of interpretability is one in mathematical logic. Assume T and S are formal theories. Slightly simplified, T is said to be interpretable in S iff the language of T can be translated into the language of S in such a way that S proves… … Wikipedia
Weak interpretability — is a special case of the concept of tolerance introduced by Giorgi Japaridze in 1992. Assume T and S are formal theories. Slightly simplified, T is said to be weakly interpretable in S if, and only if, the language of T can be translated into the … Wikipedia
List of mathematical logic topics — Clicking on related changes shows a list of most recent edits of articles to which this page links. This page links to itself in order that recent changes to this page will also be included in related changes. This is a list of mathematical logic … Wikipedia
Outline of logic — The following outline is provided as an overview of and topical guide to logic: Logic – formal science of using reason, considered a branch of both philosophy and mathematics. Logic investigates and classifies the structure of statements and… … Wikipedia
List of basic topics in logic — For a more comprehensive list, see the List of logic topics. Logic, a branch of both philosophy and mathematics, is the study of criteria for the evaluation of arguments. The task of the logician is to advance an account of valid and fallacious… … Wikipedia
List of topics in logic — This is a list of topics in logic.See also: List of mathematical logic topicsAlphabetical listAAbacus logic Abduction (logic) Abductive validation Affine logic Affirming the antecedent Affirming the consequent Antecedent Antinomy Argument form… … Wikipedia
Provability logic — is a modal logic, in which the box (or necessity ) operator is interpreted as it is provable that . The point is to capture the notion of a proof predicate of a reasonably rich formal theory, such as Peano arithmetic. There are a number of… … Wikipedia
Modal logic — is a type of formal logic that extends classical propositional and predicate logic to include operators expressing modality. Modals words that express modalities qualify a statement. For example, the statement John is happy might be qualified by… … Wikipedia
Decidability (logic) — In logic, the term decidable refers to the decision problem, the question of the existence of an effective method for determining membership in a set of formulas. Logical systems such as propositional logic are decidable if membership in their… … Wikipedia
Tolerant sequence — In mathematical logic, a tolerant sequence is a sequence :T 1,...,T n of formal theories such that there are consistent extensions :S 1,...,S n of these theories with each S {i+1} interpretable in S i. Tolerance naturally generalizes from… … Wikipedia
