Monday, December 03, 2012
04:45 pm
- 06:00 pm
Logic Seminar, Brett Townsend - Wesleyan: "The Structure of Ordered Abelian Groups with Finite Prime Invariants"
Abstract: A dense regular group is a densely ordered group elementarily equivalent to a subgroup of R. In this talk I will discuss the structure of definable sets in such groups with arbitrary finite prime invariants. In particular, I will present a cell-decomposition theorem similar to that which is known for o-minimal structures, and describe how one may then derive a coherent dimension theory for such groups.
ESC 638
Monday, November 26, 2012
04:45 pm
- 06:00 pm
Logic Seminar, Koushik Pal - University of Maryland: "Unstable Theories with an Automorphism"
Abstract: Kikyo and Shelah showed that if T is a first-order theory in some language L with the strict-order property, then the theory T_\sigma, which is the old theory T together with an L-automorphism \sigma, does not have a model companion in L_\sigma, which is the old language L together with a new unary predicate symbol \sigma. However, it turns out that if we add more restrictions on the automorphism, then T_\sigma can have a model companion in L_\sigma. I will show some examples of this phenomenon in two different context - the linear orders and the ordered abelian groups. In the context of the linear orders, we even have a complete characterization of all model complete theories extending T_\sigma in L_\sigma. This is joint work with Chris Laskowski.
ESC 638
Monday, November 12, 2012
04:45 pm
- 06:00 pm
Logic Seminar, Jean-Martin Albert - Marlboro College: "Continuous Logical Categories"
Abstract: In this talk I will introduce Continuous Logical Categories. These are an analogue of the notion of Logical Category introduced by Makkai and Reyes in the context of First-Order Continuous Logic. We will also establish a correspondence between theories in First-Order Continuous Logic and Continuous Logical Categories.
ESC 638
Monday, November 05, 2012
04:45 pm
- 06:00 pm
Logic Seminar, Paul Baginski - Smith: "Stability and Countable Categoricity in Nonassociative Rings"
Abstract: A classic result due to Felgner and to Baur, Cherlin and Macintyre in the 1970s states that a stable, $\aleph_0$-categorical group is nilpotent by finite. At around the same time, Baldwin and Rose proved that a stable, $\aleph_0$-categorical associative ring is nilpotent by finite. Recently, Wagner, Krupinski and others have renewed interest in these two results by proving analogous statements where stability is replaced by other model theoretic properties. In all cases, the rings being considered are associative. However, Rose extended many of his results with Baldwin in a second paper to a class of nonassociative rings called alternative rings. However, the question of whether a stable, $\aleph_0$-categorical alternative ring was nilpotent by finite remained open. In this talk, I shall outline a proof of Baldwin and Rose's theorem using a modern perspective and then discuss the obstacles that occur when one tries to use the same methods for nonassociative rings. I will then present my current progress towards proving Baldwin and Rose's theorem for nonassociative rings.
ESC 638
Friday, October 19, 2012
04:45 pm
- 06:00 pm
Logic Seminar, Maryanthe Malliaris, University of Chicago: "Saturation of Ultrapowers and the Structure of Unstable Theories
Abstract: The talk will be about some very recent progress on Keisler's order, a far-reaching program of understanding basic model-theoretic structure through the lens of regular ultrapowers. I will explain Keisler's order and the perspective it gives on classifying the unstable theories, and discuss a recent paper of Malliaris and Shelah which applies model-theoretic techniques developed for the study of Keisler's order to solve the oldest problem on cardinal invariants of the continuum.<br/><br/><br/>I will assume basic familiarity with ultraproducts, Los's theorem, and saturation, and plan to give most other relevant definitions. Papers mentioned in the talk are available at http://math.uchicago.edu/~mem.<br/><br/>NOTE UNUSUAL DAY OF THE WEEK FOR LOGIC SEMINAR<br/>
ESC 638
Monday, October 01, 2012
04:45 pm
- 06:00 pm
Logic Seminar, Johanna Franklin UCONN: "Randomness and nonergodic transformations"
Abstract: Random points are typical in that they have no rare measure-theoretic properties, and points that satisfy ergodic theorems are typical in that their orbits under certain kinds of transformations have certain regularity properties. In the past few years, many connections between these types of typicality have been found. For instance, a point is Martin-Loef random if and only if it satisfies Birkhoff's ergodic theorem for all computable ergodic transformations with respect to effectively closed sets. The case in which the transformations are taken to be ergodic has largely been settled.<br/><br/>I will begin by defining the basic concepts in each area and explaining the connections known to exist between randomness and ergodic theorems. Then I will present some results that are joint with Henry Towsner that deal with the nonergodic case. We show, among other things, that if a point is not Martin-Loef random, then there is a computable, measure-preserving transformation and a computable set for which Birkhoff's ergodic theorem does not hold at that point. This gives us the converse of a theorem by V'yugin.<br/>
ESC 638
Monday, September 24, 2012
04:45 pm
- 06:00 pm
Logic Seminar, Reed Solomon, UCONN: " Turing degrees of orderings of torsion free abelian groups"
Abstract: The space of orderings on a countable torsion free abelian group of rank greater 1 is homeomorphic to Cantor space. However, the connection between spaces of orderings on computable abelian groups and Pi^0_1 classes with no isolated paths is not well understood. I will present some recent joint work with Karen Lange and Asher Kach concerning this relationship.
ESC 638
Monday, September 17, 2012
04:45 pm
- 06:00 pm
Logic Seminar, Russell Miller, Queens College (CUNY): "Constraint Sets in Differential Fields"
Abstract: Differential fields are fields endowed with one or more differential operators, in which one can express algebraic differential equations and ask whether they have solutions. With the help of model theory, differential algebraists have successfully generalized many of the standard concepts for fields to the setting of differential fields, including a notion of differential closure analogous to the algebraic closure of a field. In many cases, however, the concepts become more difficult to handle in the differential setting, and computability theory can sometimes make this contrast explicit.<br/><br/>In joint work, the speaker and Alexey Ovchinnikov have focused on the notion of a constrained pair of differential polynomials from a differential field K of characteristic 0. Roughly speaking, the pair (p,q) is \textit{constrained} if the formula $p(x) = 0 \neq q(x)$ generates a principal type (over the theory DCF_0 of differentially closed fields of characteristic 0, augmented by the atomic diagram of K), and the differential closure of K realizes exactly these principal types. For fields, such types are generated precisely by the irreducible polynomials, and so being a constrained pair is analogous to a single algebraic polynomial being irreducible. Therefore, it is important to be able to decide which pairs are constrained. For fields, Kronecker's Theorem allows one to decide irreducibility of polynomials over every finitely generated field of characteristic 0. We have extended parts of Kronecker's Theorem to the context of constrained pairs over a differential field, and this talk will explain how this was done and what remains to be done. No prior knowledge of differential algebra will be assumed; we will offer explanations of much of the foregoing description of the topic before arriving at the new results.<br/>
ESC 638
Monday, April 30, 2012
04:00 pm
- 05:00 pm
CT Logic Seminar, Cameron Freer, MIT: Model-theoretic methods in continuum limits in Combinatorial structures
Abstract: How can one build a random symmetric structure? We will describe new model-theoretic techniques that build on the combinatorial theory of graph limits and the probability theory of exchangeable arrays. This <br/>talk complements the one given by Rehana Patel in the logic seminar last Fall. The Rado graph admits a natural probabilistic construction, by independently flipping a weight-p coin to determine each edge, for any fixed 0 < p < 1. This random graph is exchangeable, in the sense that the joint distribution on edges is invariant to permutations of the vertices.What other countable structures admit an exchangeable construction? The Aldous-Hoover theorem and the theory of graph limits show that any ergodic exchangeable graph can be written as a ``W-random graph'' for some measurable function W : [0,1]^2 -> [0,1], i.e., a random graph where vertices are drawn iid uniform from [0,1] and edges are determined by independent coin flips with weights given by W. <br/>However, for many graphs it is not clear whether such a W exists.In 2010, Petrov and Vershik gave an exchangeable construction of Henson's universal homogeneous triangle-free graph, making use of this characterization. Using techniques from model theory for infinitary logic, we extend their construction to provide a complete classification of countable relational structures admitting an exchangeable construction. We will also describe several connections to results about countable exchangeable structures and the <br/>corresponding continuum limit structures by Gaifman, Scott, Krauss, Hoover, and Razborov.<br/><br/>Joint work with Nate Ackerman and Rehana Patel<br/>
ESC 638
Monday, April 30, 2012
05:15 pm
- 06:15 pm
Ct Logic Seminar, James Freitag, UIC: Intersection theory in differential algebraic geometry
Abstract: We will discuss recent developments in intersection theory for differential algebraic geometry. The main goal will be to sketch a proof of a differential version of Bertini's theorem. The result is a generalization of the classical theorem, but the proof takes a much different course due to various anomalies regarding intersections of differential algebraic varieties originally pointed out by Ritt. If time permits, several applications will also be given.
ESC 638
Monday, April 23, 2012
04:45 pm
- 06:00 pm
CT Logic Seminar: Alf Dolich, Kinsborough C.C.: Very Dependent Ordered Structures
Abstract: For a theory to not have the independence property, as originally introduced by Shelah, may be viewed as a very weak criterion that the theory in question is tractable. Recently theories without the independence property, also referred to as dependent theories, have begun to be extensively studied and in the process several stronger forms of dependence have come to the fore which by being more stringent increase the potential for a theory to be <br/>tractable. In this talk I will consider theories of finite dp-rank, one such stronger form of dependence. In particular I will consider expansions of the theory of dense linear orderings of finite dp-rank, a class of theories which includes all o-minimal theories. To begin with I will discuss some topological properties of definable sets in such structures and provide several examples to illustrate the variety that exists in this apparently quite restrictive class. Secondly I will isolate a consequence for the topology of definable sets in theories of dp-rank 1 (the so-called dp-minimal theories) and then investigate theories with this property.<br/>
ESC 638
Monday, February 20, 2012
05:15 pm
- 06:15 pm
(CT Logic Seminar Part 2) Zoe Chatzidakis, Paris VII: "Field Internal Difference Varieties"
Abstract: Let G be an algebraic group, defined over some field K, and let g be in G(K). Consider the difference equation<br/>(*) x in G and sigma(x)=gx.<br/>If a and b are two solutions of (*), then a^{-1}b satisfies sigma(y)=y. In other words, once given a solution a, all the others are obtained by multiplying a on the right by an element of G(Fix(sigma)). <br/>So, the set of solutions of (*) is internal to Fix(sigma).<br/><br/>A difference variety as in (*) is called a translation variety. In joint work with E. Hrushovski, we determine when a difference variety which is internal to Fix(sigma) is a quotient of a translation variety. I will discuss this result. I will only assume the basic algebraic or model-theoretic definitions, all others will be given.<br/>
ESC 638
Monday, February 13, 2012
04:45 pm
- 06:00 pm
CT Logic Seminar, Johanna Franklin, UConn: Lowness for randomness and lowness for tests
Abstract: There are several ways in which a real can be said to be far from random for any randomness notion R. One of them is lowness for R: we say that a real is low for R if, when we use it as an oracle, we cannot make an R-random real appear to be nonrandom. Another is lowness for R-tests: we say that a real is low for R-tests if any R-test relativized to that real can be covered by an unrelativized R-test. These concepts have been shown to coincide for many randomness notions, and some evidence has been presented by Bienvenu and J. Miller that suggests that they naturally coincide. We show that these concepts differ for difference randomness, the first notion for which this has been shown to be the case.<br/><br/>This work is joint with David Diamondstone.<br/>
ESC 638
Monday, January 30, 2012
04:45 pm
- 06:00 pm
CT Logic Seminar: Paul Baginski "Model Theoretic Advances for Groups With Bounded Chains of Centralizers"
Speaker: Paul Baginski, Smith College<br/><br/>Abstract: Stable groups have a rich literature, extending ideas about <br/>algebraic groups to a wider setting, using the framework of model <br/>theory. Stable groups gain much of their strength through their chain <br/>conditions, notably the Baldwin-Saxl chain condition. In this talk, we <br/>will concern ourselves with one mild, yet very important, chain <br/>condition shared by many infinite groups studied by group theorists. A <br/>group G is said to be M_C if every chain of centralizers C_G(A_1) < <br/>C_G(A_2)< ... is finite. This class is not elementary, yet there is <br/>increasing evidence that they share many important properties of <br/>stable groups. All the present results<br/>concern nilpotence in M_C groups. The first results in<br/>this area were purely group-theoretic, but recent results by Wagner, <br/>Altinel and Baginski have uncovered that some of the desired <br/>definability results are also present. We will recount the progress <br/>that has been made and the obstacles that researchers in this area <br/>face.<br/>
ESC 638
Monday, November 28, 2011
04:45 pm
- 06:00 pm
Janak Ramakrishnan, Lisbon: Interpretable groups are definable (CT Logic Seminar)
Abstract: We present joint work with K. Peterzil and P. Eleftheriou that in an arbitrary o-minimal structure, every interpretable group is definably isomorphic to a definable one. Moreover, every definable group lives in a cartesian product of one-dimensional definable group-intervals (or one-dimensional definable groups).
ESC 638
Monday, November 14, 2011
04:45 pm
- 06:00 pm
CT Logic Seminar: Invariant Measures Concentrated on Countable Structures
Speaker: Rehana Patel, Wesleyan University<br/><br/>Abstract: The Erd\"os-R\'enyi random graph construction can be seen as inducing a probability measure concentrated on the Rado graph (sometimes known as the countable 'random graph') that is invariant under arbitrary permutations of the underlying set of vertices. A natural question to ask is: For which other countable structures does such an invariant measure exist? Until recent work of Petrov and Vershik (2010), the answer was not known even for Henson's countable homogeneous-universal triangle-free graph. We provide a characterisation of countable structures that admit invariant measures, in terms of the notion of (group-theoretic) definable closure. This leads to new examples and non-examples, including a complete list of countable homogeneous graphs and partial orders that satisfy our criterion. Our proof uses infinitary logic to build on Petrov and Vershik's constructions, which involve sampling from certain continuum-sized objects. In the case when the measure is concentrated on a graph, these continuum-sized objects are in fact 'graph limits' in the sense of Lovasz and Szegedy (2006). Joint work with Nathanael Ackerman and Cameron Freer.
ESC 638
Monday, October 31, 2011
04:45 pm
- 06:00 pm
CT Logic Seminar: An Introduction to the Functional Interpretation
Speaker: Henry Towsner, UCONN<br/><br/>Abstract: The functional interpretation is one of the main tools of modern proof theory, providing a systematic way for extracting constructive information from proofs. This talk will give an introduction to what the functional interpretation is and how it is used, culminating in a recent application to reverse mathematics.
ESC 638
Monday, October 10, 2011
04:45 pm
- 06:00 pm
CT Logic Seminar: Finding something real in Zilbers Field
Speaker: Ahuva Shkop<br/><br/>Abstract: In 2004, Zilber constructed a class of exponential fields, known as pseudoexponential fields, and proved that there is exactly one pseudoexponential field in every uncountable cardinality up to isomorphism. He conjectured that the pseudoexponential field of size continuum, K , is isomorphic to the classic complex exponential field. Since the complex exponential field contains the real exponential field, one consequence of this conjecture is the existence of a real closed exponential subfield of K . In this talk, I will sketch the proof of the existence of uncountably many non-isomorphic countable real closed exponential subfields of K and discuss some of their properties.
ESC 638
Monday, September 19, 2011
04:45 pm
- 06:00 pm
Counting rational points on certain Pfaffian surfaces
Speaker: Margaret Thomas, University of Konstanz<br/><br/>Abstract: In this talk, we shall consider the question of bounding the density of rational and algebraic points on sets definable in o-minimal expansions of the real field. After surveying the topic, we shall focus on a conjecture of Wilkie about sets definable in the real exponential field and review the progress that has so far been made towards this. In particular, we shall present some results in this direction for certain surfaces. (These results are joint work with Gareth O. Jones.)
ESC 638
Monday, September 12, 2011
04:45 pm
- 06:00 pm
Degrees which are low for isomorphism
Speaker: Reed Solomon, UCONN<br/><br/>Abstract: A Turing degree d is low for isomorphism if whenever d can compute an isomorphism between a pair of computable structures, there is a computable isomorphism between these structures. This talk will survey some results from an ongoing project about such degrees with Johanna Franklin and Ted Slaman.
ESC 638
Monday, May 09, 2011
04:15 pm
- 06:00 pm
Integration in T-convex theories
Speaker: Yimu Yin, Pittsburgh<br/><br/>Abstract: I will first briefly explain Hrushovski-Kazhdan style motivic integration and then outline how to construct such an integration in T-convex theories. Since this is an ongoing project and not all the details have been checked, I will focus more on the motivation, which is related to motivic multiplicative characters, than the technical details.
ESC 638
Monday, April 25, 2011
04:15 pm
- 06:00 pm
Solutions to Linear Equations in Valued D-Fields
Speaker: Meghan Anderson, UC Berkeley<br/><br/>Abstract: A theory of D-henselian fields was developed by Scanlon in his 1997 thesis. In this theory, valued fields are endowed with a derivative like operator D, interacting strongly with the valuation. The operator specializes to a derivative in the residue field, but in the valued field is interdefinable with a nontrivial automorphism. The theory has good model theoretic properties, most notably quantifier elimination. This should allow for some analysis of the difference field in terms of the differential structure. However, the theory also presents its own challenges, even in the relatively simple setting of solution spaces to linear equations. I will discuss some of these challenges, and progress towards a model theoretic Galois theory in this setting.<br/>
ESC 638
Monday, April 11, 2011
04:15 pm
- 06:00 pm
Computability of Integer Parts
Speaker: Karen Lange, Notre Dame<br/><br/>Abstract: An integer part of a real closed eld R is a discrete ordered subring<br/>I containing 1 such that for all r 2 R there exists a unique i 2 I with<br/>i r < i + 1. Mourgues and Ressayre [1] showed that every real closed<br/>eld R has an integer part. They do this by building an embedding<br/>of R into the eld of generalized power series khhGii, where k is the<br/>residue eld of R and G is the value group of R. For a countable real<br/>closed eld R, we showed that the integer part obtained by the pro-<br/>cedure of Mourgues and Ressayre is 0<br/>!! (R) by bounding the lengths<br/>of the power series in the image of this embedding. We would like to<br/>know whether there exists a construction that yields a computation-<br/>ally simpler integer part, perhaps one that is 0<br/>2 (R). All integer parts<br/>are Z-rings, discretely ordered rings that have the euclidean algorithm<br/>for dividing by integers. By a result of Wilkie [2], any Z-ring can be<br/>extended to an integer part for some real closed eld. We show that<br/>we can compute a maximal Z-ring I for any real closed eld R that is<br/>0<br/>2(R), and we then examine whether this I must serve as an integer<br/>part for R. We also show that certain subclasses of 0<br/>2(R) are not<br/>sucient to produce integer parts for R. This is joint work with Paola<br/>D'Aquino and Julia Knight.<br/>References<br/>[1] M. H. Mourgues and J.-P. Ressayre, \Every real closed eld has an integer<br/>part," J. Symb. Logic, vol. 58 (1993), pp. 641-647.<br/>[2] Alex Wilkie, \Some results and problems on weak systems of Arithmetic", in<br/>Logic Colloquium '77, North Holland.<br/>
ESC 638
Monday, April 04, 2011
04:45 pm
- 06:00 pm
End-Extensions
Speaker: Philip Rothmaler, CUNY<br/><br/>Abstract: I will explain a new and simple proof of the fact that every (colored) linear ordering has a proper elementary end-extension (unless it obviously cannot). The proof has in large parts very little to do with orderings. It is based on a simple idea of how to get Vaughtian pairs (i.e. extend a model without extending a certain infinite definable set) via what is known as weak orthogonality. Though this term stems from stability theory, it is completely elementary, and I will explain everything from scratch. A new result using the same proof yields proper elementary branch-end-extensions of (colored) trees.
ESC 638
Monday, December 06, 2010
04:15 pm
- 06:00 pm
Cardinal Invariant Properties of Countable Borel Equivalence Relations
Speaker: Scott Schneider, Wesleyan University<br/><br/>Abstract: Boykin and Jackson have shown that the bounding number, b, can be used to define a property of countable Borel equivalence relations that is relevant to the unions problem for hyperfinite relations. In fact, many other cardinal invariants of the continuum can be used in an analogous manner to define "Borel cardinal invariant" properties of countable Borel equivalence relations. In this talk, we introduce these new properties and examine some of the basic relationships that hold between them, thus linking the study of countable Borel equivalence relations with that of cardinal invariants of the continuum. In particular, we show that the property corresponding to the splitting number s is equivalent to smoothness.<br/><br/><br/>.<br/><br/>NOTE: The CT logic seminar will NOT meet on Monday Nov 29th. Our next seminar meeting, and the last of the fall semester, will be on Monday December 6, 2010.<br/>
ESC 638
Monday, October 25, 2010
04:15 pm
- 06:00 pm
AT UCONN Definability and Automorphisms of the C.E. Sets
Speaker: Rachel Epstein, Harvard University<br/><br/>Abstract: Definability is one of the fundamental themes of computability theory. We examine the structure of the computably enumerable (c.e.) sets under set inclusion. The problem of which classes of degrees are definable in this structure has been an important topic of study in computability theory. In particular, it has been shown that all upward-closed jump classes (such as high, nonlow2, etc.) are definable except for the nonlow degrees, which are not definable. To show that the nonlow degrees are not definable, we use automorphisms, which we build on trees of strategies. We will discuss the history of the problem and some of the ideas of the proof.
ESC 638
Monday, October 11, 2010
04:05 pm
- 05:00 pm
Geometric Model Theory in Efficient Computability
Speaker: Cameron Hill<br/><br/>Abstract: This talk will consist of a sketch of the proof of a single main <br/>result linking geometric ideas from the first-order model theory of <br/>infinite structures with complexity-theoretic analyses of problems <br/>over classes of finite structures. To remove any suspense, the <br/>statement of the theorem is as follows:<br/><br/>Theorem:<br/>Let K = fin[T^G], where T is a complete k-variable theory with <br/>infinitely many finite models up to isomorphism.<br/>I. If T is constructible, then K is rosy.<br/>II. T is efficiently constructible if and only if K is super-rosy.<br/><br/>Obviously, a great number of definitions are needed (regardless of <br/>the reader's background, most likely) to make sense of these <br/>assertions. For the time being, it should be understood as a shadow <br/>of the ``main current'' of first-order model theory -- namely, <br/>Shelah's Classification theory. I take ``efficiently constructible'' <br/>-- meaning that models of T can be efficiently recovered from <br/>elementary diagrams of subsets -- to be a reasonable substitute for <br/>``classifiable'' in the classical theory. We then seek a hierarchy of <br/>structural properties culminating in efficient constructibility in <br/>analogy with the stability-theoretic hierarchy, Stable properly <br/>contains Super-stable properly contains <br/>Classifiable=Super-stable+NDOP. In the classical scenario, any <br/>non-trivial bound on the number of models of the theory in each <br/>cardinality imposes stability, which already supports the rudimentary <br/>notion of geometry known as non-forking independence. In the scenario <br/>of this study, the hypothesis of constructibility by an algorithm <br/>cursorily imitating that of an efficient algorithm in form (meaning, <br/>an essentially inflationary program which isn't necessarily <br/>efficient) is sufficient to impose another rudimentary notion of <br/>geometry on the class of models -- in this case, known as <br/>thorn-independence in a rosy class; this is the content of I of the <br/>Theorem. The further requirement of efficiency -- <br/>polynomially-bounded running times -- induces a further guarantee of <br/>good behavior in the geometry of thorn-independence, and the "only <br/>if" portion of II of the theorem amounts to just this fact. It turns <br/>out, then, that this additional tractability in the geometry gives <br/>enough purchase to devise an efficient algorithm, initially disguised <br/>as a weak model-theoretic coordinatization result, for the class of <br/>the theory's finite models.<br/>
ESC 638
Monday, October 11, 2010
05:10 pm
- 06:00 pm
Computable Fields and the Bounded Turing Reduction
Speaker: Rebecca Steiner<br/><br/>Abstract: For a computable field F, the splitting set S_F of F is <br/>the set of polynomials with coefficients in F which factor over F, <br/>and the root set R_F of F is the set of polynomials with <br/>coefficients in F which have a root in F.<br/><br/>Results of Frohlich and Shepherdson from 1956 imply that for a <br/>computable field F, the splitting set S_F and the root set R_F are <br/>Turing-equivalent. Much more recently, R. G. Miller showed that for <br/>algebraic fields, the root set actually has slightly higher <br/>complexity: for algebraic fields F, it is always the case that S_F <br/>1-reduces to R_F, but there are algebraic fields F where we have R_F <br/>not 1-reducible to S_F.<br/><br/>Here we compare the splitting set and the root set of a computable <br/>algebraic field under a different reduction: the bounded Turing <br/>reduction. We construct a computable algebraic field for which R_F <br/>does not bT-reduce to S_F.<br/><br/>We also define a Rabin embedding g of a field into its algebraic <br/>closure, and for a computable algebraic field F, we compare the <br/>relative complexities of R_F, S_F, and g(F) under m-reducibility and <br/>under bT-reducibility.<br/>
ESC 638
Monday, September 20, 2010
04:45 pm
- 06:30 pm
Finitely Generic Dimension Groups
Speaker: Philip Scowcroft, Wesleyan University<br/><br/>Abstract: Finitely generic dimension groups form a subclass of the existentially closed dimension groups. After outlining the method of model-theoretic forcing used to produce finitely generic dimension groups, this talk will describe algebraic and recursion-theoretic properties distinguishing these groups from arbitrary existentially closed dimension groups.
ESC 638
Monday, September 13, 2010
04:45 pm
- 06:30 pm
Existentially Closed Dimension Groups
Speaker: Philip Scowcroft<br/><br/>Abstract: A dimension is a special kind of partially ordered Abelian group first studied in connection with operator algebras. Existentially closed dimension groups are to dimension groups as algebraically closed fields are to fields. This talk will explain all the terms in its title and characterize the existentially closed dimension groups.
ESC 638
![[Wesleyan University]](/common/_internal/files/logo.png "Wesleyan University front door"){kind=logo}
![[Wesleyan University shield]](http://www.wesleyan.edu/common/_internal/files/shield_44x50_dddddd.png){kind=small}