290 search results - page 5 / 58 » Logical Properties of Name Restriction |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...
JCO
2008
13 years 7 months ago
2008
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
TCS
2010
13 years 6 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...
ENTCS
2011
13 years 2 months ago
2011
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to...
APAL
2007
13 years 7 months ago
2007
I modify the standard coverage construction of the reals to obtain the irrationals. However, this causes a jump in ordinal complexity from ω + 1 to Ω. The coverage technique ha...