5084 search results - page 45 / 1017 » Proving Possibility Properties |
TCS
2010
13 years 8 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
ISCAS
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract— This paper derives a novel property of the secondorder modes of discrete-time systems under variable transformation. This is the generalization of the theory presented ...
ECOOPW
1999
Springer
14 years 2 months ago
1999
Springer
This paper formalizes the folklore result that strongly-typed applets are more secure than untyped ones. We formulate and prove several security properties that all well-typed app...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
In this work we study the asymptotic traffic behaviour for Gromov's hyperbolic networks as the size of the network increases. We prove that under certain mild hypothesis the t...
DM
2006
13 years 10 months ago
2006
Let n be a positive integer. A tournament is called n-existentially closed (or n-e.c.) if for every subset S of n vertices and for every subset T of S, there is a vertex x / S whi...