Mimic function

From formulasearchengine
Revision as of 21:25, 19 October 2010 by en>FrescoBot (Bot: links syntax)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In mathematical logic, the conservativity theorem states the following: Suppose that a closed formula

∃x1…∃xmφ(x1,…,xm)

is a theorem of a first-order theory T. Let T1 be a theory obtained from T by extending its language with new constants

a1,…,am

and adding a new axiom

φ(a1,…,am).

Then T1 is a conservative extension of T, which means that the theory T1 has the same set of theorems in the original language (i.e., without constants ai) as the theory T.

In a more general setting, the conservativity theorem is formulated for extensions of a first-order theory by introducing a new functional symbol:

Suppose that a closed formula ∀y→∃xφ(x,y→) is a theorem of a first-order theory T, where we denote y→:=(y1,…,yn). Let T1 be a theory obtained from T by extending its language with new functional symbol f (of arity n) and adding a new axiom ∀y→φ(f(y→),y→). Then T1 is a conservative extension of T, i.e. the theories T and T1 prove the same theorems not involving the functional symbol f).

References

  • Elliott Mendelson (1997). Introduction to Mathematical Logic (4th ed.) Chapman & Hall.
  • J.R. Shoenfield (1967). Mathematical Logic. Addison-Wesley Publishing Company.

Template:Logic-stub Template:Mathlogic-stub