11063 search results - page 94 / 2213 » On the existence of universal models |
CSL
2007
Springer
14 years 4 months ago
2007
Springer
We show how to extract classical programs expressed in Krivine λc-calculus from proof-terms built in a proof-irrelevant and classical version of the calculus of constructions with...
ELPUB
1999
ACM
14 years 2 months ago
1999
ACM
Project Runeberg has been publishing Nordic literature on the Internet since 1992. The project is based at Linköping University, Sweden. In the fall of 1998 a series of experimen...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
ICDT
2005
ACM
14 years 3 months ago
2005
ACM
d abstract) Foto Afrati1 and Rada Chirkova2 1 Electrical and Computing Eng., National Technical University of Athens, 157 73 Athens, Greece 2 Computer Science Department, North Car...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...