611 search results - page 9 / 123 » Yuri, Logic, and Computer Science |
131
Voted
TCS
2008
15 years 5 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...
137
Voted
LICS
2003
IEEE
15 years 10 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...
122
click to vote
ACSC
2006
IEEE
15 years 9 months ago
2006
IEEE
We introduce a logic for reasoning about and constructing refinements for
127
Voted
BIRTHDAY
1997
Springer
15 years 9 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...
156
click to vote
FPGA
2009
ACM
16 years 2 days 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 ...