Sciweavers

ENTCS
2010
119views more  ENTCS 2010»
13 years 3 months ago
A Tableau Method for Checking Rule Admissibility in S4
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...
FOSSACS
2008
Springer
13 years 5 months ago
A Modal Deconstruction of Access Control Logics
We present a translation from a logic of access control with a "says" operator to the classical modal logic S4. We prove that the translation is sound and complete. We al...
Deepak Garg, Martín Abadi
KGC
1993
Springer
13 years 7 months ago
Nonmonotonic Reasoning is Sometimes Simpler
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
Grigori Schwarz, Miroslaw Truszczynski
CSR
2010
Springer
13 years 8 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
LFCS
2007
Springer
13 years 9 months ago
The Intensional Lambda Calculus
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
Sergei N. Artëmov, Eduardo Bonelli