2137 search results - page 37 / 428 » Proving Abstract Non-interference |
ICALP
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
JCT
2006
14 years 10 months ago
2006
Abstract. In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the maximum number of disjoint circuits and
LOGCOM
2008
14 years 10 months ago
2008
Abstract. Several concepts of algebras with solutions of recursive equation systems are compared: CPO-enrichable algebras are proved to be iteration algebras of Z.
AML
2002
14 years 9 months ago
2002
Abstract We extend Barbanera and Berardi's symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.
JSYML
2002
14 years 9 months ago
2002
Abstract. We prove some results related to the problem of blowing up the power set of the least measurable cardinal. Our forcing results improve those of [1] by using the optimal h...