Spelling suggestions: "subject:"[een] SET THEORY"" "subject:"[enn] SET THEORY""
121 |
Algebraically Determined Semidirect ProductsJasim, We'am Muhammad 05 1900 (has links)
Let G be a Polish group. We say that G is an algebraically determined Polish group if given any Polish group L and any algebraic isomorphism from L to G, then the algebraic isomorphism is a topological isomorphism. We will prove a general theorem that gives useful sufficient conditions for a semidirect product of two Polish groups to be algebraically determined. This will smooth the way for the proofs for some special groups. For example, let H be a separable Hilbert space and let G be a subset of the unitary group U(H) acting transitively on the unit sphere. Assume that -I in G and G is a Polish topological group in some topology such that H x G to H, (x,U) to U(x) is continuous, then H x G is a Polish topological group. Hence H x G is an algebraically determined Polish group. In addition, we apply the above the above result on the unitary group U(A) of a separable irreducible C*-algebra A with identity acting transitively on the unit sphere in a separable Hilbert space H and proved that the natural semidirect product H x U(A) is an algebraically determined Polish group. A similar theorem is true for the natural semidirect product R^{n} x G(n), where G(n) = GL(n,R), or GL^{+}(n,R), or SL(n,R), or |SL(n,R)|={A in GL(n,R) : |det(A)|=1}. On the other hand, it is known that the Heisenberg group H_{3}(R) , (R, +), (R{0}, x), and GL^{+}(n,R) are not algebraically determined Polish groups.
|
122 |
Applications of a Model-Theoretic Approach to Borel Equivalence RelationsCraft, Colin N. 08 1900 (has links)
The study of Borel equivalence relations on Polish spaces has become a major area of focus within descriptive set theory. Primarily, work in this area has been carried out using the standard methods of descriptive set theory. In this work, however, we develop a model-theoretic framework suitable for the study of Borel equivalence relations, introducing a class of objects we call Borel structurings. We then use these structurings to examine conditions under which marker sets for Borel equivalence relations can be concluded to exist or not exist, as well as investigating to what extent the Compactness Theorem from first-order logic continues to hold for Borel structurings.
|
123 |
Descriptions and Computation of Ultrapowers in L(R)Khafizov, Farid T. 08 1900 (has links)
The results from this dissertation are an exact computation of ultrapowers by measures on cardinals $\aleph\sb{n},\ n\in w$, in $L(\IR$), and a proof that ordinals in $L(\IR$) below $\delta\sbsp{5}{1}$ represented by descriptions and the identity function with respect to sequences of measures are cardinals. An introduction to the subject with the basic definitions and well known facts is presented in chapter I. In chapter II, we define a class of measures on the $\aleph\sb{n},\ n\in\omega$, in $L(\IR$) and derive a formula for an exact computation of the ultrapowers of cardinals by these measures. In chapter III, we give the definitions of descriptions and the lowering operator. Then we prove that ordinals represented by descriptions and the identity function are cardinals. This result combined with the fact that every cardinal $<\delta\sbsp{5}{1}$ in $L(\IR$) is represented by a description (J1), gives a characterization of cardinals in $L(\IR$) below $\delta\sbsp{5}{1}. Concrete examples of formal computations are shown in chapter IV.
|
124 |
On the symmetric structure of unconditioned point sets and real functions /Parrish, Herbert Charles January 1955 (has links)
No description available.
|
125 |
Maximal (0,1,2,...t)-cliques of some association schemes /Choi, Sul-young January 1985 (has links)
No description available.
|
126 |
Questions Involving Countable Intersection GamesAtchley, James Holmes 07 1900 (has links)
We consider questions involving two different variations of Schmidt's game: the rho game and the HAW (Hyperplane Absolutely Winning) game.
|
127 |
Borel Determinacy and MetamathematicsBryant, Ross 12 1900 (has links)
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.
|
128 |
Some Intuition behind Large Cardinal Axioms, Their Characterization, and Related ResultsWhite, Philip A 01 January 2019 (has links)
We aim to explain the intuition behind several large cardinal axioms, give characterization theorems for these axioms, and then discuss a few of their properties. As a capstone, we hope to introduce a new large cardinal notion and give a similar characterization theorem of this new notion. Our new notion of near strong compactness was inspired by the similar notion of near supercompactness, due to Jason Schanker.
|
129 |
Promoting generalization of coin value relations with young children via equivalence class formationRoberts, Creta M. January 1999 (has links)
Sidman and Tailby (1982) established procedures to analyze the nature of stimulus to stimulus relations established by conditional discriminations. Their research describes specific behavioral tests to determine the establishment of properties that define the relations of equivalence. An equivalence relation requires the demonstration of three conditional relations: reflexivity, symmetry, and transitivity. The equivalence stimulus paradigm provides a method to account for novel responding. The research suggests that equivalence relations provide a more efficient and effective approach to the assessment, analysis, and instruction of skills. The present research examined the effectiveness of the formation of an equivalence class in teaching young children coin value relations. The second aspect of the study was to determine if there was a relationship between equivalence class formation and generalization of the skills established to other settings. Five children, 4- and 5-years old, were selected to participate in the study based on their lack of skills in the area of coin values and purchasing an item with dimes or quarters equaling fifth cents. The experimental task was presented on a Macintosh computer with HyperCard programming. The experimental stimuli consisted of pictures of dimes, quarters, and Hershey candy bars presented in match-to-sample procedures. Two conditional discriminations were taught (if A then B and if B then C.). The formation of an equivalence class was evaluated by if C then A. Generalization across settings was tested after the formation of an equivalence class by having the children purchase a Hershey candy bar with dimes at a play store. A multiple baseline experimentaldesign was used to demonstrate a functional relationship between the formation of an equivalence class and generalization of skills across settings. The present research provides supportive evidence that coin value relations can be taught to young children using equivalence procedures. The study also demonstrated generalization of novel, untaught stimuli across settings, after the formation of an equivalence class. A posttest on generalization across settings was conducted 3 months after the study. Long-term stability of equivalence relations was demonstrated by three of the subjects. / Department of Special Education
|
130 |
Contributions to Descriptive Set TheoryAtmai, Rachid 08 1900 (has links)
In this dissertation we study closure properties of pointclasses, scales on sets of reals and the models L[T2n], which are very natural canonical inner models of ZFC. We first characterize projective-like hierarchies by their associated ordinals. This solves a conjecture of Steel and a conjecture of Kechris, Solovay, and Steel. The solution to the first conjecture allows us in particular to reprove a strong partition property result on the ordinal of a Steel pointclass and derive a new boundedness principle which could be useful in the study of the cardinal structure of L(R). We then develop new methods which produce lightface scales on certain sets of reals. The methods are inspired by Jackson’s proof of the Kechris-Martin theorem. We then generalize the Kechris-Martin Theorem to all the Π12n+1 pointclasses using Jackson’s theory of descriptions. This in turns allows us to characterize the sets of reals of a certain initial segment of the models L[T2n]. We then use this characterization and the generalization of Kechris-Martin theorem to show that the L[T2n] are unique. This generalizes previous work of Hjorth. We then characterize the L[T2n] in term of inner models theory, showing that they actually are constructible models over direct limit of mice with Woodin cardinals, a counterpart to Steel’s result that the L[T2n+1] are extender models, and finally show that the generalized contiuum hypothesis holds in these models, solving a conjecture of Woodin.
|
Page generated in 0.4726 seconds