69 research outputs found
Selected Topics in Gravity, Field Theory and Quantum Mechanics
Quantum field theory has achieved some extraordinary successes over the past sixty years; however, it retains a set of challenging problems. It is not yet able to describe gravity in a mathematically consistent manner. CP violation remains unexplained. Grand unified theories have been eliminated by experiment, and a viable unification model has yet to replace them. Even the highly successful quantum chromodynamics, despite significant computational achievements, struggles to provide theoretical insight into the low-energy regime of quark physics, where the nature and structure of hadrons are determined. The only proposal for resolving the fine-tuning problem, low-energy supersymmetry, has been eliminated by results from the LHC. Since mathematics is the true and proper language for quantitative physical models, we expect new mathematical constructions to provide insight into physical phenomena and fresh approaches for building physical theories
Complexity of equational theory of relational algebras with standard projection elements
The class of t rue p airing a lgebras is defined to be the class of relation algebras expanded with concrete set theoretical projection functions. The main results of the present paper is that neither the equational theory of nor the first order theory of are decidable. Moreover, we show that the set of all equations valid in is exactly on the level. We consider the class of the relation algebra reducts of ’s, as well. We prove that the equational theory of is much simpler, namely, it is recursively enumerable. We also give motivation for our results and some connections to related work
Algebras of partial functions
This thesis collects together four sets of results, produced by investigating modifications, in four distinct directions, of the following. Some set-theoretic operations on partial functions are chosen—composition and intersection are examples—and the class of algebras isomorphic to a collection of partial functions, equipped with those operations, is studied. Typical questions asked are whether the class is axiomatisable, or indeed finitely axiomatisable, in any fragment of first-order logic, what computational complexity classes its equational/quasiequational/first-order theories lie in, and whether it is decidable if a finite algebra is in the class. The first modification to the basic picture asks that the isomorphisms turn any existing suprema into unions and/or infima into intersections, and examines the class so obtained. For composition, intersection, and antidomain together, we show that the suprema and infima conditions are equivalent. We show the resulting class is axiomatisable by a universal-existential-universal sentence, but not axiomatisable by any existential-universal-existential theory. The second contribution concerns what happens when we demand partial functions on some finite base set. The finite representation property is essentially the assertion that this restriction that the base set be finite does not restrict the algebras themselves. For composition, intersection, domain, and range, plus many supersignatures, we prove the finite representation property. It follows that it is decidable whether a finite algebra is a member of the relevant class. The third set of results generalises from unary to ‘multiplace’ functions. For the signatures investigated, finite equational or quasiequational axiomatisations are obtained; similarly when the functions are constrained to be injective. The finite representation property follows. The equational theories are shown to be coNP-complete. In the last section we consider operations that may only be partial. For most signatures the relevant class is found to be recursively, but not finitely, axiomatisable. For others, finite axiomatisations are provided
- …