<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/w/index.php?action=history&amp;feed=atom&amp;title=Mimic_function</id>
	<title>Mimic function - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/w/index.php?action=history&amp;feed=atom&amp;title=Mimic_function"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Mimic_function&amp;action=history"/>
	<updated>2026-08-15T17:15:08Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Mimic_function&amp;diff=241324&amp;oldid=prev</id>
		<title>164.126.115.207: links</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Mimic_function&amp;diff=241324&amp;oldid=prev"/>
		<updated>2014-12-14T17:40:49Z</updated>

		<summary type="html">&lt;p&gt;links&lt;/p&gt;
&lt;a href=&quot;https://en.formulasearchengine.com/w/index.php?title=Mimic_function&amp;amp;diff=241324&amp;amp;oldid=10007&quot;&gt;Show changes&lt;/a&gt;</summary>
		<author><name>164.126.115.207</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Mimic_function&amp;diff=10007&amp;oldid=prev</id>
		<title>en&gt;FrescoBot: Bot: links syntax</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Mimic_function&amp;diff=10007&amp;oldid=prev"/>
		<updated>2010-10-19T19:25:16Z</updated>

		<summary type="html">&lt;p&gt;Bot: links syntax&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In [[mathematical logic]], the &amp;#039;&amp;#039;&amp;#039;conservativity theorem&amp;#039;&amp;#039;&amp;#039; states the following: Suppose that a &amp;#039;&amp;#039;closed&amp;#039;&amp;#039; formula &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\exists x_1\ldots\exists x_m\,\varphi(x_1,\ldots,x_m)&amp;lt;/math&amp;gt; &lt;br /&gt;
&lt;br /&gt;
is a theorem of a [[first-order theory]] &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt;. Let &amp;lt;math&amp;gt;T_1&amp;lt;/math&amp;gt; be a theory obtained from &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt; by extending its [[formal language|language]] with new constants &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;a_1,\ldots,a_m&amp;lt;/math&amp;gt; &lt;br /&gt;
&lt;br /&gt;
and adding a new [[axiom]] &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\varphi(a_1,\ldots,a_m)&amp;lt;/math&amp;gt;. &lt;br /&gt;
&lt;br /&gt;
Then &amp;lt;math&amp;gt;T_1&amp;lt;/math&amp;gt; is a [[conservative extension]] of &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt;, which means that the theory &amp;lt;math&amp;gt;T_1&amp;lt;/math&amp;gt; has the same set of theorems in the original language (i.e., without constants &amp;lt;math&amp;gt;a_i\,\!&amp;lt;/math&amp;gt;) as the theory &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
In a more general setting, the &amp;#039;&amp;#039;&amp;#039;conservativity theorem&amp;#039;&amp;#039;&amp;#039; is formulated for extensions of a first-order theory by introducing a new [[Functional predicate|functional symbol]]:&lt;br /&gt;
&lt;br /&gt;
:Suppose that a &amp;#039;&amp;#039;closed&amp;#039;&amp;#039; formula &amp;lt;math&amp;gt;\forall \vec{y}\,\exists x\,\!\,\varphi(x,\vec{y})&amp;lt;/math&amp;gt; is a theorem of a first-order theory &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt;, where we denote &amp;lt;math&amp;gt;\vec{y}:=(y_1,\ldots,y_n)&amp;lt;/math&amp;gt;. Let &amp;lt;math&amp;gt;T_1&amp;lt;/math&amp;gt; be a theory obtained from &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt; by extending its language with new functional symbol &amp;lt;math&amp;gt;f\,\!&amp;lt;/math&amp;gt; (of arity &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;) and adding a new axiom &amp;lt;math&amp;gt;\forall \vec{y}\,\varphi(f(\vec{y}),\vec{y})&amp;lt;/math&amp;gt;. Then &amp;lt;math&amp;gt;T_1&amp;lt;/math&amp;gt; is a [[conservative extension]] of &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt;, i.e. the theories &amp;lt;math&amp;gt;T&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;T_1&amp;lt;/math&amp;gt; prove the same theorems not involving the functional symbol &amp;lt;math&amp;gt;f\,\!&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
* Elliott Mendelson (1997). &amp;#039;&amp;#039;Introduction to Mathematical Logic&amp;#039;&amp;#039; (4th ed.) Chapman &amp;amp; Hall.&lt;br /&gt;
* J.R. Shoenfield (1967). &amp;#039;&amp;#039;Mathematical Logic&amp;#039;&amp;#039;. Addison-Wesley Publishing Company.&lt;br /&gt;
&lt;br /&gt;
{{logic-stub}}&lt;br /&gt;
[[Category:Mathematical logic]]&lt;br /&gt;
[[Category:Theorems in the foundations of mathematics]]&lt;br /&gt;
[[Category:Proof theory]]&lt;br /&gt;
{{mathlogic-stub}}&lt;/div&gt;</summary>
		<author><name>en&gt;FrescoBot</name></author>
	</entry>
</feed>