Logic in Computer Science (LICS 2001)

Paper: On Definability of Order in Logic with Choice (at LICS 2001)

Authors: Taneli Huuskonen Tapani Hyttinen

Abstract

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.

BibTeX

  @InProceedings{HuuskonenHyttinen-OnDefinabilityofOrd,
    author = 	 {Taneli Huuskonen and Tapani Hyttinen},
    title = 	 {On Definability of Order in Logic with Choice},
    booktitle =  {Proceedings of the Sixteenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 2001},
    year =	 2001,
    editor =	 {Joseph Halpern},
    month =	 {June}, 
    pages =      {167--176},
    location =   {Boston, MA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }