Modely aritmetických a bohatých teorií
In the present thesis we study the domain of Peano products (in a given model of the Presburger arithmetic (Pr)) as a potentially possible base for a construction of models of the Peano arithmetic (PA). This issue is a special case of the presentation problem which is closely connected to the concep...
Main Author: | |
---|---|
Other Authors: | |
Format: | Dissertation |
Language: | Czech |
Published: |
2009
|
Online Access: | http://www.nusl.cz/ntk/nusl-277566 |
id |
ndltd-nusl.cz-oai-invenio.nusl.cz-277566 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-nusl.cz-oai-invenio.nusl.cz-2775662017-06-27T04:40:03Z Modely aritmetických a bohatých teorií Models of arithmetic and rich theories Vopěnka, Petr Glivický, Petr Mlček, Josef In the present thesis we study the domain of Peano products (in a given model of the Presburger arithmetic (Pr)) as a potentially possible base for a construction of models of the Peano arithmetic (PA). This issue is a special case of the presentation problem which is closely connected to the concept of rich theories. We are especially concerned with one of the basic questions about Peano products domain, i.e. if there exist a pair of Peano products (· , ) such that these products coincide in some slice a: (x)(a · x = a x) and are different below a: (c, d < a)(c · d 6= c d). We reduce this problem to the question if the eliminating set of formulas of the linear arithmetic (LA) is a subset of the set of all existential formulas. We do not solve this problem completely, we only prove that all formulas (x)(z1, z2) , where is a conjunction of equations of terms, are equivalent to existential formulas. We also suggest that the quantifier elimination in the linear arithmetic is considerably more difficult than the elimination in Pr or in the module theory and that it is connected to the problem of description of finitely generated submonoids of Z. We introduce concepts (regular set, standard rationality, saw,... ) and methods which, as we believe, will be essential for an eventual solution of the problem. 2009 info:eu-repo/semantics/masterThesis http://www.nusl.cz/ntk/nusl-277566 cze info:eu-repo/semantics/restrictedAccess |
collection |
NDLTD |
language |
Czech |
format |
Dissertation |
sources |
NDLTD |
description |
In the present thesis we study the domain of Peano products (in a given model of the Presburger arithmetic (Pr)) as a potentially possible base for a construction of models of the Peano arithmetic (PA). This issue is a special case of the presentation problem which is closely connected to the concept of rich theories. We are especially concerned with one of the basic questions about Peano products domain, i.e. if there exist a pair of Peano products (· , ) such that these products coincide in some slice a: (x)(a · x = a x) and are different below a: (c, d < a)(c · d 6= c d). We reduce this problem to the question if the eliminating set of formulas of the linear arithmetic (LA) is a subset of the set of all existential formulas. We do not solve this problem completely, we only prove that all formulas (x)(z1, z2) , where is a conjunction of equations of terms, are equivalent to existential formulas. We also suggest that the quantifier elimination in the linear arithmetic is considerably more difficult than the elimination in Pr or in the module theory and that it is connected to the problem of description of finitely generated submonoids of Z. We introduce concepts (regular set, standard rationality, saw,... ) and methods which, as we believe, will be essential for an eventual solution of the problem. |
author2 |
Vopěnka, Petr |
author_facet |
Vopěnka, Petr Glivický, Petr |
author |
Glivický, Petr |
spellingShingle |
Glivický, Petr Modely aritmetických a bohatých teorií |
author_sort |
Glivický, Petr |
title |
Modely aritmetických a bohatých teorií |
title_short |
Modely aritmetických a bohatých teorií |
title_full |
Modely aritmetických a bohatých teorií |
title_fullStr |
Modely aritmetických a bohatých teorií |
title_full_unstemmed |
Modely aritmetických a bohatých teorií |
title_sort |
modely aritmetických a bohatých teorií |
publishDate |
2009 |
url |
http://www.nusl.cz/ntk/nusl-277566 |
work_keys_str_mv |
AT glivickypetr modelyaritmetickychabohatychteorii AT glivickypetr modelsofarithmeticandrichtheories |
_version_ |
1718468368648896512 |