|
Interpretability
In mathematical logic, interpretability is a relation between formal theories that expresses the possibility of interpreting or translating one into the other. Informal definition Assume ''T'' and ''S'' are formal theories. Slightly simplified, ''T'' is said to be ''interpretable'' in ''S'' if and only if the language of ''T'' can be translated into the language of ''S'' in such a way that ''S'' proves the translation of every theorem of ''T''. Of course, there are some natural conditions on admissible translations here, such as the necessity for a translation to preserve the logical structure of formulas. This concept, together with weak interpretability, was introduced by Alfred Tarski in 1953. Three other related concepts are cointerpretability, logical tolerance, and cotolerance, introduced by Giorgi Japaridze in 1992–93. See also * Interpretation (logic) * Interpretation (model theory) * Interpretability logic References * Japaridze, G., and De Jongh, D. (1998) "The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Giorgi Japaridze
Giorgi Japaridze (also spelled Giorgie Dzhaparidze) is a Georgian-American researcher in logic and theoretical computer science. He currently holds the title of Full Professor at the Computing Sciences Department of Villanova University. Japaridze is best known for his invention of computability logic, cirquent calculus, and Japaridze's polymodal logic. Research During 1985–1988 Japaridze elaborated the system GLP, known as Japaridze's polymodal logic. This is a system of modal logic with the "necessity" operators …, understood as a natural series of incrementally weak provability predicates for Peano arithmetic. In "The polymodal logic of provability" Japaridze proved the arithmetical completeness of this system, as well as its inherent incompleteness with respect to Kripke frames. GLP has been extensively studied by various authors during the subsequent three decades, especially after Lev Beklemishev, in 2004, pointed out its usefulness in understanding the proof theor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cointerpretability
In mathematical logic, cointerpretability is a binary relation on formal theories: a formal theory ''T'' is cointerpretable in another such theory ''S'', when the language of ''S'' can be translated into the language of ''T'' in such a way that ''S'' proves every formula whose translation is a theorem of ''T''. The "translation" here is required to preserve the logical structure of formulas. This concept, in a sense dual to interpretability In mathematical logic, interpretability is a relation between formal theories that expresses the possibility of interpreting or translating one into the other. Informal definition Assume ''T'' and ''S'' are formal theories. Slightly simplified, '' ..., was introduced by , who also proved that, for theories of Peano arithmetic and any stronger theories with effective axiomatizations, cointerpretability is equivalent to \Sigma_1-conservativity. See also * Cotolerance * Interpretability logic. * Tolerance (in logic) References *. *. Math ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tolerance (in Logic)
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 sequences of theories to trees of theories. Weak interpretability can be shown to be a special, binary case of tolerance. This concept, together with its dual concept of cotolerance, was introduced by Japaridze in 1992, who also proved that, for Peano arithmetic and any stronger theories with effective axiomatizations, tolerance is equivalent to \Pi_1-consistency. See also *Interpretability *Cointerpretability * Interpretability logic References G. Japaridze ''The logic of linear tolerance''. Studia Logica ''Studia Logica'' (full name: Studia Logica, An International Journal for Symbolic Logic), is a scienific journal publishing papers employing formal tools from Mathematics and Logic. The scope of papers published in Studia Lo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Weak Interpretability
In mathematical logic, weak interpretability is a notion of translation of logical theories, introduced together with interpretability by Alfred Tarski in 1953. Let ''T'' and ''S'' be 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 language of ''S'' in such a way that the translation of every theorem of ''T'' is consistent with ''S''. Of course, there are some natural conditions on admissible translations here, such as the necessity for a translation to preserve the logical structure of formulas. A generalization of weak interpretability, tolerance, was introduced by Giorgi Japaridze Giorgi Japaridze (also spelled Giorgie Dzhaparidze) is a Georgian-American researcher in logic and theoretical computer science. He currently holds the title of Full Professor at the Computing Sciences Department of Villanova University. Japaridze i ... in 1992. See also * Interpretability logic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Interpretability Logic
Interpretability logics comprise a family of modal logics that extend provability logic to describe interpretability or various related metamathematical properties and relations such as weak interpretability, Π1-conservativity, cointerpretability, tolerance, cotolerance, and arithmetic complexities. Main contributors to the field are Alessandro Berarducci, Petr Hájek, Konstantin Ignatiev, Giorgi Japaridze, Franco Montagna, Vladimir Shavrukov, Rineke Verbrugge, Albert Visser, and Domenico Zambella. Examples Logic ILM The language of ILM extends that of classical propositional logic by adding the unary modal operator \Box and the binary modal operator \triangleright (as always, \Diamond p is defined as \neg \Box\neg p). The arithmetical interpretation of \Box p is “p is provable in Peano arithmetic (PA)”, and p \triangleright q is understood as “PA+q is interpretable in PA+p”. Axiom schemata: 1. All classical tautologies 2. \Box(p \rightarrow q) \rightarrow ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Interpretation (model Theory)
In model theory, interpretation of a structure ''M'' in another structure ''N'' (typically of a different signature) is a technical notion that approximates the idea of representing ''M'' inside ''N''. For example every reduct or definitional expansion of a structure ''N'' has an interpretation in ''N''. Many model-theoretic properties are preserved under interpretability. For example if the theory of ''N'' is stable and ''M'' is interpretable in ''N'', then the theory of ''M'' is also stable. Note that in other areas of mathematical logic, the term "interpretation" may refer to a structure, rather than being used in the sense defined here. These two notions of "interpretation" are related but nevertheless distinct. Definition An interpretation of a structure ''M'' in a structure ''N'' with parameters (or without parameters, respectively) is a pair (n,f) where ''n'' is a natural number and f is a surjective map from a subset of ''Nn'' onto ''M'' such that the f-preimage (mo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alfred Tarski
Alfred Tarski (, born Alfred Teitelbaum;School of Mathematics and Statistics, University of St Andrews ''School of Mathematics and Statistics, University of St Andrews''. January 14, 1901 – October 26, 1983) was a Polish-American logician and mathematician. A prolific author best known for his work on model theory, metamathematics, and algebraic logic, he also contributed to abstract algebra, topology, geometry, measure theory, mathematical logic, set theory, and analytic philosophy. Educated in Poland at the University of Warsaw, and a member of the Lwów–Warsaw school of logic and the Warsaw school of mathematics, he immigrated to the United States in 1939 where he became a naturalized citizen in 1945. Tarski taught and carried out research in mathematics at the University of California, Berkeley, from 1942 until his death in 1983. Feferman A. His biographers Anita Burdman Feferman and Solomon Feferman state that, "Along with his contemporary, Kurt Gödel, he changed ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Andrzej Mostowski
Andrzej Mostowski (1 November 1913 – 22 August 1975) was a Polish mathematician. He is perhaps best remembered for the Mostowski collapse lemma. Biography Born in Lemberg, Austria-Hungary, Mostowski entered University of Warsaw in 1931. He was influenced by Kuratowski, Lindenbaum, and Tarski. His Ph.D. came in 1939, officially directed by Kuratowski but in practice directed by Tarski who was a young lecturer at that time. He became an accountant after the German invasion of Poland but continued working in the Underground Warsaw University. After the Warsaw uprising of 1944, the Nazis tried to put him in a concentration camp. With the help of some Polish nurses, he escaped to a hospital, choosing to take bread with him rather than his notebook containing his research. Some of this research he reconstructed after the War, however much of it remained lost. His work was largely on recursion theory and undecidability. From 1946 until his death in Vancouver, British Columbia, Ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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. In these contexts an interpretation is a function that provides the extension of symbols and strings of symbols of an object language. For example, an interpretation function could take the predicate ''T'' (for "tall") and assign it the extension (for "Abraham Lincoln"). Note that all our interpretation does is assign the extension to the non-logical constant ''T'', and does not make a claim about whether ''T'' is to stand for tall and 'a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Logic
Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. However, it can also include uses of logic to characterize correct mathematical reasoning or to establish foundations of mathematics. Since its inception, mathematical logic has both contributed to and been motivated by the study of foundations of mathematics. This study began in the late 19th century with the development of axiomatic frameworks for geometry, arithmetic, and analysis. In the early 20th century it was shaped by David Hilbert's program to prove the consistency of foundational theories. Results of Kurt Gödel, Gerhard Gentzen, and others provided partial resolution to the program, and clarified the issues involved in proving consistency. Work in set theory sho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theory (mathematical Logic)
In mathematical logic, a theory (also called a formal theory) is a set of sentences in a formal language. In most scenarios, a deductive system is first understood from context, after which an element \phi\in T of a deductively closed theory T is then called a theorem of the theory. In many deductive systems there is usually a subset \Sigma \subseteq T that is called "the set of axioms" of the theory T, in which case the deductive system is also called an "axiomatic system". By definition, every axiom is automatically a theorem. A first-order theory is a set of first-order sentences (theorems) recursively obtained by the inference rules of the system applied to the set of axioms. General theories (as expressed in formal language) When defining theories for foundational purposes, additional care must be taken, as normal set-theoretic language may not be appropriate. The construction of a theory begins by specifying a definite non-empty ''conceptual class'' \mathcal, the eleme ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
