1950 search results - page 24 / 390 » Lambda-Free Logical Frameworks |
CSFW
2008
IEEE
15 years 4 months ago
2008
IEEE
We present an authorization logic that permits reasoning with explicit time. Following a proof-theoretic approach, we study the meta-theory of the logic, including cut elimination...
JVA
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a natural deduction calculus for the computation tree logic CTL defined with the full set of classical and temporal logic operators. The system extends the natural ded...
LOGCOM
2010
14 years 8 months ago
2010
Abstract. An approximate Herbrand theorem is established for firstorder infinite-valued Lukasiewicz Logic and used to obtain a proof-theoretic proof of Skolemization. These resul...
TCS
2011
14 years 4 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
RULEML
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we evolve a rule based approach to SLA representation and management which allows separating the contractual business logic from the application logic and enables aut...