DocumentCode
3223293
Title
On definability of order in logic with choice
Author
Huuskonen, T. ; Hyttinen, Tapani
Author_Institution
Dept. of Math., Helsinki Univ., Finland
fYear
2001
fDate
2001
Firstpage
167
Lastpage
172
Abstract
We will answer questions due to Blass and Gurevich (2000) on definability of order in the first-order logic with Hilbert´s epsilon operation. We show that a linear ordering is almost surely definable in models with random choice
Keywords
formal logic; definability of order; epsilon operation; first-order logic; linear ordering; random choice; Automata; Context modeling; Logic programming; Mathematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 2001. Proceedings. 16th Annual IEEE Symposium on
Conference_Location
Boston, MA
ISSN
1043-6871
Print_ISBN
0-7695-1281-X
Type
conf
DOI
10.1109/LICS.2001.932493
Filename
932493
Link To Document