Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Extension by definition

From Wikipedia, the free encyclopedia
(Redirected fromExtension by definitions)
In logic, defining a new symbol

Inmathematical logic, more specifically in theproof theory offirst-order theories, anextension by definition formalizes the introduction of a new symbol by means of adefinition. For example, it is common in naiveset theory to introduce a symbol{\displaystyle \emptyset } for theset that has no member. In the formal setting of first-order theories, this can be done by adding to the theory a new constant{\displaystyle \emptyset } and the newaxiomx(x){\displaystyle \forall x(x\notin \emptyset )}, meaning "for allx,x is not a member of{\displaystyle \emptyset }". It can then be proved that doing so adds essentially nothing to the old theory, as should be expected from a definition. More precisely, the new theory is aconservative extension of the old one.

Definition of relation symbols

[edit]

LetT{\displaystyle T} be afirst-order theory andϕ(x1,,xn){\displaystyle \phi (x_{1},\dots ,x_{n})} aformula ofT{\displaystyle T} such thatx1{\displaystyle x_{1}}, ...,xn{\displaystyle x_{n}} are distinct and include the variablesfree inϕ(x1,,xn){\displaystyle \phi (x_{1},\dots ,x_{n})}. Form a new first-order theoryT{\displaystyle T'} fromT{\displaystyle T} by adding a newn{\displaystyle n}-ary relation symbolR{\displaystyle R}, thelogical axioms featuring the symbolR{\displaystyle R} and the new axiom

x1xn(R(x1,,xn)ϕ(x1,,xn)){\displaystyle \forall x_{1}\dots \forall x_{n}(R(x_{1},\dots ,x_{n})\leftrightarrow \phi (x_{1},\dots ,x_{n}))},

called thedefining axiom ofR{\displaystyle R}.

Ifψ{\displaystyle \psi } is a formula ofT{\displaystyle T'}, letψ{\displaystyle \psi ^{\ast }} be the formula ofT{\displaystyle T} obtained fromψ{\displaystyle \psi } by replacing any occurrence ofR(t1,,tn){\displaystyle R(t_{1},\dots ,t_{n})} byϕ(t1,,tn){\displaystyle \phi (t_{1},\dots ,t_{n})} (changing thebound variables inϕ{\displaystyle \phi } if necessary so that the variables occurring in theti{\displaystyle t_{i}} are not bound inϕ(t1,,tn){\displaystyle \phi (t_{1},\dots ,t_{n})}). Then the following hold:

  1. ψψ{\displaystyle \psi \leftrightarrow \psi ^{\ast }} is provable inT{\displaystyle T'}, and
  2. T{\displaystyle T'} is aconservative extension ofT{\displaystyle T}.

The fact thatT{\displaystyle T'} is a conservative extension ofT{\displaystyle T} shows that the defining axiom ofR{\displaystyle R} cannot be used to prove new theorems. The formulaψ{\displaystyle \psi ^{\ast }} is called atranslation ofψ{\displaystyle \psi } intoT{\displaystyle T}. Semantically, the formulaψ{\displaystyle \psi ^{\ast }} has the same meaning asψ{\displaystyle \psi }, but the defined symbolR{\displaystyle R} has been eliminated.

Definition of function symbols

[edit]

LetT{\displaystyle T} be a first-order theory (with equality) andϕ(y,x1,,xn){\displaystyle \phi (y,x_{1},\dots ,x_{n})} a formula ofT{\displaystyle T} such thaty{\displaystyle y},x1{\displaystyle x_{1}}, ...,xn{\displaystyle x_{n}} are distinct and include the variables free inϕ(y,x1,,xn){\displaystyle \phi (y,x_{1},\dots ,x_{n})}. Assume that we can prove

x1xn!yϕ(y,x1,,xn){\displaystyle \forall x_{1}\dots \forall x_{n}\exists !y\phi (y,x_{1},\dots ,x_{n})}

inT{\displaystyle T}, i.e. for allx1{\displaystyle x_{1}}, ...,xn{\displaystyle x_{n}}, there exists a uniquey such thatϕ(y,x1,,xn){\displaystyle \phi (y,x_{1},\dots ,x_{n})}. Form a new first-order theoryT{\displaystyle T'} fromT{\displaystyle T} by adding a newn{\displaystyle n}-aryfunction symbolf{\displaystyle f}, the logical axioms featuring the symbolf{\displaystyle f} and the new axiom

x1xnϕ(f(x1,,xn),x1,,xn){\displaystyle \forall x_{1}\dots \forall x_{n}\phi (f(x_{1},\dots ,x_{n}),x_{1},\dots ,x_{n})},

called thedefining axiom off{\displaystyle f}.

Letψ{\displaystyle \psi } be any atomic formula ofT{\displaystyle T'}. We define formulaψ{\displaystyle \psi ^{\ast }} ofT{\displaystyle T} recursively as follows. If the new symbolf{\displaystyle f} does not occur inψ{\displaystyle \psi }, letψ{\displaystyle \psi ^{\ast }} beψ{\displaystyle \psi }. Otherwise, choose an occurrence off(t1,,tn){\displaystyle f(t_{1},\dots ,t_{n})} inψ{\displaystyle \psi } such thatf{\displaystyle f} does not occur in the termsti{\displaystyle t_{i}}, and letχ{\displaystyle \chi } be obtained fromψ{\displaystyle \psi } by replacing that occurrence by a new variablez{\displaystyle z}. Then sincef{\displaystyle f} occurs inχ{\displaystyle \chi } one less time than inψ{\displaystyle \psi }, the formulaχ{\displaystyle \chi ^{\ast }} has already been defined, and we letψ{\displaystyle \psi ^{\ast }} be

z(ϕ(z,t1,,tn)χ){\displaystyle \forall z(\phi (z,t_{1},\dots ,t_{n})\rightarrow \chi ^{\ast })}

(changing the bound variables inϕ{\displaystyle \phi } if necessary so that the variables occurring in theti{\displaystyle t_{i}} are not bound inϕ(z,t1,,tn){\displaystyle \phi (z,t_{1},\dots ,t_{n})}). For a general formulaψ{\displaystyle \psi }, the formulaψ{\displaystyle \psi ^{\ast }} is formed by replacing every occurrence of an atomic subformulaχ{\displaystyle \chi } byχ{\displaystyle \chi ^{\ast }}. Then the following hold:

  1. ψψ{\displaystyle \psi \leftrightarrow \psi ^{\ast }} is provable inT{\displaystyle T'}, and
  2. T{\displaystyle T'} is aconservative extension ofT{\displaystyle T}.

The formulaψ{\displaystyle \psi ^{\ast }} is called atranslation ofψ{\displaystyle \psi } intoT{\displaystyle T}. As in the case of relation symbols, the formulaψ{\displaystyle \psi ^{\ast }} has the same meaning asψ{\displaystyle \psi }, but the new symbolf{\displaystyle f} has been eliminated.

The construction of this paragraph also works for constants, which can be viewed as 0-ary function symbols.

Extensions by definitions

[edit]

A first-order theoryT{\displaystyle T'} obtained fromT{\displaystyle T} by successive introductions of relation symbols and function symbols as above is called anextension by definitions ofT{\displaystyle T}. ThenT{\displaystyle T'} is a conservative extension ofT{\displaystyle T}, and for any formulaψ{\displaystyle \psi } ofT{\displaystyle T'} we can form a formulaψ{\displaystyle \psi ^{\ast }} ofT{\displaystyle T}, called atranslation ofψ{\displaystyle \psi } intoT{\displaystyle T}, such thatψψ{\displaystyle \psi \leftrightarrow \psi ^{\ast }} is provable inT{\displaystyle T'}. Such a formula is not unique, but any two of them can be proved to be equivalent inT.

In practice, an extension by definitionsT{\displaystyle T'} ofT is not distinguished from the original theoryT. In fact, the formulas ofT{\displaystyle T'} can be thought of asabbreviating their translations intoT. The manipulation of these abbreviations as actual formulas is then justified by the fact that extensions by definitions are conservative.

Examples

[edit]
  • Traditionally, the first-order set theoryZF has={\displaystyle =} (equality) and{\displaystyle \in } (membership) as its only primitive relation symbols, and no function symbols. In everyday mathematics, however, many other symbols are used such as the binary relation symbol{\displaystyle \subseteq }, the constant{\displaystyle \emptyset }, the unary function symbolP (thepower set operation), etc. All of these symbols belong in fact to extensions by definitions of ZF.
  • LetT{\displaystyle T} be a first-order theory forgroups in which the only primitive symbol is the binary product ×. InT, we can prove that there exists a unique elementy such thatx × y =y × x =x for everyx. Therefore we can add toT a new constante and the axiom
x(x×e=xe×x=x){\displaystyle \forall x(x\times e=x\land e\times x=x)},
and what we obtain is an extension by definitionsT{\displaystyle T'} ofT{\displaystyle T}. Then inT{\displaystyle T'} we can prove that for everyx, there exists a uniquey such thatx × y =y × x =e. Consequently, the first-order theoryT{\displaystyle T''} obtained fromT{\displaystyle T'} by adding a unary function symbolf{\displaystyle f} and the axiom
x(x×f(x)=ef(x)×x=e){\displaystyle \forall x(x\times f(x)=e\land f(x)\times x=e)}
is an extension by definitions ofT{\displaystyle T}. Usually,f(x){\displaystyle f(x)} is denotedx1{\displaystyle x^{-1}}.

See also

[edit]

Bibliography

[edit]
  • S. C. Kleene (1952),Introduction to Metamathematics, D. Van Nostrand
  • E. Mendelson (1997).Introduction to Mathematical Logic (4th ed.), Chapman & Hall.
  • J. R. Shoenfield (1967).Mathematical Logic, Addison-Wesley Publishing Company (reprinted in 2001 by AK Peters)
General
Theorems (list)
 and paradoxes
Logics
Traditional
Propositional
Predicate
Set theory
Types ofsets
Maps and cardinality
Set theories
Formal systems (list),
language and syntax
Example axiomatic
systems
 (list)
Proof theory
Model theory
Computability theory
Related
Retrieved from "https://en.wikipedia.org/w/index.php?title=Extension_by_definition&oldid=1323409954"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp