5084 search results - page 159 / 1017 » Proving Possibility Properties |
154
click to vote
APAL
2006
15 years 6 months ago
2006
We show that--unlike products of `transitive' modal logics which are usually undecidable-their `expanding domain' relativisations can be decidable, though not in primiti...
162
click to vote
CLEIEJ
2006
15 years 6 months ago
2006
This work presents a formal description of a subset of a C-like language in the form of an operational semantics. We give semantics to the following statements (presented in alpha...
105
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
An alternative generalisation of Hayman's concept of admissible functions to functions in several variables is developed and a multivariate asymptotic expansion for the coeff...
207
click to vote
JAR
2008
15 years 6 months ago
2008
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...
114
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— We prove several new bounds on ordered codes and ordered orthogonal arrays. We also show that the eigenvalues of the ordered Hamming scheme are the multivariable Krawtchouk pol...