Two procedures for computing closures in binary partial algebras (BPA) are introduced: a Fibonacci-style procedure for closures in associative BPAs, and a multistage procedure for closures in associative, commutative and idempotent BPAs. Ramifications in areas such as resolution theorem proving, graph-theoretic algorithms, formal languages and formal concept analysis are discussed. In particula...

Fluid reductions of the Vlasov–Ampère equations that preserve the Hamiltonian structure of the parent kinetic model are investigated. Hamiltonian closures using the first four moments of the Vlasov distribution are obtained, and all closures provided by a dimensional analysis procedure for satisfying the Jacobi identity are found. Two Hamiltonian models emerge, for which the explicit closures a...

The rise in the incidence of care home closures over recent years has been the subject of considerable public concern. This summary describes the results of a Department of Health funded research project investigating the causes, process and consequences of closures of care homes for older people. The research aims of this first stage of the study were to identify the: rates of closures nationa...

A description in the Jacobs and Langen domain is a set of sharing groups where each sharing group is a set of program variables. The presence of a sharing group in a description indicates that all the variables in the group can be bound to terms that contain a common variable. The expressiveness of the domain, alas, is compromised by its intractability. Not only are descriptions potentially exp...