1894 search results - page 79 / 379 » A TLA Proof System |
112
click to vote
CORR
2010
Springer
15 years 25 days ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
126
Voted
TPHOL
2009
IEEE
15 years 7 months ago
2009
IEEE
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...
103
Voted
TLCA
2005
Springer
15 years 6 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
132
click to vote
CADE
2008
Springer
15 years 2 months ago
2008
Springer
It is well known how to use an intuitionistic meta-logic to specify natural deduction systems. It is also possible to use linear logic as a meta-logic for the specification of a va...
190
Voted
VLDB
2007
ACM
16 years 29 days ago
2007
ACM
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...