1410 search results - page 189 / 282 » Proving theorems by reuse |
JSYML
2002
13 years 9 months ago
2002
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
MSCS
1998
13 years 9 months ago
1998
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
SIGMETRICS
2002
ACM
13 years 9 months ago
2002
ACM
This paper analyzes various algorithms for scheduling low priority disk drive tasks. The derived closed form solution is applicable to class of greedy algorithms that include a va...
SLOGICA
2002
13 years 9 months ago
2002
In [Sas01], it was given a cut-free sequent system for the smallest interpretability logic IL. He first gave a cut-free system for IK4, a sublogic of IL, whose -free fragment is th...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Protocol sequences are used in channel access for the multiple-access collision channel without feedback. A new construction of protocol sequences with a guarantee of worstcase sys...