Неповнота арифметики і теорія діофантових множин
Analysis of Diophantine sets showed that all recursively enumerated sets are Diophantine. Based on the classical results in the theory of computable functions, a simple version of the theorem on the incompleteness of arithmetic can be given: there is a polynomial that does not have positive integer...
Saved in:
| Date: | 2023 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
Інститут прикладних проблем механіки і математики ім. Я. С. Підстригача НАН України
2023
|
| Subjects: | |
| Online Access: | https://www.fmmit.lviv.ua/index.php/fmmit/article/view/278 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Physico-mathematical modeling and informational technologies |
| Download file: |  |