All spacetimes for an irrotational collisionless uid with a purely electric Weyl tensor, with spacetime curvature determined by the exact Einstein eld equations, are shown to be integrable. These solutions include the relativistic generalisations of the Zeldovich solutions of Newtonian theory. Thus our result shows the consistency of various studies of "silent" universes (where such consistency...

We reconsider the class of weighted Kalai-Smorodinsky solutions of Dubra (2001), and using methods of Imai (1983), extend their characterization to the domain of multilateral bargaining problems. Aside from standard axioms in the literature, this result involves a new property that weakens the axiom Bilateral Consistency (Lensberg, 1988), by making the notion of consistency dependent on how ide...

This paper shows that the proof complexity (minimum computational complexity of proving formally or asymptotically) of \P 6=NP" is super-polynomial-time with respect to a theory T , which is a consistent extension of Peano Arithmetic (PA), and PTM-!-consistent, where the PTM-!-consistency is a polynomial-time Turing machine (PTM) version of !consistency. In other words, to prove \P 6=NP" (by an...

Strong replica consistency models ensure that the data delivered by a replica always includes the latest updates, although this may result in poor response times. On the other hand, weak replica consistency models provide quicker access to information, but do not usually provide guarantees about the degree of staleness in the data they deliver. In order to support emerging distributed applicati...

The logic underlying our current interpretations of all first-order formal languages—which provide the formal foundations for all computing languages—is Aristotle’s logic of predicates. I review Rosser’s claim that Gödel’s reasoning can be recast to arrive at his intended result without the assumption of ω-consistency, since Rosser’s argument appeals to a fundamental tenet of this logic, namely...

In this paper we show that the problem of checking consistency of a knowledge base in the Description Logic ALCM is ExpTime-complete. The M stands for meta-modelling as defined by Motz, Rohrer and Severi. To show our main result, we define an ExpTime Tableau algorithm as an extension of an algorithm for checking consistency of a knowledge base in ALC by Nguyen and Szalas.

Distributed file storage services (DFSS) such as Dropbox, iCloud, SkyDrive, or Google Drive, offer a filesystem interface to a distributed data store. DFSS usually differ in the consistency level they provide for concurrent accesses: a client might access a cached version of a file, see the immediate results of all prior operations, or temporarily observe an inconsistent state. The selection of...