Sciweavers

1486 search results - page 64 / 298
» A Logically Saturated Extension of
Sort
View
CSCW
2000
ACM
14 years 1 months ago
Composable collaboration infrastructures based on programming patterns
In general, collaboration infrastructures have supported sharing of an object based on its logical structure. However, current implementations assume an implicit binding between t...
Vassil Roussev, Prasun Dewan, Vibhor V. Jain
IGPL
2011
13 years 17 days ago
Generalized ordinal sums and translations
We extend the lattice embedding of the axiomatic extensions of the positive fragment of intuitionistic logic into the axiomatic extensions of intuitionistic logic to the setting of...
Nikolaos Galatos
CSFW
2004
IEEE
14 years 26 days ago
By Reason and Authority: A System for Authorization of Proof-Carrying Code
We present a system, BLF, that combines an authorization logic based on the Binder language with a logical framework, LF, able to express semantic properties of programs. BLF is a...
Nathan Whitehead, Martín Abadi, George C. N...
ENTCS
2008
79views more  ENTCS 2008»
13 years 9 months ago
The Compositional Method and Regular Reachability
The compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the model-checking problem for a product structure to the model-checking problem for its fact...
Ingo Felscher
APAL
2006
94views more  APAL 2006»
13 years 9 months ago
Classifiable theories without finitary invariants
: It follows directly from Shelah's structure theory that if T is a classifiable theory, then the isomorphism type of any model of T is determined by the theory of that model ...
Elisabeth Bouscaren, Ehud Hrushovski