Sciweavers

344 search results - page 20 / 69
» Some Theorems We Should Prove
Sort
View
MLQ
2007
116views more  MLQ 2007»
13 years 6 months ago
Local sentences and Mahlo cardinals
Local sentences were introduced by Ressayre in [Res88] who proved certain remarkable stretching theorems establishing the equivalence between the existence of finite models for t...
Olivier Finkel, Stevo Todorcevic
CRYPTO
2007
Springer
116views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Random Oracles and Auxiliary Input
We introduce a variant of the random oracle model where oracle-dependent auxiliary input is allowed. In this setting, the adversary gets an auxiliary input that can contain informa...
Dominique Unruh
IFIP
2004
Springer
14 years 22 days ago
Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
Chung-Chih Li
CSL
2001
Springer
13 years 12 months ago
The Anatomy of Innocence
We reveal a symmetric structure in the ho/n games model of innocent strategies, introducing rigid strategies, a concept dual to bracketed strategies. We prove a direct definabilit...
Vincent Danos, Russell Harmer
ENTCS
2002
109views more  ENTCS 2002»
13 years 7 months ago
Induction, Coinduction, and Adjoints
We investigate the reasons for which the existence of certain right adjoints implies the existence of some final coalgebras, and vice-versa. In particular we prove and discuss the...
J. Robin B. Cockett, Luigi Santocanale