Interpretation (model theory) Photos:

Interpretation (model theory)
Photo:1
Interpretation (model theory)
Photo:2
Interpretation (model theory)
Photo:3
Interpretation (model theory)
Photo:4


Interpretation (model theory) Basic Informations:

Definition
2> An interpretation of M in 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 (more precisely the fk-preimage) of every set X âŠ† Mk definable in M by a first-order formula without parameters is definable (in N) by a first-order formula with parameters (or without parameters, respectively). Since the value of n for an interpretation (n,f) is often clear from context, the map f itself is also called an interpretation. To verify that the preimage of every definable (without parameters) set in N is definable in M (with or without parameters), it is sufficient to check the preimages of the following definable sets: the domain of N; the diagonal of N; every relation in the signature of N; the graph of every function in the signature of N. In model theory the term definable often refers to definability with parameters; if this convention is used, definability without parameters is expressed by the term 0-definable. Similarly, an interpretation with parameters may be referred to as simply an interpretation, and an interpretation without parameters as a 0-interpretation. [edit]

Tags:Model Theory,Signature,Definable,Graph,Interpretation,Set,Relation,Theory,First-order,Function,Subset,Domain,Model,
Bi-interpretability
2> If L, M and N are three structures, L is interpreted in M, and M is interpreted in N, then one can naturally construct a composite interpretation of L in N. If two structures M and N are interpreted in each other, then by combining the interpretations in two possible ways, one obtains an interpretation of each of the two structures in itself. This observation permits to define an equivalence relation among structures, reminiscent of the homotopy equivalence among topological spaces. Two structures M and N are bi-interpretable if there exists an interpretation of M in N and an interpretation of N in M such that the composite interpretations of M in itself and of N in itself are definable in M and in N, respectively (the composite interpretations being viewed as operations on M and on N). [edit]

Tags:Structure,Homotopy Equivalence,
Example
2> The partial map f from Z Ã— Z onto Q which maps (x, y) to x/y provides an interpretation of the field Q of rational numbers in the ring Z of integers (to be precise, the interpretation is (2, f)). In fact, this particular interpretation is often used to define the rational numbers. To see that it is an interpretation (without parameters), one needs to check the following preimages of definable sets in Q: the preimage of Q is defined by the formula φ(x, y) given by ¬ (y = 0); the preimage of the diagonal of Q is defined by the formula φ(x1, y1, x2, y2) given by x1 × y2 = x2 × y1; the preimages of 0 and 1 are defined by the formulas φ(x, y) given by x = 0 and x = y; the preimage of the graph of addition is defined by the formula φ(x1, y1, x2, y2, x3, y3) given by x1×y2×y3 + x2×y1×y3 = x3×y1×y2; the preimage of the graph of multiplication is defined by the formula φ(x1, y1, x2, y2, x3, y3) given by x1×x2×y3 = x3×y1×y2. [edit]

Tags:Fact,
References
2> Logic portal Ahlbrandt, Gisela; Ziegler, Martin (1986), "Quasi finitely axiomatizable totally categorical theories", Annals of Pure and Applied Logic 30: 63–82, doi:10.1016/0168-0072(86)90037-0, http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6TYB-45SJDHX-8&_user=10&_coverDate=01%2F31%2F1986&_rdoc=4&_fmt=high&_orig=browse&_srch=doc-info(%23toc%235614%231986%23999699998%23315074%23FLP%23display%23Volume)&_cdi=5614&_sort=d&_docanchor=&_ct=6&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=dcedb9ab7620fe68560a9f68b586152f  Hodges, Wilfrid (1997), A shorter model theory, Cambridge: Cambridge University Press, ISBN 978-0-521-58713-6  (Section 4.3) Poizat, Bruno (2000), A Course in Model Theory, Springer, ISBN 0-387-98655-3  (Section 9.4) v d e Logic   Overview Academic areas Argumentation theory Axiology Critical thinking Computability theory Formal semantics History of logic Informal logic Logic in computer science Mathematical logic Mathematics Metalogic Metamathematics Model theory Philosophical logic Philosophy Philosophy of logic Philosophy of mathematics Proof theory Set theory Foundational concepts Abduction Analytic truth Antinomy A priori Deduction Definition Description Entailment Induction Inference Logical consequence Logical form Logical implication Logical truth Name Necessity Meaning Paradox Possible world Presupposition Probability Reason Reasoning Reference Semantics Statement Strict implication Substitution Syntax Truth Truth value Validity   Philosophical logic Critical thinking and Informal logic Analysis Ambiguity Argument Belief Bias Credibility Evidence Explanation Explanatory power Fact Fallacy Inquiry Opinion Parsimony Premise Propaganda Prudence Reasoning Relevance Rhetoric Rigor Vagueness Theories of deduction Constructivism Dialetheism Fictionalism Finitism Formalism Intuitionism Logical atomism Logicism Nominalism Platonic realism Pragmatism Realism   Metalogic and metamathematics Cantor's theorem Church's theorem Church's thesis Consistency Effective method Foundations of mathematics Gödel's completeness theorem Gödel's incompleteness theorems Soundness Completeness Decidability Interpretation Löwenheim–Skolem theorem Metatheorem Satisfiability Independence Type–token distinction Use–mention distinction   Mathematical logic General Formal language Formation rule Formal system Deductive system Formal proof Formal semantics Well-formed formula Set Element Class Classical logic Axiom Natural deduction Rule of inference Relation Theorem Logical consequence Axiomatic system Type theory Symbol Syntax Theory Traditional logic Proposition Inference Argument Validity Cogency Syllogism Square of opposition Venn diagram Propositional calculus and Boolean logic Boolean functions Propositional calculus Propositional formula Logical connectives Truth tables Predicate First-order Quantifiers Predicate Second-order Monadic predicate calculus Set theory Set Empty set Enumeration Extensionality Finite set Function Subset Power set Countable set Recursive set Domain Range Ordered pair Uncountable set Model theory Model Interpretation Non-standard model Finite model theory Truth value Validity Proof theory Formal proof Deductive system Formal system Theorem Logical consequence Rule of inference Syntax Computability theory Recursion Recursive set Recursively enumerable set Decision problem Church–Turing thesis Computable function Primitive recursive function   Non-classical logic Modal logic Alethic Axiologic Deontic Doxastic Epistemic Temporal Intuitionism Intuitionistic logic Constructive analysis Heyting arithmetic Intuitionistic type theory Constructive set theory Fuzzy logic Degree of truth Fuzzy rule Fuzzy set Fuzzy finite element Fuzzy set operations Substructural logic Structural rule Relevance logic Linear logic Paraconsistent logic Dialetheism Description logic Ontology Ontology language   Logicians Anderson Aristotle Averroes Avicenna Bain Barwise Bernays Boole Boolos Cantor Carnap Church Chrysippus Curry De Morgan Frege Geach Gentzen Gödel Hilbert Kleene Kripke Leibniz Löwenheim Peano Peirce Putnam Quine Russell Schröder Scotus Skolem Smullyan Tarski Turing Whitehead William of Ockham Wittgenstein Zermelo   Lists Topics Outline of logic Index of logic articles Mathematical logic Boolean algebra Set theory Other Logicians Rules of inference Paradoxes Fallacies Logic symbols Portal Category Outline WikiProject Talk changes Retrieved from "http://en.wikipedia.org/w/index.php?title=Interpretation_(model_theory)&oldid=442654059" Categories: Model theory Personal tools Log in / create account Namespaces Article Discussion Variants Views Read Edit View history Actions Search Navigation Main page Contents Featured content Current events Random article Donate to Wikipedia Interaction Help About Wikipedia Community portal Recent changes Contact Wikipedia Toolbox What links here Related changes Upload file Special pages Permanent link Cite this page Print/export Create a bookDownload as PDFPrintable version This page was last modified on 2 August 2011 at 10:30. Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. See Terms of use for details. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.Contact us Privacy policy About Wikipedia Disclaimers Mobile view if ( window.isMSIE55 ) fixalpha(); if ( window.mediaWiki ) { mw.loader.load(["mediawiki.user", "mediawiki.util", "mediawiki.page.ready", "mediawiki.legacy.wikibits", "mediawiki.legacy.ajax", "mediawiki.legacy.mwsuggest", "ext.gadget.wmfFR2011Style", "ext.vector.collapsibleNav", "ext.vector.collapsibleTabs", "ext.vector.editWarning", "ext.vector.simpleSearch", "ext.UserBuckets", "ext.articleFeedback.startup", "ext.articleFeedbackv5.startup", "ext.markAsHelpful"]); } if ( window.mediaWiki ) { mw.user.options.set({"ccmeonemails":0,"cols":80,"date":"default","diffonly":0,"disablemail":0,"disablesuggest":0,"editfont":"default","editondblclick":0,"editsection":1,"editsectiononrightclick":0,"enotifminoredits":0,"enotifrevealaddr":0,"enotifusertalkpages":1,"enotifwatchlistpages":0,"extendwatchlist":0,"externaldiff":0,"externaleditor":0,"fancysig":0,"forceeditsummary":0,"gender":"unknown","hideminor":0,"hidepatrolled":0,"highlightbroken":1,"imagesize":2,"justify":0,"math":1,"minordefault":0,"newpageshidepatrolled":0,"nocache":0,"noconvertlink":0,"norollbackdiff":0,"numberheadings":0,"previewonfirst":0,"previewontop":1,"quickbar":5,"rcdays":7,"rclimit":50,"rememberpassword":0,"rows":25,"searchlimit":20,"showhiddencats":false,"showjumplinks":1,"shownumberswatching":1,"showtoc":1,"showtoolbar":1,"skin":"vector","stubthreshold":0,"thumbsize":4,"underline":2,"uselivepreview":0,"usenewrc":0,"watchcreations":1,"watchdefault":0,"watchdeletion":0,"watchlistdays":3,"watchlisthideanons":0, "watchlisthidebots":0,"watchlisthideliu":0,"watchlisthideminor":0,"watchlisthideown":0,"watchlisthidepatrolled":0,"watchmoves":0,"wllimit":250,"flaggedrevssimpleui":1,"flaggedrevsstable":0,"flaggedrevseditdiffs":true,"flaggedrevsviewdiffs":false,"vector-simplesearch":1,"useeditwarning":1,"vector-collapsiblenav":1,"usebetatoolbar":1,"usebetatoolbar-cgd":1,"wikilove-enabled":1,"variant":"en","language":"en","searchNs0":true,"searchNs1":false,"searchNs2":false,"searchNs3":false,"searchNs4":false,"searchNs5":false,"searchNs6":false,"searchNs7":false,"searchNs8":false,"searchNs9":false,"searchNs10":false,"searchNs11":false,"searchNs12":false,"searchNs13":false,"searchNs14":false,"searchNs15":false,"searchNs100":false,"searchNs101":false,"searchNs108":false,"searchNs109":false,"gadget-wmfFR2011Style":1});;mw.user.tokens.set({"editToken":"+\\","watchToken":false});;mw.loader.state({"user.options":"ready","user.tokens":"ready"}); /* cache key: enwiki:resourceloader:filter:minify-js:4:b41a86ec4e0fe8329bc3ce917e792339 */ }

Tags:Stable,Hodges, Wilfrid,Cambridge University Press,Springer,Argumentation Theory,Axiology,Critical Thinking,Computability Theory,Formal Semantics,History Of Logic,Informal Logic,Logic In Computer Science,Mathematical Logic,Mathematics,Metalogic,Metamathematics,Philosophical Logic,Philosophy,Philosophy Of Logic,Philosophy Of Mathematics,Proof Theory,Set Theory,Abduction,Analytic Truth,Antinomy,A Priori,Deduction,Definition,Description,Entailment,Induction,Inference,Logical Consequence,Logical Form,Logical Implication,Logical Truth,Name,Necessity,Meaning,Paradox,Possible World,Presupposition,Probability,Reason,Reasoning,Reference,Semantics,Statement,Strict Implication,Substitution,Syntax,Truth,Truth Value,Analysis,Ambiguity,Argument,Belief,Bias,Credibility,Evidence,Explanation,Explanatory Power,Fallacy,Inquiry,Opinion,Parsimony,Premise,Propaganda,Prudence,Relevance,Rhetoric,Rigor,Vagueness,Theories Of Deduction,Constructivism,Dialetheism,Fictionalism,Finitism,Formalism,Intuitionism,Logical Atomism,Logicism,Nominalism,Platonic Realism,Pragmatism,Cantor's Theorem,Church's Theorem,Church's Thesis,Consistency,Effective Method,Foundations Of Mathematics,Gödel's Completeness Theorem,Gödel's Incompleteness Theorems,Soundness,Completeness,Decidability,Löwenheim–skolem Theorem,Metatheorem,Satisfiability,Independence,Type–token Distinction,Formal Language,Formation Rule,Formal System,Deductive System,Formal Proof,Well-formed Formula,Element,Class,Classical Logic,Axiom,Natural Deduction,Rule Of Inference,Theorem,Axiomatic System,Type Theory,Symbol,Traditional Logic,

z³ote monety