Infinite Lexicographic Products

We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define dense substructures in infinite products and show that any countable product of countable transitive homogeneous structures has a unique countable dense substructure, up to isomorphism. Furthermore, this dense substructure is transitive, homogeneous and elementarily embeds into the product. This result is then utilized to construct a rigid elementarily indivisible structure.Comment: 20 pages, 3 figure

The externally definable Ramsey property and fixed points on type spaces

We discuss the externally definable Ramsey property, a weakening of the Ramsey property for ultrahomogeneous structures, where the only colourings considered are those that are externally definable: that is, definable with parameters in an elementary extension. We show a number of basic results analogous to the classical Ramsey theory, and show that, for an ultrahomogeneous structure M, the externally definable Ramsey property is equivalent to the dynamical statement that, for each natural number n, every subflow of the space of n-types with parameters in M has a fixed point. We discuss a range of examples, including results regarding the lexicographic product of structures.Comment: 42 pages, 1 figur

Communication in concurrent dynamic logic

AbstractCommunication mechanisms are introduced into the program schemes of Concurrent Dynamic Logic, on both the propositional and the first-order levels. The effects of these mechanisms (particularly, channels, shared variables, and “message collectors”) on issues of expressiveness and decidability are investigated. In general, we find that both respects are dominated by the extent to which the capabilities of synchronization and (unbounded counting are enabled in the communication scheme

Generalised Indiscernibles, Dividing Lines, and Products of Structures

Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a reduct of an ultrahomogenous $\aleph_0$-categorical structure which has higher arity than the original structure cannot be Ramsey. In particular, the only nontrivial Ramsey reduct of the generically ordered random $k$-hypergraph is the linear order. We then turn our attention to model-theoretic dividing lines that are characterised by collapsing generalised indiscernibles, and prove, for these dividing lines, several transfer principles in (full and lexicographic) products of structures. As an application, we construct new algorithmically tame classes of graphs

Invariant types in model theory

We study how the product of global invariant types interacts with the preorder of domination, i.e. semi-isolation by a small type, and the induced equivalence relation, domination-equivalence. We provide sufficient conditions for the latter to be a congruence with respect to the product, and show that this holds in various classes of theories. In this case, we develop a general theory of the quotient semigroup, the domination monoid, and carry out its computation in several cases of interest. Notably, we reduce its study in o-minimal theories to proving generation by 1-types, and completely characterise it in the case of Real Closed Fields. We also provide a full characterisation for the theory of dense meet-trees, and moreover show that the domination monoid is well-defined in certain expansions of it by binary relations. We give an example of a theory where the domination monoid is not commutative, and of one where it is not well-defined, correcting some overly general claims in the literature. We show that definability, finite satisfiability, generic stability, and weak orthogonality to a fixed type are all preserved downwards by domination, hence are domination-equivalence invariants. We study the dependence on the choice of monster model of the quotient of the space of global invariant types by domination-equivalence, and show that if the latter does not depend on the former then the theory under examination is NIP

MFCS\u2798 Satellite Workshop on Cellular Automata

For the 1998 conference on Mathematical Foundations of Computer Science (MFCS\u2798) four papers on Cellular Automata were accepted as regular MFCS\u2798 contributions. Furthermore an MFCS\u2798 satellite workshop on Cellular Automata was organized with ten additional talks. The embedding of the workshop into the conference with its participants coming from a broad spectrum of fields of work lead to interesting discussions and a fruitful exchange of ideas. The contributions which had been accepted for MFCS\u2798 itself may be found in the conference proceedings, edited by L. Brim, J. Gruska and J. Zlatuska, Springer LNCS 1450. All other (invited and regular) papers of the workshop are contained in this technical report. (One paper, for which no postscript file of the full paper is available, is only included in the printed version of the report). Contents: F. Blanchard, E. Formenti, P. Kurka: Cellular automata in the Cantor, Besicovitch and Weyl Spaces K. Kobayashi: On Time Optimal Solutions of the Two-Dimensional Firing Squad Synchronization Problem L. Margara: Topological Mixing and Denseness of Periodic Orbits for Linear Cellular Automata over Z_m B. Martin: A Geometrical Hierarchy of Graph via Cellular Automata K. Morita, K. Imai: Number-Conserving Reversible Cellular Automata and Their Computation-Universality C. Nichitiu, E. Remila: Simulations of graph automata K. Svozil: Is the world a machine? H. Umeo: Cellular Algorithms with 1-bit Inter-Cell Communications F. Reischle, Th. Worsch: Simulations between alternating CA, alternating TM and circuit families K. Sutner: Computation Theory of Cellular Automat

Interpreting quantum nonlocality as platonic information

The "hidden variables" or "guiding equation" explanation for the measurement of quantum nonlocality (entanglement) effects can be interpreted as instantiation of Platonic information. Because these Bohm-deBroglie principles are already external to the material objects that they theoretically affect, interpreting them as Platonic is feasible. Taking an approach partially suggested by Quantum Information Theory which views quantum phenomena as sometimes observable-measurable information, this thesis defines hidden variables/guiding equation as information. This approach enables us to bridge the divide between the abstract Platonic realm and the physical world. The unobservable quantum wavefunction collapse is interpreted as Platonic instantiation. At each interaction, the wave function for a quantum system collapses. Instantly, Platonic information is instantiated in the system