It is commonly believed that collision protocols are impractical for very fast bus networks, owing to the constraints on the minimum packet length. In this paper, we present two collision protocols that contradict this opinion. These protocols are two representatives of the so-called Piggyback Ethernet family. They incur no synchronisa-tion overhead under very light load, and under heavy traac ...

We describe a logic which is the same as first-order logic except that it allows control over the information that passes down from formulas to subformulas. For example the logic is adequate to express branching quantifiers. We describe a compositional semantics for this logic; in particular this gives a compositional meaning to formulas of the ‘information-friendly’ language of Hintikka and Sa...

A second order section such as the above can be realized in a number of ways; the one of concern here is the socalled 1-D form (see Reference 3). The second order 1-D form is shown in Figure 2. Based on this figure, we can obtain the following equations: m(k) e x(k) b B1 c m(k b 1) b B2 c m(k b 2) y(k) e A0 c m(k) a A1 c m(k b 1) a A2 c m(k b 2) Define T1 e bB1 c m(k b 1) b B2 c m(k b 2), T2 e ...

We study pfaffian analogues of immanants, which we call pfaffinants. Our main object is the TL-pfaffinants which are analogues of Rhoades and Skandera’s TL-immanants. We show that TL-pfaffinants are positive when applied to planar networks and explain how to decompose products of complementary pfaffians in terms of TL-pfaffinants. We conjecture in addition that TL-pfaffinants have positivity pr...

Relation were invented by Tarski and his collaborators in the middle of the twentieth century. The concept of integrality arose naturally early in the history of the subject, and so did various constructions of finite integral relation algebras. Later the concept of finite-dimensionality was introduced for classifying nonrepresentable relation algebras. This concept is closely connected to the ...

Quantification theory, or first-order predicate logic, can be formulated in terms purely of predicate letters and a few predicate functors which attach t o predicates to form further predicates. Apart from the predicate letters, which are schematic, there are no variables. On this score the plan is reminiscent of the combinatory logic of Schonfinkel and Curry. Theirs, however, had the whole of ...