Sciweavers

3047 search results - page 21 / 610
» On the Meaning of Logical Completeness
Sort
View
CSFW
2003
IEEE
14 years 1 months ago
Understanding SPKI/SDSI Using First-Order Logic
SPKI/SDSI is a language for expressing distributed access control policy, derived from SPKI and SDSI. We provide a first-order logic (FOL) semantics for SDSI, and show that it ha...
Ninghui Li, John C. Mitchell
ACSAC
2004
IEEE
14 years 5 days ago
Detecting Attacks That Exploit Application-Logic Errors Through Application-Level Auditing
Host security is achieved by securing both the operating system kernel and the privileged applications that run on top of it. Application-level bugs are more frequent than kernel-...
Jingyu Zhou, Giovanni Vigna
AIML
2008
13 years 10 months ago
Completeness of the finitary Moss logic
We give a sound and complete derivation system for the valid formulas in the finitary version of Moss' coalgebraic logic, for coalgebras of arbitrary type.
Clemens Kupke, Alexander Kurz, Yde Venema
LFCS
2007
Springer
14 years 2 months ago
Density Elimination and Rational Completeness for First-Order Logics
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
Agata Ciabattoni, George Metcalfe
JSYML
2010
107views more  JSYML 2010»
13 years 6 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov