611 search results - page 23 / 123 » Yuri, Logic, and Computer Science |
RTA
1999
Springer
15 years 4 months ago
1999
Springer
We present a modular proof of the strong normalisation of intuitionistic logic with permutation-conversions. This proof is based on the notions of negative translation and CPS-simu...
103
click to vote
ISIPTA
2005
IEEE
15 years 5 months ago
2005
IEEE
Logic and probability theory have both a long history in science. They are mainly rooted in philosophy and mathematics, but are nowadays important tools in many other fields such...
ICALP
2009
Springer
16 years 1 days ago
2009
Springer
CSR
2007
Springer
15 years 6 months ago
2007
Springer
t) Yuri Gurevich Microsoft Research The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had been defined...
125
click to vote
KSEM
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. In this paper, we compare merging operators in possibilistic logic. We first propose an approach to evaluating the discriminating power of a merging operator. After that...