611 search results - page 9 / 123 » Yuri, Logic, and Computer Science |
TCS
2008
14 years 9 months ago
2008
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
80
Voted
LICS
2003
IEEE
15 years 2 months ago
2003
IEEE
We establish the eventual periodicity of the spectrum of any monadic second-order formula where (i) all relation symbols, except equality, are unary, and (ii) there is only one fu...
ACSC
2006
IEEE
15 years 1 months ago
2006
IEEE
We introduce a logic for reasoning about and constructing refinements for
BIRTHDAY
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a rst-order sentence is preserved b...
85
Voted
FPGA
2009
ACM
15 years 4 months ago
2009
ACM
Many natural processes exhibit exponential decay and, consequently, computational scientists make extensive use of e−x in computer simulation experiments. While it is common to ...