Simple structures axiomatized by almost sure theories

In this article we give a classification of the binary, simple, $\omega$-categorical structures with SU-rank 1 and trivial pregeometry. This is done both by showing that they satisfy certain extension properties, but also by noting that they may be approximated by the almost sure theory of some sets of finite structures equipped with a probability measure. This study give results about general almost sure theories, but also considers certain attributes which, if they are almost surely true, generate almost sure theories with very specific properties such as $\omega$-stability or strong minimality.Comment: 27 page

Process algebra for performance evaluation

This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined by a random variable. A huge class of resource-sharing systems – like large-scale computers, client–server architectures, networks – can accurately be described using such stochastic specification formalisms. The main emphasis of this paper is the treatment of operational semantics, notions of equivalence, and (sound and complete) axiomatisations of these equivalences for different types of Markovian process algebras, where delays are governed by exponential distributions. Starting from a simple actionless algebra for describing time-homogeneous continuous-time Markov chains, we consider the integration of actions and random delays both as a single entity (like in known Markovian process algebras like TIPP, PEPA and EMPA) and as separate entities (like in the timed process algebras timed CSP and TCCS). In total we consider four related calculi and investigate their relationship to existing Markovian process algebras. We also briefly indicate how one can profit from the separation of time and actions when incorporating more general, non-Markovian distributions

Laver and set theory

In this commemorative article, the work of Richard Laver is surveyed in its full range and extent.Accepted manuscrip

The Basic Laws of Cardinal Number

An overview of what Frege accomplishes in Part II of Grundgesetze, which contains proofs of axioms for arithmetic and several additional results concerning the finite, the infinite, and the relationship between these notions. One might think of this paper as an extremely compressed form of Part II of my book Reading Frege's Grundgesetze

Existentially closed fields with G-derivations

We prove that the theories of fields with Hasse-Schmidt derivations corresponding to actions of formal groups admit model companions. We also give geometric axiomatizations of these model companions.Comment: In version 2: new proof of (the current) Proposition 3.3