1101 search results - page 86 / 221 » Forcing in proof theory |
116
click to vote
SIAMCOMP
2008
15 years 15 days ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
177
Voted
TPHOL
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract. We give an overview of Agda, the latest in a series of dependently typed programming languages developed in Gothenburg. Agda is based on Martin-L¨of’s intuitionistic t...
AUSAI
2003
Springer
15 years 5 months ago
2003
Springer
Most of the theories on formalising intention interpret it as a unary modal operator in Kripkean semantics, which gives it a monotonic look. We argue that policy-based intentions [...
106
click to vote
COCOON
1995
Springer
15 years 4 months ago
1995
Springer
A Craig interpolant of two inconsistent theories is a formula which is true in one and false in the other. This paper gives an eificient method for constructing a Craig interpolant...
84
Voted
APAL
2008
15 years 22 days ago
2008
We show that an existentially closed CSA -group is not superstable. We prove that a non-abelian superstable CSA-group has an infinite definable simple subgroup all of whose proper...