835 search results - page 43 / 167 » Geometric Logic in Computer Science |
ENTCS
2007
14 years 9 months ago
2007
This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is a...
TCS
2011
14 years 4 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
DRUMS
1998
Springer
15 years 2 months ago
1998
Springer
In this paper logical techniques developed to formalise the analysis of multi-interpretable information, in particular belief set operators and selection operators, are applied to...
RTA
1998
Springer
15 years 2 months ago
1998
Springer
We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the fragment of i...
RELMICS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We introduce an implication-with-possible-exceptions and define validity of rules-withpossible-exceptions by means of the topological notion of a full subset. Our implica...