Sciweavers

1670 search results - page 4 / 334
» On Skolemization in constructive theories
Sort
View
ENTCS
2011
99views more  ENTCS 2011»
13 years 1 months ago
Symmetry and Composition in Probabilistic Theories
The past decade has seen a remarkable resurgence of the old programme of finding more or less a priori axioms for the mathematical framework of quantum mechanics. The new impetus...
Alexander Wilce
TIT
2011
169views more  TIT 2011»
13 years 1 months ago
Network Coding Theory Via Commutative Algebra
—The fundamental result of linear network coding asserts the existence of optimal codes over acyclic networks when the symbol field is sufficiently large. The restriction to just...
Shuo-Yen Robert Li, Qifu Tyler Sun
JUCS
2010
95views more  JUCS 2010»
13 years 1 months ago
Realisability for Induction and Coinduction with Applications to Constructive Analysis
Abstract: We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped -calcul...
Ulrich Berger
IJNSEC
2010
105views more  IJNSEC 2010»
13 years 1 months ago
A Note on the Constructions of Orthomorphic Permutations
Orthomorphic permutations have important applications in the design of block ciphers. A practical algorithm is derived to generate all orthomorphic permutations over Fm 2 , and it...
Jianqin Zhou
BIRTHDAY
2009
Springer
14 years 1 months ago
No i-Sums for Nissim (and Shalom)
Lappin and Francez (1994) present a theory of donkey anaphora which, they claim, captures both their existential and their universal readings, while maintaining a uniform represent...
Itamar Francez