TWO RESULTS ABOUT THE RATIONAL NUMBERS

被引：0
|
作者：
Prunescu, Mihai [1 ,2 ]
机构：
[1] Univ Bucharest, Fac Math & Informat, Bucharest, Romania
[2] Romanian Acad, Simion Stoilow Inst Math, Res Unit 5,POB 1-764, RO-014700 Bucharest, Romania
来源：
REVUE ROUMAINE DE MATHEMATIQUES PURES ET APPLIQUEES | 2021年 / 66卷 / 3-4期
关键词：
exponential diophantine equations; rational numbers; decision problems; undecidability; choice; densely ordered sets; order topology; continuous functions; roots; N-0-categorical theories;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In the first part we show that the exponential diophantine problem for Q is algorithmically undecidable. The second part studies the question about a continuous approximation function for the square root in the rationals, in the larger context of continuous choice functions for generic predicates.
引用
收藏
页码：789 / 792
页数：4
相关论文
共 50 条
12345