Sciweavers

1321 search results - page 38 / 265
» Subtyping in Logical Form
Sort
View
JSYML
2007
88views more  JSYML 2007»
14 years 11 months ago
The basic intuitionistic logic of proofs
The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete ...
Sergei N. Artëmov, Rosalie Iemhoff
CADE
2006
Springer
16 years 4 days ago
On Keys and Functional Dependencies as First-Class Citizens in Description Logics
We investigate whether identification constraints such as keys and functional dependencies can be granted full status as a concept constructor in a Boolean-complete description log...
David Toman, Grant E. Weddell
ICALP
2005
Springer
15 years 5 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
ATAL
2008
Springer
15 years 1 months ago
Coalitions and announcements
Two currently active strands of research on logics for multi-agent systems are dynamic epistemic logic, focusing on the epistemic consequences of actions, and logics of coalitiona...
Thomas Ågotnes, Hans P. van Ditmarsch
CSR
2010
Springer
15 years 4 months ago
Prehistoric Phenomena and Self-referentiality
By terms-allowed-in-types capacity, the Logic of Proofs LP includes formulas of the form t : Ï•(t), which have self-referential meanings. In this paper, “prehistoric phenomenaâ€...
Junhua Yu