A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
We study the notion of weak dividing introduced by S. Shelah. In particular we prove that T is stable iff weak dividing is symmetric. In order to study simple theories Shelah orig...
: Addressing new public challenges such as the one-stop government and improved service quality, we introduce serviceflow management as a generic concept to coordinate cross-organi...
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
Gueorgi Kossinets, Jon M. Kleinberg, Duncan J. Wat...