Preliminary Remarks

'The Governance of Complexity and the Complexity of Governance: Preliminary Remarks on some Problems and Limits of Economic Guidance'

• you should observe the conventions of academic citation in a version of the following form: Bob Jessop, 'The Governance of Complexity and the Complexity of Governance: Preliminary Remarks on some Problems and Limits of Economic Guidance', published by the Department of Sociology, Lancaster University, Lancaster LA1 4YN, at http://www.comp.lancs.ac.uk/sociology/papers/Jessop-Governance-ofCompl...

1.1. Preliminary Remarks and the Integrals of the First Group …

SOME REMARKS ON ALMOST UNISERIAL RINGS AND MODULES

In this paper we study almost uniserial rings and modules. An R−module M is called almost uniserial if any two nonisomorphic submodules are linearly ordered by inclusion. A ring R is an almost left uniserial ring if R_R is almost uniserial. We give some necessary and sufficient condition for an Artinian ring to be almost left uniserial.

Remarks on Distance-Balanced Graphs

Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.

Remarks on Recursion vs. Diagonalization

Results are presented which show precise ways in which recursion rests on very simple computational bases which do not support diagonalization. A method based on recursion and making no use of diagonalization is given for proving lower bounds on computational complexity. Thus the intractability of computational problems such as Presburger arithmetic does not depend on diagonalization. This rese...