Connecticut Logic Seminar
Up To Equimorphism, Hyperarithmetic Is Computable
Antonio Montalban (Cornell University)

Connecticut Logic Seminar
Some problems in descriptive set theory: On the unique representation of families of sets and some problems arising in geomery and analysis
Dan Mauldin (University of North Texas)

Connecticut Logic Seminar
K-triviality
Denis Hirschfeldt (University of Chicago)

Connecticut Logic Seminar
Nonnegative Solvability of Linear Equations in Ordered Groups
Philip Snowcroft (Wesleyan University)

Connecticut Logic Seminar
title to be announced
Carl Jockusch (University of Illinois)

Connecticut Logic Seminar
Degrees of unsolvability of continuous functions
Joe Miller (University of Connecticut)

Connecticut Logic Seminar
Amalgamation, tameness and semi-abelian varieties
John Baldwin (University of Illinois at Chicago)

Connecticut Logic Seminar
Strongly minimal sets in differentially closed fields
Eric Rosen (Wesleyan University)

Connecticut Logic Seminar
Homogeneous spaces and actions by analytic groups
Jan van Mill (Vrije Universiteit and Wesleyan University)

Connecticut Logic Seminar
Remarks on Zilber’s pseudoexponentiation
David Marker (University of Illinois at Chicago)

Connecticut Logic Seminar
Eaten by her own dinner
Alex Raichev (University of Wisconsin)

Connecticut Logic Seminar
A method for constructing decidable expansions of the real field by restricted transcendental analytic functions
Daniel Miller (Wesleyan University)

Connecticut Logic Seminar
Automatic Structures
Bakhadyr Khoussainov (Auckland University and Cornell University)

Connecticut Logic Seminar
Computability theoretic complexity of trivial strongly minimal models
Reed Solomon (University of Connecticut)

Connecticut Logic Seminar
Separation of Variables and the Model Theory of Partial Differential Fields
Carol Wood (Wesleyan University)

Connecticut Logic Seminar
Spectra of Turing Degrees
Russell Miller (Queens College)

Connecticut Logic Seminar
What’s Next? Models of Time in Event Systems
Walker White (Cornell University)

Connecticut Logic Seminar
Eventually periodic poly-regular groups
Philip Scowcroft (Wesleyan University)

Connecticut Logic Seminar
Bounding Critical Triples
Rebecca Weber ()

Connecticut Logic Seminar
Connecting computability and randomness
Andre Nies (University of Connecticut)

Connecticut Logic Seminar
On the Strength of Theorems from Combinatorics and Model Theory
Denis Hirschfeldt ()

Connecticut Logic Seminar
Reducts of Random Bipartite Graphs
Yun Lu (Wesleyan University)

Connecticut Logic Seminar
Euclidean Ramsey Theory
Jim Schmerl (University of Connecticut)

Connecticut Logic Seminar
Borel complexity of isomorphism for theories with many types
David Marker (University of Illinois at Chicago)

Connecticut Logic Seminar
Cohesiveness and Pi^1_1 conservation
CT Chong (National University of Singapore)

Connecticut Logic Seminar
Proving the weak pigeonhole principle in bounded arithmetic
Norman Danner ()

Connecticut Logic Seminar
The decidability of the existential theory of the upper semilattice of degrees with least element and jump
Manuel Lerman (University of Connecticut)

Connecticut Logic Seminar
Forcing Axioms, Generic Absoluteness, and Consistency Strength
Stuart Zoble (Wesleyan University)

Connecticut Logic Seminar
Minimal degrees and c.e. degrees
Reed Solomon (University of Connecticut)

Connecticut Logic Seminar
Countable Pi^0_1 classes, strong degree spectra, and Kolmogorov complexity
Carl Jockusch (University of Illinois)

Connecticut Logic Seminar
A Family of Countably Universal Graphs without SOP_4
Rehana Patel (St. John’s University)

Connecticut Logic Seminar
Computability over ordinal time and space
Russell Miller (Queens College CUNY)

Connecticut Logic Seminar
G-compactness is not preserved
Rodrigo Pelaez (University of Barcelona)

Connecticut Logic Seminar
Infinite Hat Problems
Chris Hardin (Smith College)

Connecticut Logic Seminar
Computability of Fraisse Limits
Barbara Csima (University of Waterloo)

Connecticut Logic Seminar
Reducts of Countably Categorical Graphs (Thesis Defense)
Yun Lu (Wesleyan University)

Connecticut Logic Seminar
Model theoretic properties of automatic structures
Mia Minnes (Cornell University)

Connecticut Logic Seminar
WGCH and Martin’s Axiom
John Baldwin (University of Illinois at Chicago)

Connecticut Logic Seminar
Admissible recursion theory and linear orderings of size $aleph_1$
Noam Greenberg (Victoria University of Wellington)

Connecticut Logic Seminar
Combining Real Exponentiation and Weierstrass Elliptic Functions:Decidability and Model Completeness
Angus Macintyre (University of London)

Connecticut Logic Seminar
Halfspaces in dimension groups
Philip Scowcroft (Wesleyan University)

Connecticut Logic Seminar
Coding, Orbits and Computability Enumerable Sets
Peter Cholak (University of Notre Dame)

Connecticut Logic Seminar
Quasi versus pseudo: two elementary classes generated by flat modules
Philipp Rothmaler (Bronx Community College, CUNY)

Connecticut Logic Seminar
Ideals in Computable Rings
Joe Mileti (Dartmouth)

Connecticut Logic Seminar
Model completeness and o-minimality
Gareth Jones (McMaster University)

Connecticut Logic Seminar
Generalizing Pfaffian closure of an o-minimal structure
Sergio Fratarcangeli (The College of New Rochelle)

Connecticut Logic Seminar
Takeuti’s cut-elimination theorem for Pi^1_1_CA
William Tait (University of Chicago)

Connecticut Logic Seminar
Invariants of Boolean Algebras — Part 1
Asher Kach (University of Connecticut)

Connecticut Logic Seminar
Invariants of Boolean Algebras — Part 2
Asher Kach (University of Connecticut)

Connecticut Logic Seminar
Strong notions of reducibility and completeness
Brooke Andersen (Dartmouth College)

Connecticut Logic Seminar
On countable structures Sigma-definable over R,C, and H
Andrei Morozov (Sobolev Institute of Mathematics and Novosibirsk State University)

Connecticut Logic Seminar
On ordered structures of higher rank
Charles Steinhorn (Vassar College)

Connecticut Logic Seminar
Small covers of semi-abelian varieties
John Baldwin (University of Illinois at Chicago)

Connecticut Logic Seminar
Higher-Order Reverse Topology
James Hunter ()

Connecticut Logic Seminar
Local Computability and Uncountable Structures
Russell Miller (Queens College, CUNY)

Connecticut Logic Seminar
Some model theoretic connections between dimension groups and AF algebras
Philip Scowcroft (Wesleyan University)

Connecticut Logic Seminar
Difference fields and algebraic dynamics
Zoe Chatzidakis (University Paris VII)

Connecticut Logic Seminar
Ramsey’s theorem for trees
Jared Corduan (Dartmouth)

Connecticut Logic Seminar
The conjugacy problem for the automorphism group of countably categorical structures
Paul Ellis (University of Connecticut)

Connecticut Logic Seminar
Eliminating Quantifiers in Intuitionistic JRS Theories
Dan McGinn ( and \”model complete\” in the setting of intuitionistic logic and Kripke models? In this talk)

Connecticut Logic Seminar
Do you know how much you know?
Rebecca Weber (Dartmouth)

Connecticut Logic Seminar
A finite automaton perspective on linear orders
Mia Minnes (MIT)

Connecticut Logic Seminar
Generalized Indiscernible Sequences in Stable and NIP Theories
Lynn Scow (UC Berkeley)

Connecticut Logic Seminar
Definite Forms in Valued Fields
Laurel Miller-Sims (Smith College)

Connecticut Logic Seminar
How many sprays cover the plane?
Jim Schmerl (University of Connecticut)

Connecticut Logic Seminar
Existentially closed dimension groups
Philip Scowcroft (Wesleyan University)

Connecticut Logic Seminar
Finitely generic dimension groups
Philip Scowcroft (Wesleyan University)

Connecticut Logic Seminar
Computable Structure Theory of Uncountable (Size Aleph_1) Linear Orders
Asher Kach (University of Connecticut)

Connecticut Logic Seminar
Computable Fields and the Bounded Turing Reduction
Rebecca Steiner (CUNY)

Connecticut Logic Seminar
Geometric model theory in efficient computability
Cameron Hill ()

Connecticut Logic Seminar
Definability and Automorphisms of the C.E. Sets
Rachel Epstein (Harvard)

Connecticut Logic Seminar
An introduction to o-minimal structures and their applications
Alex Wilkie ()

Connecticut Logic Seminar
Effective equivalence structures and their isomorphisms
Valentina Harizanov (George Washington University)

Connecticut Logic Seminar
Difference randomness
Johanna Franklin (Dartmouth)

Connecticut Logic Seminar
Cardinal invariant properties of countable Borel equivalence relations
Scott Schneider ()

Connecticut Logic Seminar
End-extensions
Philipp Rothmaler (CUNY)

Connecticut Logic Seminar
Computability of integer parts
Karen Lange (Notre Dame)

Connecticut Logic Seminar
Solutions to Linear Equations in Valued D-fields
Meghan Anderson (University of California, Berkeley)

Connecticut Logic Seminar
Integration in T-convex theories
Yimu Yin (University of Pittsburgh)

Connecticut Logic Seminar
Degrees which are low for isomorphism
Reed Solomon (UConn)

Connecticut Logic Seminar
Counting rational points on certain Pfaffian surfaces
Margaret Thomas (Konstanz)

Connecticut Logic Seminar
Finding something real in Zilber’s field
Ahuva Shkop (Ben-Gurion)

Connecticut Logic Seminar
An Introduction to the Functional Interpretation
Henry Towsner (UConn)

Connecticut Logic Seminar
Invariant Measures Concentrated on Countable Structures
Rehana Patel ( in terms of the notion of (group-theoretic) definable closure. This leads to new examples and non-examples)

Connecticut Logic Seminar
Interpretable groups are definable
Janak Ramakrishnan (University of Lisbon)

Connecticut Logic Seminar
Model Theoretic Advances for Groups With Bounded Chains of Centralizers
Paul Baginski (Smith College)

Connecticut Logic Seminar
Lowness for randomness and lowness for tests
Johanna Franklin (UConn)

Connecticut Logic Seminar
Integer parts of real closed fields
David Marker (UIC)

Connecticut Logic Seminar
Field internal difference varieties
Zoe Chatzidakis (Paris VII)

Connecticut Logic Seminar
n-Tardy Sets
Peter Gerdes ()

Connecticut Logic Seminar
Distance functions on computable graphs and their cousins
Jennifer Chubb Reimann (University of San Francisco)

Connecticut Logic Seminar
Very Dependent Ordered Structures
Alf Dolich (Kingsborough Community College, CUNY)

Connecticut Logic Seminar
Model-theoretic methods in continuum limits of combinatorial structures
Cameron Freer (MIT)

Connecticut Logic Seminar
Intersection theory in differential algebraic geometry
James Freitag (UIC)

Connecticut Logic Seminar
Existentially closed Abelian lattice-ordered groups
Philip Scowcroft (Wesleyan)

Connecticut Logic Seminar
Constraint Sets in Differential Fields
Russell Miller (Queens College CUNY)

Connecticut Logic Seminar
Turing degrees of orderings of torsion free abelian groups
Reed Solomon (University of Connecticut)

Connecticut Logic Seminar
Randomness and nonergodic transformations
Johanna Franklin (University of Connecticut)

Connecticut Logic Seminar
Saturation of Ultrapowers and the Structure of Unstable Theories
Maryanthe Malliaris (University of Chicago)

Connecticut Logic Seminar
Stability and Countable Categoricity in Nonassociative Rings
Paul Baginski (Smith College)

Connecticut Logic Seminar
Continuous Logical Categories
Jean-Martin Albert (Marlboro College)

Connecticut Logic Seminar
Paths, trees, and the computational strength of some Ramsey-type theorems
Stephen Flood (Penn State)

Connecticut Logic Seminar
Unstable Theories with an Automorphism
Koushik Pal (University of Maryland)

Connecticut Logic Seminar
The Structure of Ordered Abelian Groups with Finite Prime Invariants
Brett Townsend (Wesleyan)

Connecticut Logic Seminar
Separating ADS and CAC
Reed Solomon (University of Connecticut)

Connecticut Logic Seminar
Limits to joining with generics and randoms
Damir Dzhafarov (University of Connecticut)

Connecticut Logic Seminar
Ramsey Theory and Model-theoretic Dividing Lines
Cameron Hill (Wesleyan University)

Connecticut Logic Seminar
Fields and Computable Categoricity
Russell Miller (Queens College CUNY)

Connecticut Logic Seminar
Models of Reverse Mathematics
Henry Towsner (University of Pennsylvania)

Connecticut Logic Seminar
Ramsey transfer theorems
Lynn Scow (Vassar College)

Connecticut Logic Seminar
Satisfaction is not absolute
Joel David Hamkins (College of Staten Island and CUNY Graduate Center)

Connecticut Logic Seminar
Quasiminimality and computability
Jesse Johnson (Westfield State University)

Connecticut Logic Seminar
Existentially closed prime-model extensions of Abelian lattice-ordered groups
Philip Scowcroft (Wesleyan)

Connecticut Logic Seminar
Descriptive and Dynamic Complexity
Neil Immerman (UMass)

Connecticut Logic Seminar
Defining totality in the enumeration degrees
Mariya Soskova (Sofia University and University of California, Berkeley)

Connecticut Logic Seminar
The logic of graph decompositions
Stephen Flood (UConn)

Connecticut Logic Seminar
The power of uniformity in algorithmic randomness
Jason Rute (Penn State)

Connecticut Logic Seminar
Compressibility and Kolmogorov Complexity
Marie Nicholson (UConn)

Connecticut Logic Seminar
Incomparable omega_1-like models of set theory
Victoria Gitman ()

Connecticut Logic Seminar
Transferring model-theoretic results about $L_{\\infty, \\omega}$ to a Grothendieck topos
Nate Ackerman ()

Connecticut Logic Seminar
Computability Theoretic Reduction between $\\Pi^1_2$ Principles
Denis Hirschfeldt (Y)$ holds\”)

Connecticut Logic Seminar
Hilbert’s 10th Problem
Nicole Bowen (UConn)

Connecticut Logic Seminar
Reverse mathematics and the Dual Ramsey Theorem
Reed Solomon (UConn)

Connecticut Logic Seminar
Continuous model theory for C(X)
Philip Scowcroft (Wesleyan)

Connecticut Logic Seminar
The Automorphism Group of a Countable Recursively Saturated Model of PA
Jim Schmerl (UConn)

Connecticut Logic Seminar
Degrees of Mathias generics
Damir Dzhafarov (UConn)

Connecticut Logic Seminar
Some Remarks on Certain 0,1-Laws
Cameron Hill (Wesleyan)

Connecticut Logic Seminar
Computability strength of $\\mathbb{R}$ compared to $2^{\\omega}$
Greg Igusa (Notre Dame)

Connecticut Logic Seminar
Independence, via limits
Gwyneth Harrison-Shermoen (Wesleyan)

Connecticut Logic Seminar
Effective Dimension in Subshifts
Brown Westrick (UConn)

Connecticut Logic Seminar
Separation and reduction in second-order arithmetic
David Belanger (Cornell University)

Connecticut Logic Seminar
Strengthened Ramseyís theorem and finitary Ramseyís theorem
Keita Yokoyama (Japan Advanced Institute of Science and Technology)

Connecticut Logic Seminar
Separating Decomposability and Tree-Decomposability
Stephen Flood (UConn)

Connecticut Logic Seminar
Revisiting EM and ADS
Reed Solomon (UConn)

Connecticut Logic Seminar
The strength of Ramsey’s theorem under reducibilities
Ludovic Patey (University Paris VII)

Connecticut Logic Seminar
Definability in linear fragments of Peano arithmetic
Petr Glivicky (Charles University)

Connecticut Logic Seminar
Diagonally non-computable functions and bi-immunity
Carl Jockusch (UIUC)

Connecticut Logic Seminar
Deep $\\Pi^0_1$ Classes
Chris Porter (University of Florida)

Connecticut Logic Seminar
A Local Characterization of VC-Minimality
Vince Guingona (Wesleyan)

Connecticut Logic Seminar
Strong reductions, $RT^1_3$ and $SRT^2_2$
Reed Solomon (UConn)

Connecticut Logic Seminar
Intrinsic Density and Computability
Eric Astor (University of Connecticut)

Connecticut Logic Seminar
Strong and uniform reducibilities
Damir Dzhafarov (UConn)

Connecticut Logic Seminar
Infinitely generic Abelian lattice-ordered groups
Philip Scowcroft (Wesleyan)

Connecticut Logic Seminar
Triviality and lowness for K-reducibility and related reducibilities
William Calhoun (Bloomsburg University)

Connecticut Logic Seminar
Some new zero-one laws
Caroline Terry (UIC)

Connecticut Logic Seminar
Model theory of fields of finite characteristic
Carol Wood (Wesleyan University)

Connecticut Logic Seminar
Abelian lattice-ordered groups with at most finitely many pairwise disjoint elements
Philip Scowcroft (Wesleyan University)

Connecticut Logic Seminar
Computable Functors and Effective Interpretations
Russell Miller (Queens College, CUNY)

Connecticut Logic Seminar
Visceral Theories
Alf Dolich (Kingsborough Community College, CUNY)

Connecticut Logic Seminar
Graphs, reverse mathematics and Weihrauch reductions
Jeffry Hirst (Appalachian State University)

Connecticut Logic Seminar
Minimal wit-degrees cannot have c.e. Turing degree
Reed Solomon (UConn)

Connecticut Logic Seminar
The strength of the tree theorem for pairs
Damir Dzhafarov (UConn)

Connecticut Logic Seminar
Upper extensions of existentially closed Abelian lattice-ordered groups
Brian Wynne ( and Darnel)

Connecticut Logic Seminar
A look at higher reverse mathematics
Noah Schweber (University of Wisconsin)

Connecticut Logic Seminar
Decision procedures for the conditions true in certain metric structures
Philip Scowcroft (Wesleyan)

Connecticut Logic Seminar
Ordered abelian groups and Hahn’s Theorem
Reed Solomon (UConn)

Connecticut Logic Seminar
Computable structures of Scott rank $\\omega_1^{CK}$
Julia Knight (Notre Dame)

Connecticut Logic Seminar
Model completeness and relative decidability of countable structures
Reed Solomon (UConn)

Connecticut Logic Seminar
Uniform bounds in some lexico products
Philip Scowcroft (Wesleyan)

Connecticut Logic Seminar
Joins in the strong Weihrauch degrees
Damir Dzhafarov (UConn)

Connecticut Logic Seminar
A transdisciplinary aspect of infinite time Turing machines
Sabrina Ouazzani (Ecole Polytechnique)

Connecticut Logic Seminar
An introduction to Ramsey-theoretic dividing lines in model theory
Cameron Hill (Wesleyan)