1 |
Metapredicative set theories and provable ordinalsThiel, Nikolaus Peter Matthias January 2003 (has links)
No description available.
|
2 |
Dedekind-finite structuresWalczak-Typke, Agatha C. January 2005 (has links)
No description available.
|
3 |
Dimension and measure in finite first order structuresElwes, Richard Hugh January 2005 (has links)
No description available.
|
4 |
Universality results for ordered and directed structuresThompson, Katherine January 2003 (has links)
No description available.
|
5 |
On the combinatorics of ΡκλPiper, Gregory January 2003 (has links)
No description available.
|
6 |
O-categorical Hrushovski constructions, strong order properties, oak and independenceWong, Mark Wing Ho January 2007 (has links)
In 1972 A.H. Lachlan asked whether all stable ℵ0-categorical theories were also ω-stable. This claim was refuted by E. Hrushovski when he constructed a counter-example to the conjecture. It is a generalisation of this counterexample which provides the structures forming the basis of this thesis. We refer to these structures as Hrushovski constructions. We begin by looking at how such constructions fit in to Shelah’s strong order properties. D. Evans proved that under certain assumptions the theories of Hrushovski’s constructions are simple. He then suggested that by dropping a condition ensuring simplicity, these constructions could be composed in a way that its theories failed both simplicity and strong order property 3. As we will show however, it turns out that this condition actually provides a dividing line between simplicity and strong order property 3. The next section considers the ‘oak’ property on Hrushovski constructions. As oak and strong order property 3 both imply non-simplicity in this class, we investigate the effect that the dividing line between simplicity and strong order property 3 has on oak in Hrushovski constructions. Our investigations provide us with a version of independence specific to Hrushovski constructions. We finish off by showing how this relates to standard notions of independence such as Shelah’s forking-independence and Onshuus’s þ-independence.
|
7 |
Automorphisms of partial combinatory algebras and realizability models of constructive set theorySwan, Andrew Wakelin January 2012 (has links)
In this thesis we investigate automorphisms of partial combinatory algebras and construct realizability models of constructive set theory. After some introductory and background material in chapters 1 and 2, we define in chapter 3 a generalisation of Kripke and realizability models of intuitionistic logic that we call Kripke realizability models. In chapters 4, 6 and 7 we then develop various realizability models of constructive set theory. We show in chapter 5 how to use these techniques to investigate the automorphisms of some partial combinatory algebras. In chapter 8 we use a Kripke realizability model to show that a property known as the existence property does not hold for the set theory CZF.
|
8 |
How to be determinate about indeterminate locationHood, James Michael January 2007 (has links)
No description available.
|
9 |
Unavoidable sets and aperiodic unavoidable setsSaker, Christopher J. January 2004 (has links)
No description available.
|
10 |
The cyclizer function on permutation groupsFiddes, Ceridwyn January 2003 (has links)
No description available.
|
Page generated in 0.0178 seconds