Browse Wiki & Semantic Web

Jump to: navigation, search
Http://dbpedia.org/resource/Conservative extension
  This page has no properties.
hide properties that link here 
  No properties link to this page.
 
http://dbpedia.org/resource/Conservative_extension
http://dbpedia.org/ontology/abstract In logica matematica, nell'ambito della teIn logica matematica, nell'ambito della teoria della dimostrazione, un'estensione conservativa di una teoria logica T1 è una teoria T2 tale che: * tutti i simboli di T1 sono presenti anche in T2 * ogni teorema di T1 è anche un teorema di T2 * ogni teorema di T2 esprimibile usando soltanto il linguaggio di T1 è un teorema di T1. Nella teoria dei modelli, T2 si dice un'estensione conservativa di T1 se ogni modello di T1 può essere esteso in un modello di T2. Tutte le estensioni conservative nel senso della teoria dei modelli lo sono anche nella definizione della teoria della dimostrazione.inizione della teoria della dimostrazione. , 保守扩展是逻辑中的一个概念。一个知识库K'是K的扩展,如果K是K'的一个子集;K'是保守扩展是逻辑中的一个概念。一个知识库K'是K的扩展,如果K是K'的一个子集;K'是K的保守扩展,如果对所有只用K中的名字构造的命题, K' 当且仅当 K。换句话说,保守扩展不会改变原有的知识库的结构。保守扩展在许多领域都有应用,如模块化本体和敏感知识的保护。 在逻辑和推导机制中,I和J分别是一个解释(Interpretation),如果J是I的保守扩展,必须满足以下条件: * 1) 解释I作用在语言集合L中,解释J必须作用在语言集合L'中,并且L'包含L * 2) 解释I的域(Domain)等于解释J的域 * 3) 对于任何在语言集合L中的元素e,I(e) = J(e) 那么我们说J是I的保守扩展。对于任何在语言集合L中的元素e,I(e) = J(e) 那么我们说J是I的保守扩展。 , En logique mathématique, une théorie logiqEn logique mathématique, une théorie logique T2 est une extension conservatrice (ou conservative) d'une théorie T1 si le langage de T2 étend le langage de T1, si chaque théorème de T1 est un théorème de T2 et si tout théorème de T2 qui est dans le langage de T1 est déjà un théorème de T1. Une extension propre est une extension non conservative. Informellement, cela veut dire que la nouvelle théorie peut éventuellement être plus commode pour prouver des théorèmes, mais qu’elle ne prouve pas de théorème nouveau concernant l'ancienne théorie. L'importance de cette notion réside dans le théorème suivant : si T2 est une extension conservatrice de T1, et si T1 est cohérente, alors T2 est également cohérente. Ainsi, les extensions conservatrices ne courent pas le risque d'introduire de nouvelles incohérences. Elles peuvent aussi être vues comme une méthode pour écrire et structurer des théories volumineuses : on commence avec une théorie T0 connue comme cohérente, puis on construit successivement des extensions conservatrices T1, T2, etc. Le démonstrateur automatique Isabelle adopte cette méthodologie en fournissant un langage pour les extensions conservatrices par définition. extensions conservatrices par définition. , In mathematical logic, a conservative exteIn mathematical logic, a conservative extension is a supertheory of a theory which is often convenient for proving theorems, but proves no new theorems about the language of the original theory. Similarly, a non-conservative extension is a supertheory which is not conservative, and can prove more theorems than the original. More formally stated, a theory is a (proof theoretic) conservative extension of a theory if every theorem of is a theorem of , and any theorem of in the language of is already a theorem of . More generally, if is a set of formulas in the common language of and , then is -conservative over if every formula from provable in is also provable in . Note that a conservative extension of a consistent theory is consistent. If it were not, then by the principle of explosion, every formula in the language of would be a theorem of , so every formula in the language of would be a theorem of , so would not be consistent. Hence, conservative extensions do not bear the risk of introducing new inconsistencies. This can also be seen as a methodology for writing and structuring large theories: start with a theory, , that is known (or assumed) to be consistent, and successively build conservative extensions , , ... of it. Recently, conservative extensions have been used for defining a notion of module for ontologies: if an ontology is formalized as a logical theory, a subtheory is a module if the whole ontology is a conservative extension of the subtheory. An extension which is not conservative may be called a proper extension.ervative may be called a proper extension. , 수리논리학에서 보존적 확장(保存的擴張, 영어: conservative extension)은 주어진 이론을 확장하되, 원래 이론의 언어로서 나타낼 수 있는 모든 명제의 증명 가능성 여부가 바뀌지 않게 하는 확장이다.
http://dbpedia.org/ontology/wikiPageExternalLink http://www.cs.nyu.edu/pipermail/fom/1998-October/002306.html +
http://dbpedia.org/ontology/wikiPageID 1840214
http://dbpedia.org/ontology/wikiPageLength 4985
http://dbpedia.org/ontology/wikiPageRevisionID 1119508300
http://dbpedia.org/ontology/wikiPageWikiLink http://dbpedia.org/resource/Absoluteness_%28mathematical_logic%29 + , http://dbpedia.org/resource/Ontology_modularization + , http://dbpedia.org/resource/Ontology_%28computer_science%29 + , http://dbpedia.org/resource/Model_theory + , http://dbpedia.org/resource/Well-formed_formula + , http://dbpedia.org/resource/Zermelo%E2%80%93Fraenkel_set_theory + , http://dbpedia.org/resource/Theorem + , http://dbpedia.org/resource/Theory_%28mathematical_logic%29 + , http://dbpedia.org/resource/Consistent + , http://dbpedia.org/resource/Mathematical_logic + , http://dbpedia.org/resource/Proof_theory + , http://dbpedia.org/resource/Von_Neumann%E2%80%93Bernays%E2%80%93G%C3%B6del_set_theory + , http://dbpedia.org/resource/Internal_set_theory + , http://dbpedia.org/resource/Extension_by_new_constant_and_function_names + , http://dbpedia.org/resource/Extension_by_definitions + , http://dbpedia.org/resource/Second-order_arithmetic + , http://dbpedia.org/resource/Axiom_of_choice + , http://dbpedia.org/resource/Category:Mathematical_logic + , http://dbpedia.org/resource/Analytical_hierarchy + , http://dbpedia.org/resource/Reverse_mathematics + , http://dbpedia.org/resource/Category:Model_theory + , http://dbpedia.org/resource/Methodology + , http://dbpedia.org/resource/Continuum_hypothesis + , http://dbpedia.org/resource/Arithmetical_hierarchy + , http://dbpedia.org/resource/Principle_of_explosion + , http://dbpedia.org/resource/Category:Proof_theory + , http://dbpedia.org/resource/Peano_arithmetic + , http://dbpedia.org/resource/Primitive_recursive_arithmetic +
http://dbpedia.org/property/wikiPageUsesTemplate http://dbpedia.org/resource/Template:Reflist + , http://dbpedia.org/resource/Template:Mathematical_logic + , http://dbpedia.org/resource/Template:Citation_needed +
http://purl.org/dc/terms/subject http://dbpedia.org/resource/Category:Model_theory + , http://dbpedia.org/resource/Category:Proof_theory + , http://dbpedia.org/resource/Category:Mathematical_logic +
http://www.w3.org/ns/prov#wasDerivedFrom http://en.wikipedia.org/wiki/Conservative_extension?oldid=1119508300&ns=0 +
http://xmlns.com/foaf/0.1/isPrimaryTopicOf http://en.wikipedia.org/wiki/Conservative_extension +
owl:sameAs http://rdf.freebase.com/ns/m.0601dh + , http://www.wikidata.org/entity/Q864213 + , http://ko.dbpedia.org/resource/%EB%B3%B4%EC%A1%B4%EC%A0%81_%ED%99%95%EC%9E%A5 + , http://fr.dbpedia.org/resource/Extension_conservatrice + , http://sk.dbpedia.org/resource/Konzervat%C3%ADvne_roz%C5%A1%C3%ADrenie + , https://global.dbpedia.org/id/52MQa + , http://it.dbpedia.org/resource/Estensione_conservativa + , http://dbpedia.org/resource/Conservative_extension + , http://zh.dbpedia.org/resource/%E4%BF%9D%E5%AE%88%E6%89%A9%E5%B1%95 +
rdfs:comment 保守扩展是逻辑中的一个概念。一个知识库K'是K的扩展,如果K是K'的一个子集;K'是保守扩展是逻辑中的一个概念。一个知识库K'是K的扩展,如果K是K'的一个子集;K'是K的保守扩展,如果对所有只用K中的名字构造的命题, K' 当且仅当 K。换句话说,保守扩展不会改变原有的知识库的结构。保守扩展在许多领域都有应用,如模块化本体和敏感知识的保护。 在逻辑和推导机制中,I和J分别是一个解释(Interpretation),如果J是I的保守扩展,必须满足以下条件: * 1) 解释I作用在语言集合L中,解释J必须作用在语言集合L'中,并且L'包含L * 2) 解释I的域(Domain)等于解释J的域 * 3) 对于任何在语言集合L中的元素e,I(e) = J(e) 那么我们说J是I的保守扩展。对于任何在语言集合L中的元素e,I(e) = J(e) 那么我们说J是I的保守扩展。 , En logique mathématique, une théorie logiqEn logique mathématique, une théorie logique T2 est une extension conservatrice (ou conservative) d'une théorie T1 si le langage de T2 étend le langage de T1, si chaque théorème de T1 est un théorème de T2 et si tout théorème de T2 qui est dans le langage de T1 est déjà un théorème de T1. Une extension propre est une extension non conservative. si T2 est une extension conservatrice de T1, et si T1 est cohérente, alors T2 est également cohérente. Le démonstrateur automatique Isabelle adopte cette méthodologie en fournissant un langage pour les extensions conservatrices par définition. extensions conservatrices par définition. , 수리논리학에서 보존적 확장(保存的擴張, 영어: conservative extension)은 주어진 이론을 확장하되, 원래 이론의 언어로서 나타낼 수 있는 모든 명제의 증명 가능성 여부가 바뀌지 않게 하는 확장이다. , In logica matematica, nell'ambito della teIn logica matematica, nell'ambito della teoria della dimostrazione, un'estensione conservativa di una teoria logica T1 è una teoria T2 tale che: * tutti i simboli di T1 sono presenti anche in T2 * ogni teorema di T1 è anche un teorema di T2 * ogni teorema di T2 esprimibile usando soltanto il linguaggio di T1 è un teorema di T1. Nella teoria dei modelli, T2 si dice un'estensione conservativa di T1 se ogni modello di T1 può essere esteso in un modello di T2. Tutte le estensioni conservative nel senso della teoria dei modelli lo sono anche nella definizione della teoria della dimostrazione.inizione della teoria della dimostrazione. , In mathematical logic, a conservative exteIn mathematical logic, a conservative extension is a supertheory of a theory which is often convenient for proving theorems, but proves no new theorems about the language of the original theory. Similarly, a non-conservative extension is a supertheory which is not conservative, and can prove more theorems than the original. More formally stated, a theory is a (proof theoretic) conservative extension of a theory if every theorem of is a theorem of , and any theorem of in the language of is already a theorem of . An extension which is not conservative may be called a proper extension.ervative may be called a proper extension.
rdfs:label Estensione conservativa , 保守扩展 , 보존적 확장 , Extension conservatrice , Conservative extension
hide properties that link here 
http://dbpedia.org/resource/Non-conservative_extension + http://dbpedia.org/ontology/wikiPageRedirects
http://dbpedia.org/resource/Ordered_pair + , http://dbpedia.org/resource/Von_Neumann%E2%80%93Bernays%E2%80%93G%C3%B6del_set_theory + , http://dbpedia.org/resource/List_of_mathematical_logic_topics + , http://dbpedia.org/resource/Morse%E2%80%93Kelley_set_theory + , http://dbpedia.org/resource/Zermelo%E2%80%93Fraenkel_set_theory + , http://dbpedia.org/resource/Non-classical_logic + , http://dbpedia.org/resource/Friedman_translation + , http://dbpedia.org/resource/Absoluteness + , http://dbpedia.org/resource/Extension_by_definitions + , http://dbpedia.org/resource/Extension_by_new_constant_and_function_names + , http://dbpedia.org/resource/Axiom + , http://dbpedia.org/resource/Ackermann_set_theory + , http://dbpedia.org/resource/Internal_set_theory + , http://dbpedia.org/resource/%CE%A9-consistent_theory + , http://dbpedia.org/resource/Hilbert_system + , http://dbpedia.org/resource/Class_%28set_theory%29 + , http://dbpedia.org/resource/Finitism + , http://dbpedia.org/resource/Criticism_of_nonstandard_analysis + , http://dbpedia.org/resource/Computability_logic + , http://dbpedia.org/resource/Quine%E2%80%93Putnam_indispensability_argument + , http://dbpedia.org/resource/Ontology_%28information_science%29 + , http://dbpedia.org/resource/Axiom_of_global_choice + , http://dbpedia.org/resource/Philosophy_of_mathematics + , http://dbpedia.org/resource/OptimJ + , http://dbpedia.org/resource/Double-negation_translation + , http://dbpedia.org/resource/Q0_%28mathematical_logic%29 + , http://dbpedia.org/resource/Dependence_logic + , http://dbpedia.org/resource/Slicing_the_Truth + , http://dbpedia.org/resource/Non-conservative_extension + , http://dbpedia.org/resource/Proper_extension + http://dbpedia.org/ontology/wikiPageWikiLink
http://en.wikipedia.org/wiki/Conservative_extension + http://xmlns.com/foaf/0.1/primaryTopic
http://dbpedia.org/resource/Conservative_extension + owl:sameAs
 

 

Enter the name of the page to start semantic browsing from.