3552 search results - page 233 / 711 » Proof theory in the abstract |
138
click to vote
EATCS
2000
15 years 6 months ago
2000
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
175
click to vote
CACM
2010
15 years 4 months ago
2010
Certified software consists of a machine-executable program plus a formal machine-checkable proof that the software is free of bugs with respect to a claim of dependability. The c...
181
click to vote
CTCS
1987
Springer
15 years 10 months ago
1987
Springer
of this paper is to prevent the abstract data type researcher from an improper, naive use of category theory. We mainly emphasize some unpleasant properties of the synthesis funct...
204
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
142
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...