Suction caissons are a new foundation option for offshore wind turbines. This thesis is focussed on the behaviour of suction caisson foundations in sand and in clay during installation, and under subsequent vertical and combined moment-lateral loadings. The research is based on extensive experimental work carried out using model scaled caissons. The analysis of the results allowed the determination of parameters for hyperplasticity models. Model caissons were vertically loaded in loose and dense sands to study in service states and plastic behaviour. Bearing capacity increased with the length of the caisson skirt. The bearing capacity formulation showed that the angle of friction mobilised was close to the critical state value for loose sands and close to those of peak values due to dilation for dense sands. The vertical load increased, though at a lower rate than during initial penetration, after large plastic displacements occurred. A hardening law formulation including this observed behaviour is suggested. In sand the installation of caissons by suction showed a drastic reduction in the net vertical load required to penetrate the caisson into the ground compared with that required to install caissons by pushing. This occurred due to the hydraulic gradients created by the suction. The theoretical formulations of the yield surface and flow rule were calibrated from the results of moment loading tests under low constant vertical loads. The fact that caissons exhibit moment capacity under tension loads was considered in the yield surface formulation. Results from symmetric and non symmetric cyclic moment loading tests showed that Masing’s rules were obeyed. Fully drained conditions, partially drained and undrained conditions were studied. Caisson rotation velocities scaled in the laboratory to represent those in the field induced undrained response for relevant periods of wave loading, a wide range of seabed permeabilities and prototype caisson dimensions. Under undrained conditions and low constant vertical loads the moment capacity of suction caissons was very small. Under partially drained conditions the moment capacity decreased with the increase of excess pore pressure. In clay, vertical cyclic loading around a mean vertical load of zero showed that in the short term the negative excess pore pressures generated during suction installation reduced vertical displacements. The yield surface and the flow rule were determined from moment swipe and constant vertical load tests. The moment capacity was found to depend on the ratio between the preload Vo and the ultimate bearing capacity Vu. Gapping response was observed during cyclic moment loading tests, but starting at smaller normalised rotations than in the field. The hysteresis loop shape obtained during gapping cannot be reproduced by means of the Masing’s rules.

In recent years the field of real numbers expanded by a multiplicative subgroup has been studied extensively. In this thesis, the known results will be extended to expansions of the real field. I will consider the structure R consisting of the field of real numbers and an irrational power function. Using Schanuel conditions, I will give a first-order axiomatization of expansions of R by a dense multiplicative subgroup which is a subset of the real algebraic numbers. It will be shown that every definable set in such a structure is a boolean combination of existentially definable sets and that these structures have o-minimal open core. A proof will be given that the Schanuel conditions used in proving these statements hold for co-countably many real numbers. The results mentioned above will also be established for expansions of R by dense multiplicative subgroups which are closed under all power functions definable in R. In this case the results hold under the assumption that the Conjecture on intersection with tori is true. Finally, the structure consisting of R and the discrete multiplicative subgroup 2^{Z} will be analyzed. It will be shown that this structure is not model complete. Further I develop a connection between the theory of Diophantine approximation and this structure.

The principal focus of this thesis is the study of the real numbers regarded as a structure endowed with its usual addition and multiplication and the operations of raising to real powers. For our first main result we prove that any statement in the language of this structure is equivalent to an existential statement, and furthermore that this existential statement can be chosen independently of the concrete interpretations of the real power functions in the statement; i.e. one existential statement will work for any choice of real power functions. This result we call uniform model completeness. For the second main result we introduce the first order theory of raising to an infinite power, which can be seen as the theory of a class of real closed fields, each expanded by a power function with infinite exponent. We note that it follows from the first main theorem that this theory is model-complete, furthermore we prove that it is decidable if and only if the theory of the real field with the exponential function is decidable. For the final main theorem we consider the problem of expanding an arbitrary o-minimal expansion of a field by a non-trivial exponential function whilst preserving o-minimality. We show that this can be done under the assumption that the structure already defines exponentiation on a bounded interval, and a further assumption about the prime model of the structure.

Borel determinacy states that if G(T;X) is a game and X is Borel, then G(T;X) is determined. Proved by Martin in 1975, Borel determinacy is a theorem of ZFC set theory, and is, in fact, the best determinacy result in ZFC. However, the proof uses sets of high set theoretic type (N1 many power sets of ω). Friedman proved in 1971 that these sets are necessary by showing that the Axiom of Replacement is necessary for any proof of Borel Determinacy. To prove this, Friedman produces a model of ZC and a Borel set of Turing degrees that neither contains nor omits a cone; so by another theorem of Martin, Borel Determinacy is not a theorem of ZC. This paper contains three main sections: Martin's proof of Borel Determinacy; a simpler example of Friedman's result, namely, (in ZFC) a coanalytic set of Turing degrees that neither contains nor omits a cone; and finally, the Friedman result.

This paper examines the mathematical properties of Sudoku puzzles defined on a Torus. We seek to answer the questions for these variants that have been explored for the traditional Sudoku. We do this process with two such embeddings. The end result of this paper is a deeper mathematical understanding of logic puzzles of this type, as well as a fun new puzzle which could be played.

Phase lies at the heart of quantum physics and quantum information theory. A quantum bit is qualitatively different from a classical bit as it allows for the coherent superposition of possibilities, which demonstrate different behaviours depending on the phase between them. These behaviours constitute as interference phenomena, and lie behind the existence of algorithms in quantum computing which are arguably faster than the best classical alternatives. The concept of phase is deeply steeped in the structure of Hilbert spaces: the mathematical framework that underlies quantum theory. What if quantum theory did not hold in all scenarios, or was only a limiting case of some broader theory? In this case, would we still be able to meaningfully talk about phase and interference? In this thesis, we will adopt an operational generalisation of quantum theory known as the framework of generalised probabilistic theories. We will provide a reasonable definition of phase in this framework. Using this, we shall explore single-particle interferometry set-ups (particularly Mach-Zehnder interferometers): experiments whose output is highly dependent on the phase between the spatially disjoint branches through which a particle might be traversing. By applying physically-motivated locality considerations, we identify the crucial role that the uncertainty principle and its generalisations play in quantum theory as an enabler of non-trivial interference. By taking into account relativity of simultaneity, we will also provide a physical motivation for why standard quantum theory provides the best description of the location of a particle traversing such a system. Finally, we apply our generalised definition of phase in the related context of particle exchange behaviour, and identify a method for classifying post-quantum particles. All of this will demonstrate that phase between possibilities and its consequences are not uniquely quantum phenomena. Much of the behaviour we might ascribe to phase in quantum theory in fact holds generally true for phase in probabilistic theories.

We investigate definability in henselian fields. Specifically, we are interested in those sets and substructures that are existentially definable or definable with `few' parameters. Our general approach is to use various versions of henselianity to understand the `local structure' of these definable sets. The fields in which we are most interested are those of positive characteristic, for example the local fields F_q((t)), but many of our methods and results also apply to p-adic and real closed fields. In positive characteristic we have to deal with inseparable field extensions and we develop the method of Λ-closure to `translate' inseparable field extensions into separable ones. In the first part of the thesis we focus on existentially definable sets, which are projections of algebraic sets. Our main tool is the Implicit Function Theorem (for polynomials) which is equivalent to t-henselianity, by work of Prestel and Ziegler. This enables us to prove that existentially definable sets are `large' in various senses. Using the Implicit Function Theorem, we also obtain a nonuniform local elimination of the existential quantifier. The non-uniformity and local character of this result at present forms an obstacle to full quantifier-elimination. From these technical statements we can deduce characterisations of, for example, existentially definable subfields and existentially definable transcendentals. We prove that a dense, regular extension of t-henselian fields is existentially closed which, in particular, implies the old result of Ershov that F_p(t)^h ≤_Ǝ F_p((t)). Using the existential closedness of large fields in henselian fields, we are able to apply many of these results to large fields. This answers questions for imperfect large fields that were answered in the perfect case by Fehm.</p> In the second part of the thesis, we work with power series fields F((t)) and subsets which are F- definable (and not contained in F). We use a `hensel-like' lemma to characterise F-orbits of (singleton) elements of F((t)). It turns out that all such orbits are Ǝ-t-definable. Consequently, we may apply our earlier results about existentially definable subsets to F-definable subsets. We can use this to characterise F-definable subfields of F((t)). As a further corollary, we obtain an Ǝ-0̸-definition of F_p[[t]] in F<sub>p<sub>((t)).

This thesis examines two approaches to Galois correspondences in formal logic. A standard result of classical first-order model theory is the observation that models of L-theories with a weak form of elimination of imaginaries hold a correspondence between their substructures and automorphism groups defined on them. This work applies the resultant framework to explore the practical consequences of a model-theoretic Galois theory with respect to certain first-order L-theories. The framework is also used to motivate an examination of its underlying model-theoretic foundations. The model-theoretic Galois theory of pure fields and valued fields is compared to the algebraic Galois theory of pure and valued fields to point out differences that may hold between them. The framework of this logical Galois correspondence is also applied to the theory of pseudoexponentiation to obtain a sketch of the Galois theory of exponential fields, where the fixed substructure of the complex pseudoexponential field B is an exponential field with the field Qrab as its algebraic subfield. This work obtains a partial exponential analogue to the Kronecker-Weber theorem by describing the pure field-theoretic abelian extensions of Qrab, expanding upon work in the twelfth of Hilbert’s problems. This result is then used to determine some of the model-theoretic abelian extensions of the fixed substructure of B. This work also incorporates the principles required of this model-theoretic framework in order to develop a model theory over substructural logics which is capable of expressing this Galois correspondence. A formal semantics is developed for quantified predicate substructural logics based on algebraic models for their propositional or nonquantified fragments. This semantics is then used to develop substructural forms of standard results in classical first-order model theory. This work then uses this substructural model theory to demonstrate the Galois correspondence that substructural first-order theories can carry in certain situations.

There is an ongoing debate among psychologists regarding the psychological factors underlying moral judgments. Rationalists argue that informational assumptions (i.e. ideological beliefs about how the world works) play a causal role in shaping moral judgments whereas intuitionists argue that informational assumptions are post hoc justifications for judgments made automatically by innate intuitions. In order to compare these two perspectives, the author conducted two studies in which informational assumptions related to ingroups and outgroups varied across conditions. In Study 1, political conservatives and liberals completed the moral relevance questionnaire while imagining they were in the US, Iran, or no specific country. Keeping in line with the predictions of the intuitionist perspective, the results showed that the judgments of conservatives and liberals did not significantly differ across conditions. Study 2 used a more in depth manipulation in which participants read a vignette about a government (US, Iran, or the fictional country of Kasbara) violating the rights of a minority group. As in Study 1, the results support the intuitionist perspective--the judgments of conservatives and liberals did not significantly differ across conditions. These findings play a small part in clarifying the role of informational assumptions in moral judgments.

Logical deduction and abstraction from detail are fundamental, yet distinct aspects of reasoning about programs. This dissertation shows that the combination of logic and abstract interpretation enables a unified and simple treatment of several theoretical and practical topics which encompass the model theory of temporal logics, the analysis of satisfiability solvers, and the construction of Craig interpolants. In each case, the combination of logic and abstract interpretation leads to more general results, simpler proofs, and a unification of ideas from seemingly disparate fields. The first contribution of this dissertation is a framework for combining temporal logics and abstraction. Chapter 3 introduces trace algebras, a new lattice-based semantics for linear and branching time logics. A new representation theorem shows that trace algebras precisely capture the standard trace-based semantics of temporal logics. We prove additional representation theorems to show how structures that have been independently discovered in static program analysis, model checking, and algebraic modal logic, can be derived from trace algebras by abstract interpretation. The second contribution of this dissertation is a framework for proving when two lattice-based algebras satisfy the same logical properties. Chapter 5 introduces functions called subsumption and bisubsumption and shows that these functions characterise logical equivalence of two algebras. We also characterise subsumption and bisubsumption using fixed points and finitary logics. We prove a representation theorem and apply it to derive the transition system analogues of subsumption and bisubsumption. These analogues strictly generalise the well studied notions of simulation and bisimulation. Our fixed point characterisations also provide a technique to construct property preserving abstractions. The third contribution of this dissertation is abstract satisfaction, an abstract interpretation framework for the design and analysis of satisfiability procedures. We show that formula satisfiability has several different fixed point characterisations, and that satisfiability procedures can be understood as abstract interpreters. Our main result is that the propagation routine in modern sat solvers is a greatest fixed point computation involving abstract transformers, and that clause learning is an abstract transformer for a form of negation. The final contribution of this dissertation is an abstract interpretation based analysis of algorithms for constructing Craig interpolants. We identify and analyse a lattice of interpolant constructions. Our main result is that existing algorithms are two of three optimal abstractions of this lattice. A second new result we derive in this framework is that the lattice of interpolation algorithms can be ordered by logical strength, so that there is a strongest and a weakest possible construction.