fbpx
Wikipedia

Extension by new constant and function names

In mathematical logic, a theory can be extended with new constants or function names under certain conditions with assurance that the extension will introduce no contradiction. Extension by definitions is perhaps the best-known approach, but it requires unique existence of an object with the desired property. Addition of new names can also be done safely without uniqueness.

Suppose that a closed formula

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

and adding a new axiom

.

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

Such a theory can also be conservatively extended by introducing a new functional symbol:[1]

Suppose that a closed formula is a theorem of a first-order theory , where we denote . Let be a theory obtained from by extending its language with a new functional symbol (of arity ) and adding a new axiom . Then is a conservative extension of , i.e. the theories and prove the same theorems not involving the functional symbol ).

Shoenfield states the theorem in the form for a new function name, and constants are the same as functions of zero arguments. In formal systems that admit ordered tuples, extension by multiple constants as shown here can be accomplished by addition of a new constant tuple and the new constant names having the values of elements of the tuple.

See also edit

References edit

  1. ^ Shoenfield, Joseph (1967). Mathematical Logic. Addison-Wesley. pp. 55–56.

extension, constant, function, names, mathematical, logic, theory, extended, with, constants, function, names, under, certain, conditions, with, assurance, that, extension, will, introduce, contradiction, extension, definitions, perhaps, best, known, approach,. In mathematical logic a theory can be extended with new constants or function names under certain conditions with assurance that the extension will introduce no contradiction Extension by definitions is perhaps the best known approach but it requires unique existence of an object with the desired property Addition of new names can also be done safely without uniqueness Suppose that a closed formula x 1 x m f x 1 x m displaystyle exists x 1 ldots exists x m varphi x 1 ldots x m is a theorem of a first order theory T displaystyle T Let T 1 displaystyle T 1 be a theory obtained from T displaystyle T by extending its language with new constants a 1 a m displaystyle a 1 ldots a m and adding a new axiom f a 1 a m displaystyle varphi a 1 ldots a m Then T 1 displaystyle T 1 is a conservative extension of T displaystyle T which means that the theory T 1 displaystyle T 1 has the same set of theorems in the original language i e without constants a i displaystyle a i as the theory T displaystyle T Such a theory can also be conservatively extended by introducing a new functional symbol 1 Suppose that a closed formula x y f y x displaystyle forall vec x exists y varphi y vec x is a theorem of a first order theory T displaystyle T where we denote x x 1 x n displaystyle vec x x 1 ldots x n Let T 1 displaystyle T 1 be a theory obtained from T displaystyle T by extending its language with a new functional symbol f displaystyle f of arity n displaystyle n and adding a new axiom x f f x x displaystyle forall vec x varphi f vec x vec x Then T 1 displaystyle T 1 is a conservative extension of T displaystyle T i e the theories T displaystyle T and T 1 displaystyle T 1 prove the same theorems not involving the functional symbol f displaystyle f Shoenfield states the theorem in the form for a new function name and constants are the same as functions of zero arguments In formal systems that admit ordered tuples extension by multiple constants as shown here can be accomplished by addition of a new constant tuple and the new constant names having the values of elements of the tuple See also editConservative extension Extension by definitionReferences edit Shoenfield Joseph 1967 Mathematical Logic Addison Wesley pp 55 56 nbsp This logic related article is a stub You can help Wikipedia by expanding it vte nbsp This mathematical logic related article is a stub You can help Wikipedia by expanding it vte Retrieved from https en wikipedia org w index php title Extension by new constant and function names amp oldid 1131388209, 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.