On definability of order in logic with choice

被引：0
|
作者：
Huuskonen, T [1 ]
Hyttinen, T [1 ]
机构：
[1] Univ Helsinki, Dept Math, FIN-00014 Helsinki, Finland
来源：
16TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS | 2001年
关键词：
D O I：
10.1109/LICS.2001.932493
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We will answer questions due to A. Blass and Y. Gurevich on definability of order in the first-order logic with Hilbert's epsilon operation. E.g., we will show that a linear ordering is almost surely definable in models with random choice.
引用
收藏
页码：167 / 172
页数：6
相关论文
共 50 条
12345