1101 search results - page 113 / 221 » Forcing in proof theory |
109
click to vote
CSFW
2010
IEEE
15 years 4 months ago
2010
IEEE
—Security protocol design is a creative discipline where the solution space depends on the problem to be solved and the cryptographic operators available. In this paper, we exami...
104
Voted
FMCAD
2006
Springer
15 years 4 months ago
2006
Springer
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
111
Voted
AAAI
1998
15 years 2 months ago
1998
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large e...
ENTCS
2008
15 years 23 days ago
2008
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
125
click to vote
ENTCS
2006
15 years 21 days ago
2006
In this paper we introduce a new approach to formalizing certain type operations in type theory. Traditionally, many type constructors in type theory are independently axiomatized...