Sciweavers

3047 search results - page 112 / 610
» On the Meaning of Logical Completeness
Sort
View
FSS
2010
112views more  FSS 2010»
13 years 9 months ago
Fuzzy sets and geometric logic
H¨ohle has identified fuzzy sets, valued in a frame (complete Heyting algebra) Ω, with certain sheaves over Ω: the subsheaves of constant sheaves More general sheaves can be...
Steven Vickers
FORMATS
2008
Springer
14 years 21 days ago
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover...
Alexander Rabinovich
CSFW
2006
IEEE
14 years 5 months ago
Non-Interference in Constructive Authorization Logic
We present a constructive authorization logic where the meanings of connectives are defined by their associated inference rules. This ensures that the logical reading of access c...
Deepak Garg, Frank Pfenning
AMAST
2006
Springer
14 years 2 months ago
Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic
This paper proposes a modal extension of Separation Logic [8, 11] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logi...
Susumu Nishimura
CORR
2010
Springer
158views Education» more  CORR 2010»
13 years 11 months ago
A Minimal Propositional Type Theory
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...
Mark Kaminski, Gert Smolka