Sciweavers

3047 search results - page 153 / 610
» On the Meaning of Logical Completeness
Sort
View
NDJFL
1998
100views more  NDJFL 1998»
14 years 9 months ago
Failure of Interpolation in Combined Modal Logics
We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer...
Maarten Marx, Carlos Areces
FUIN
2007
108views more  FUIN 2007»
14 years 10 months ago
Local Properties of Triangular Graphs
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many ...
Antoni W. Mazurkiewicz
LICS
2008
IEEE
15 years 4 months ago
Structural Logical Relations
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
Carsten Schürmann, Jeffrey Sarnat
ICLP
2007
Springer
15 years 4 months ago
Core TuLiP Logic Programming for Trust Management
We propose CoreTuLiP - the core of a trust management language based on Logic Programming. CoreTuLiP is based on a subset of moded logic programming, but enjoys the features of TM ...
Marcin Czenko, Sandro Etalle
TLCA
2007
Springer
15 years 4 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva