344 search results - page 23 / 69 » Some Theorems We Should Prove |
LPAR
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
FAC
2008
13 years 7 months ago
2008
This paper presents a formal model and a systematic approach to the validation of communication tures at a high level of abstraction. This model is described mathematically by a fu...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
IFIP
2004
Springer
14 years 22 days ago
2004
Springer
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...
MLQ
2010
13 years 5 months ago
2010
: It is well known that, in a topological space, the open sets can be characterized using filter convergence. In ZF (Zermelo-Fraenkel set theory without the Axiom of Choice), we c...