378 search results - page 59 / 76 » Proof interpretations with truth |
LOGCOM
2002
13 years 7 months ago
2002
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
CP
2010
Springer
13 years 6 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
FSS
2010
13 years 6 months ago
2010
The paper considers an early approach toward a (fuzzy) set theory with a graded membership predicate and a graded equality relation which had been developed by the German mathemat...
JDA
2011
13 years 2 months ago
2011
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
FOSSACS
2012
Springer
12 years 3 months ago
2012
Springer
We study type-directed encodings of the simply-typed λ-calculus in a session-typed π-calculus. The translations proceed in two steps: standard embeddings of simply-typed λ-calcu...