Random l-colourable structures with a pregeometry

We study finite $l$-colourable structures with an underlying pregeometry. The probability measure that is used corresponds to a process of generating such structures (with a given underlying pregeometry) by which colours are first randomly assigned to all 1-dimensional subspaces and then relationships are assigned in such a way that the colouring conditions are satisfied but apart from this in a random way. We can then ask what the probability is that the resulting structure, where we now forget the specific colouring of the generating process, has a given property. With this measure we get the following results: 1. A zero-one law. 2. The set of sentences with asymptotic probability 1 has an explicit axiomatisation which is presented. 3. There is a formula $\xi(x,y)$ (not directly speaking about colours) such that, with asymptotic probability 1, the relation "there is an $l$-colouring which assigns the same colour to $x$ and $y$" is defined by $\xi(x,y)$. 4. With asymptotic probability 1, an $l$-colourable structure has a unique $l$-colouring (up to permutation of the colours).Comment: 35 page

Regular subspaces of a quaternionic Hilbert space from quaternionic Hermite polynomials and associated coherent states

We define quaternionic Hermite polynomials by analogy with two families of complex Hermite polynomials. As in the complex case, these polynomials consatitute orthogonal families of vectors in ambient quaternionic $L^2$-spaces. Using these polynomials, we then define regular and anti-regular subspaces of these $L^2$-spaces, the associated reproducing kernels and the ensuing quaternionic coherent states

Frameworks for logically classifying polynomial-time optimisation problems.

We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimisation problems, cannot hope to do so, under the assumption that P ≠ NP. We do this by exhibiting polynomially-bounded maximisation and minimisation problems that can be expressed in the framework but whose decision versions are NP-complete. We propose an alternative logical framework, based around inflationary fixed-point logic, and show that we can capture the above classes of optimisation problems. We use the inductive depth of an inflationary fixed-point as a means to describe the objective functions of the instances of our optimisation problems

Metal-to-insulator transition and magnetic ordering in CaRu_{1-x}Cu_xO_3

CaRuO_3 is perovskite with an orthorhombic distortion and is believed to be close to magnetic ordering. Magnetic studies of single crystal and polycrystalline CaRu_{1-x}Cu_xO_3 (0\le x \le 15 at.%Cu) reveal that spin-glass-like transition develops for x\le 7 at.%Cu and obtained value for effective magnetic moment p_{eff}=3.55 mu_B for x=5 at.% Cu, single crystal, indicates presence of Ru^{5+}. At higher Cu concentrations more complex magnetic behaviors are observed. Electrical resistivity measured on polycrystalline samples shows metal-to-insulator transition (MIT) at 51 K for only 2 at.% Cu. Charge compensation, which is assumed to be present upon Cu^{2+/3+} substitution, induces appearance of Ru^{5+} and/or creation of oxygen vacancies in crystal structure. Since the observed changes in physical properties are completely attributable to the charge compensation, they cannot be related to behaviors of pure compound where no such mechanism is present. This study provides the criterion for "good" chemical probes for studying Ru-based perovskites.Comment: 12 pages, 7 figure

Descriptive Complexity of Deterministic Polylogarithmic Time and Space

We propose logical characterizations of problems solvable in deterministic polylogarithmic time (PolylogTime) and polylogarithmic space (PolylogSpace). We introduce a novel two-sorted logic that separates the elements of the input domain from the bit positions needed to address these elements. We prove that the inflationary and partial fixed point vartiants of this logic capture PolylogTime and PolylogSpace, respectively. In the course of proving that our logic indeed captures PolylogTime on finite ordered structures, we introduce a variant of random-access Turing machines that can access the relations and functions of a structure directly. We investigate whether an explicit predicate for the ordering of the domain is needed in our PolylogTime logic. Finally, we present the open problem of finding an exact characterization of order-invariant queries in PolylogTime.Comment: Submitted to the Journal of Computer and System Science

Wakeful rest alleviates interference-based forgetting

Retroactive interference (RI)—the disruptive influence of events occurring after the formation of a new memory—is one of the primary causes of forgetting. Placing individuals within an environment that postpones interference should, therefore, greatly reduce the likelihood of information being lost from memory. For example, a short period of wakeful rest should diminish interference-based forgetting. To test this hypothesis, participants took part in a foreign language learning activity and were shown English translations of 20 Icelandic words for immediate recall. Half of the participants were then given an 8-min rest before completing a similar or dissimilar interfering distractor task. The other half did not receive a rest until after the distractor task, at which point interference had already taken place. All participants were then asked to translate the Icelandic words for a second time. Results revealed that retention was significantly worse at the second recall test, but being allowed a brief rest before completing the distractor task helped reduce the amount of forgetting. Taking a short, passive break can shield new memories from RI and alleviate forgetting.ERAS Scheme, University of Wolverhampto

Adding an Abstraction Barrier to ZF Set Theory

Much mathematical writing exists that is, explicitly or implicitly, based on set theory, often Zermelo-Fraenkel set theory (ZF) or one of its variants. In ZF, the domain of discourse contains only sets, and hence every mathematical object must be a set. Consequently, in ZF, with the usual encoding of an ordered pair ${\langle a, b\rangle}$, formulas like ${\{a\} \in \langle a, b \rangle}$ have truth values, and operations like ${\mathcal P (\langle a, b\rangle)}$ have results that are sets. Such 'accidental theorems' do not match how people think about the mathematics and also cause practical difficulties when using set theory in machine-assisted theorem proving. In contrast, in a number of proof assistants, mathematical objects and concepts can be built of type-theoretic stuff so that many mathematical objects can be, in essence, terms of an extended typed ${\lambda}$-calculus. However, dilemmas and frustration arise when formalizing mathematics in type theory. Motivated by problems of formalizing mathematics with (1) purely set-theoretic and (2) type-theoretic approaches, we explore an option with much of the flexibility of set theory and some of the useful features of type theory. We present ZFP: a modification of ZF that has ordered pairs as primitive, non-set objects. ZFP has a more natural and abstract axiomatic definition of ordered pairs free of any notion of representation. This paper presents axioms for ZFP, and a proof in ZF (machine-checked in Isabelle/ZF) of the existence of a model for ZFP, which implies that ZFP is consistent if ZF is. We discuss the approach used to add this abstraction barrier to ZF

Spontaneous symmetry breaking in a two-lane model for bidirectional overtaking traffic

First we consider a unidirectional flux \omega_bar of vehicles each of which is characterized by its `natural' velocity v drawn from a distribution P(v). The traffic flow is modeled as a collection of straight `world lines' in the time-space plane, with overtaking events represented by a fixed queuing time tau imposed on the overtaking vehicle. This geometrical model exhibits platoon formation and allows, among many other things, for the calculation of the effective average velocity w=\phi(v) of a vehicle of natural velocity v. Secondly, we extend the model to two opposite lanes, A and B. We argue that the queuing time \tau in one lane is determined by the traffic density in the opposite lane. On the basis of reasonable additional assumptions we establish a set of equations that couple the two lanes and can be solved numerically. It appears that above a critical value \omega_bar_c of the control parameter \omega_bar the symmetry between the lanes is spontaneously broken: there is a slow lane where long platoons form behind the slowest vehicles, and a fast lane where overtaking is easy due to the wide spacing between the platoons in the opposite direction. A variant of the model is studied in which the spatial vehicle density \rho_bar rather than the flux \omega_bar is the control parameter. Unequal fluxes \omega_bar_A and \omega_bar_B in the two lanes are also considered. The symmetry breaking phenomenon exhibited by this model, even though no doubt hard to observe in pure form in real-life traffic, nevertheless indicates a tendency of such traffic.Comment: 50 pages, 16 figures; extra references adde

Trees over Infinite Structures and Path Logics with Synchronization

We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the tree iteration of a relational structure M in the sense of Shelah-Stupp. In contrast to classical results where model-checking is shown decidable for MSO-logic, we show decidability of the tree model-checking problem for logics that allow only path quantifiers and chain quantifiers (where chains are subsets of paths), as they appear in branching time logics; however, at the same time the tree is enriched by the equal-level relation (which holds between vertices u, v if they are on the same tree level). We separate cleanly the tree logic from the logic used for expressing properties of the underlying structure M. We illustrate the scope of the decidability results by showing that two slight extensions of the framework lead to undecidability. In particular, this applies to the (stronger) tree iteration in the sense of Muchnik-Walukiewicz.Comment: In Proceedings INFINITY 2011, arXiv:1111.267

On the Expressivity and Applicability of Model Representation Formalisms

A number of first-order calculi employ an explicit model representation formalism for automated reasoning and for detecting satisfiability. Many of these formalisms can represent infinite Herbrand models. The first-order fragment of monadic, shallow, linear, Horn (MSLH) clauses, is such a formalism used in the approximation refinement calculus. Our first result is a finite model property for MSLH clause sets. Therefore, MSLH clause sets cannot represent models of clause sets with inherently infinite models. Through a translation to tree automata, we further show that this limitation also applies to the linear fragments of implicit generalizations, which is the formalism used in the model-evolution calculus, to atoms with disequality constraints, the formalisms used in the non-redundant clause learning calculus (NRCL), and to atoms with membership constraints, a formalism used for example in decision procedures for algebraic data types. Although these formalisms cannot represent models of clause sets with inherently infinite models, through an additional approximation step they can. This is our second main result. For clause sets including the definition of an equivalence relation with the help of an additional, novel approximation, called reflexive relation splitting, the approximation refinement calculus can automatically show satisfiability through the MSLH clause set formalism.Comment: 15 page