fbpx
Wikipedia

Extension by definitions

In mathematical logic, more specifically in the proof theory of first-order theories, extensions by definitions formalize the introduction of new symbols by means of a definition. For example, it is common in naive set theory to introduce a symbol for the set that has no member. In the formal setting of first-order theories, this can be done by adding to the theory a new constant and the new axiom , meaning "for all x, x is not a member of ". 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 a conservative extension of the old one.

Definition of relation symbols edit

Let   be a first-order theory and   a formula of   such that  , ...,   are distinct and include the variables free in  . Form a new first-order theory   from   by adding a new  -ary relation symbol  , the logical axioms featuring the symbol   and the new axiom

 ,

called the defining axiom of  .

If   is a formula of  , let   be the formula of   obtained from   by replacing any occurrence of   by   (changing the bound variables in   if necessary so that the variables occurring in the   are not bound in  ). Then the following hold:

  1.   is provable in  , and
  2.   is a conservative extension of  .

The fact that   is a conservative extension of   shows that the defining axiom of   cannot be used to prove new theorems. The formula   is called a translation of   into  . Semantically, the formula   has the same meaning as  , but the defined symbol   has been eliminated.

Definition of function symbols edit

Let   be a first-order theory (with equality) and   a formula of   such that  ,  , ...,   are distinct and include the variables free in  . Assume that we can prove

 

in  , i.e. for all  , ...,  , there exists a unique y such that  . Form a new first-order theory   from   by adding a new  -ary function symbol  , the logical axioms featuring the symbol   and the new axiom

 ,

called the defining axiom of  .

Let   be any atomic formula of  . We define formula   of   recursively as follows. If the new symbol   does not occur in  , let   be  . Otherwise, choose an occurrence of   in   such that   does not occur in the terms  , and let   be obtained from   by replacing that occurrence by a new variable  . Then since   occurs in   one less time than in  , the formula   has already been defined, and we let   be

 

(changing the bound variables in   if necessary so that the variables occurring in the   are not bound in  ). For a general formula  , the formula   is formed by replacing every occurrence of an atomic subformula   by  . Then the following hold:

  1.   is provable in  , and
  2.   is a conservative extension of  .

The formula   is called a translation of   into  . As in the case of relation symbols, the formula   has the same meaning as  , but the new symbol   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 theory   obtained from   by successive introductions of relation symbols and function symbols as above is called an extension by definitions of  . Then   is a conservative extension of  , and for any formula   of   we can form a formula   of  , called a translation of   into  , such that   is provable in  . Such a formula is not unique, but any two of them can be proved to be equivalent in T.

In practice, an extension by definitions   of T is not distinguished from the original theory T. In fact, the formulas of   can be thought of as abbreviating their translations into T. 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 theory ZF has   (equality) and   (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  , the constant  , the unary function symbol P (the power set operation), etc. All of these symbols belong in fact to extensions by definitions of ZF.
  • Let   be a first-order theory for groups in which the only primitive symbol is the binary product ×. In T, we can prove that there exists a unique element y such that x×y = y×x = x for every x. Therefore we can add to T a new constant e and the axiom
 ,
and what we obtain is an extension by definitions   of  . Then in   we can prove that for every x, there exists a unique y such that x×y=y×x=e. Consequently, the first-order theory   obtained from   by adding a unary function symbol   and the axiom
 
is an extension by definitions of  . Usually,   is denoted  .

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)

extension, definitions, mathematical, logic, more, specifically, proof, theory, first, order, theories, extensions, definitions, formalize, introduction, symbols, means, definition, example, common, naive, theory, introduce, symbol, displaystyle, emptyset, tha. In mathematical logic more specifically in the proof theory of first order theories extensions by definitions formalize the introduction of new symbols by means of a definition For example it is common in naive set theory to introduce a symbol displaystyle emptyset for the set 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 new axiom x x displaystyle forall x x notin emptyset meaning for all x 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 a conservative extension of the old one Contents 1 Definition of relation symbols 2 Definition of function symbols 3 Extensions by definitions 4 Examples 5 See also 6 BibliographyDefinition of relation symbols editLet T displaystyle T nbsp be a first order theory and ϕ x1 xn displaystyle phi x 1 dots x n nbsp a formula of T displaystyle T nbsp such that x1 displaystyle x 1 nbsp xn displaystyle x n nbsp are distinct and include the variables free in ϕ x1 xn displaystyle phi x 1 dots x n nbsp Form a new first order theory T displaystyle T nbsp from T displaystyle T nbsp by adding a new n displaystyle n nbsp ary relation symbol R displaystyle R nbsp the logical axioms featuring the symbol R displaystyle R nbsp and the new axiom x1 xn 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 nbsp called the defining axiom of R displaystyle R nbsp If ps displaystyle psi nbsp is a formula of T displaystyle T nbsp let ps displaystyle psi ast nbsp be the formula of T displaystyle T nbsp obtained from ps displaystyle psi nbsp by replacing any occurrence of R t1 tn displaystyle R t 1 dots t n nbsp by ϕ t1 tn displaystyle phi t 1 dots t n nbsp changing the bound variables in ϕ displaystyle phi nbsp if necessary so that the variables occurring in the ti displaystyle t i nbsp are not bound in ϕ t1 tn displaystyle phi t 1 dots t n nbsp Then the following hold ps ps displaystyle psi leftrightarrow psi ast nbsp is provable in T displaystyle T nbsp and T displaystyle T nbsp is a conservative extension of T displaystyle T nbsp The fact that T displaystyle T nbsp is a conservative extension of T displaystyle T nbsp shows that the defining axiom of R displaystyle R nbsp cannot be used to prove new theorems The formula ps displaystyle psi ast nbsp is called a translation of ps displaystyle psi nbsp into T displaystyle T nbsp Semantically the formula ps displaystyle psi ast nbsp has the same meaning as ps displaystyle psi nbsp but the defined symbol R displaystyle R nbsp has been eliminated Definition of function symbols editLet T displaystyle T nbsp be a first order theory with equality and ϕ y x1 xn displaystyle phi y x 1 dots x n nbsp a formula of T displaystyle T nbsp such that y displaystyle y nbsp x1 displaystyle x 1 nbsp xn displaystyle x n nbsp are distinct and include the variables free in ϕ y x1 xn displaystyle phi y x 1 dots x n nbsp Assume that we can prove x1 xn yϕ y x1 xn displaystyle forall x 1 dots forall x n exists y phi y x 1 dots x n nbsp in T displaystyle T nbsp i e for all x1 displaystyle x 1 nbsp xn displaystyle x n nbsp there exists a unique y such that ϕ y x1 xn displaystyle phi y x 1 dots x n nbsp Form a new first order theory T displaystyle T nbsp from T displaystyle T nbsp by adding a new n displaystyle n nbsp ary function symbol f displaystyle f nbsp the logical axioms featuring the symbol f displaystyle f nbsp and the new axiom x1 xnϕ 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 nbsp called the defining axiom of f displaystyle f nbsp Let ps displaystyle psi nbsp be any atomic formula of T displaystyle T nbsp We define formula ps displaystyle psi ast nbsp of T displaystyle T nbsp recursively as follows If the new symbol f displaystyle f nbsp does not occur in ps displaystyle psi nbsp let ps displaystyle psi ast nbsp be ps displaystyle psi nbsp Otherwise choose an occurrence of f t1 tn displaystyle f t 1 dots t n nbsp in ps displaystyle psi nbsp such that f displaystyle f nbsp does not occur in the terms ti displaystyle t i nbsp and let x displaystyle chi nbsp be obtained from ps displaystyle psi nbsp by replacing that occurrence by a new variable z displaystyle z nbsp Then since f displaystyle f nbsp occurs in x displaystyle chi nbsp one less time than in ps displaystyle psi nbsp the formula x displaystyle chi ast nbsp has already been defined and we let ps displaystyle psi ast nbsp be z ϕ z t1 tn x displaystyle forall z phi z t 1 dots t n rightarrow chi ast nbsp changing the bound variables in ϕ displaystyle phi nbsp if necessary so that the variables occurring in the ti displaystyle t i nbsp are not bound in ϕ z t1 tn displaystyle phi z t 1 dots t n nbsp For a general formula ps displaystyle psi nbsp the formula ps displaystyle psi ast nbsp is formed by replacing every occurrence of an atomic subformula x displaystyle chi nbsp by x displaystyle chi ast nbsp Then the following hold ps ps displaystyle psi leftrightarrow psi ast nbsp is provable in T displaystyle T nbsp and T displaystyle T nbsp is a conservative extension of T displaystyle T nbsp The formula ps displaystyle psi ast nbsp is called a translation of ps displaystyle psi nbsp into T displaystyle T nbsp As in the case of relation symbols the formula ps displaystyle psi ast nbsp has the same meaning as ps displaystyle psi nbsp but the new symbol f displaystyle f nbsp has been eliminated The construction of this paragraph also works for constants which can be viewed as 0 ary function symbols Extensions by definitions editA first order theory T displaystyle T nbsp obtained from T displaystyle T nbsp by successive introductions of relation symbols and function symbols as above is called an extension by definitions of T displaystyle T nbsp Then T displaystyle T nbsp is a conservative extension of T displaystyle T nbsp and for any formula ps displaystyle psi nbsp of T displaystyle T nbsp we can form a formula ps displaystyle psi ast nbsp of T displaystyle T nbsp called a translation of ps displaystyle psi nbsp into T displaystyle T nbsp such that ps ps displaystyle psi leftrightarrow psi ast nbsp is provable in T displaystyle T nbsp Such a formula is not unique but any two of them can be proved to be equivalent in T In practice an extension by definitions T displaystyle T nbsp of T is not distinguished from the original theory T In fact the formulas of T displaystyle T nbsp can be thought of as abbreviating their translations into T The manipulation of these abbreviations as actual formulas is then justified by the fact that extensions by definitions are conservative Examples editTraditionally the first order set theory ZF has displaystyle nbsp equality and displaystyle in nbsp 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 nbsp the constant displaystyle emptyset nbsp the unary function symbol P the power set operation etc All of these symbols belong in fact to extensions by definitions of ZF Let T displaystyle T nbsp be a first order theory for groups in which the only primitive symbol is the binary product In T we can prove that there exists a unique element y such that x y y x x for every x Therefore we can add to T a new constant e and the axiom x x e x and e x x displaystyle forall x x times e x text and e times x x nbsp dd and what we obtain is an extension by definitions T displaystyle T nbsp of T displaystyle T nbsp Then in T displaystyle T nbsp we can prove that for every x there exists a unique y such that x y y x e Consequently the first order theory T displaystyle T nbsp obtained from T displaystyle T nbsp by adding a unary function symbol f displaystyle f nbsp and the axiom x x f x e and f x x e displaystyle forall x x times f x e text and f x times x e nbsp dd is an extension by definitions of T displaystyle T nbsp Usually f x displaystyle f x nbsp is denoted x 1 displaystyle x 1 nbsp See also editConservative extension Extension by new constant and function namesBibliography editS C Kleene 1952 Introduction to Metamathematics D Van Nostrand E Mendelson 1997 Introduction to Mathematical Logic 4th ed Chapman amp Hall J R Shoenfield 1967 Mathematical Logic Addison Wesley Publishing Company reprinted in 2001 by AK Peters Retrieved from https en wikipedia org w index php title Extension by definitions amp oldid 1131384108, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.