On Decidability of the Theory <i>Th(u, 0,1,<, +, f</i><sub><i></i></sub><sub><i>0</i></sub><i></i><i>,..., f</i><sub><i></i></sub><sub><i>n</i></sub><i></i><i>)</i>
In the paper we consider theories which are obtained from the Semenov arithmetics introducing functions fi,i > 0. They are called "hyperfuncctions" and they are obtained when we iterate an addition-connexctexd function. We have provexl, that such theories are model complete. It is also...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2010-09-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1041 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
