Logic Seminar in AY 2026/2027 at NUS
The usual meeting time and place in Semester I is as follows:
Wednesday, 17:00-18:00 hrs,
either Zoom (speaker currently overseas) or S17#04-04 (speaker in Singapore).
- Wednesday 12/08/2026, 17:00 hrs, Week 1,
Department of Mathematics, Room S17#04-04.
Wang Wei. Iterated jumps of perfect subtrees
of positive trees.
Talk announcement.
- Wednesday 19/08/2026, 17:00 hrs, Week 2,
Department of Mathematics, Room S17#04-04.
Clement Yung. Weak A2 spaces, the Kastanas game and strategically
Ramsey sets.
In the past century, the insight behind the original Ramsey's theorem
proved to be applicable to a wide range of mathematics, such as
number theory, functional analysis and topology. This spurred two
particular directions of Ramsey theory: The first one is known as
topological Ramsey theory, a general procedure developed by Carlson
and Simpson to prove many seemingly unrelated Ramsey's theorem-like
results. The second one is the Ramsey theory of Banach spaces,
kickstarted by Gowers' unexpected application of Ramsey theory
to resolve a long-standing open problem in Banach space theory.
In this talk, I introduce the theory of weak A2 spaces, which serves
as a possible intersection between these two Ramsey theories and
discuss how several infinite games that appeared in these Ramsey
theories (the Kastanas game, the Gowers game and the asymptotic game)
are closely related.
- Wednesday 26/08/2026, 17:00 hrs, Week 3,
Department of Mathematics, Room S17#04-04.
Rod Downey. The geometry of computable Banach spaces.
A computable Banach space X = (X, || · ||, +, ·) is a Banach space with
a computable dense sequence of points which makes X a computable metric
space using the norm, for which the operations are computable functions.
Most, but not all, familiar spaces of analysis and physics commonly
met are such spaces. In the same way as classical vector space theory
revolves around
(Hamel) bases, Banach spaces are best understood using what is called a
Schauder basis. There are many, many questions around this concept, both
classically and in the effective content.
In this talk I will overview many of the questions and results we have
so far, and particularly report on some recent work seeking to understand
the effective content of Kadets’ Theorem, which states (more or less) that
all infinite dimensional Banach spaces look the same if we forget the norm:
any two infinite-dimensional, separable Banach spaces are homeomorphic as
topological spaces. Surprisingly, this result can be proven for computable
Banach spaces using only the halting problem, which seems rare in effective
topology.
- Wednesday 02/09/2026, 16:00 hrs Week 4,
Department of Mathematics, Room S17#04-05.
Eric Walsberg,
Trace definability and model-theoretic linearity.
I will introduce trace definability between first order structures /
theories and explain how it can be used to give dichotomies
between linearity and field structure in certain settings.
- Wednesday 02/09/2026, 17:00 hrs Week 4
Department of Mathematics, Room S17#04-04.
Roy Shalev. The small Dowker space problem.
It is well-known that the product of two normal topological
spaces need not be normal, but what about the normality of the
product of a normal space X with the unit interval [0, 1]?
A counterexample space X is called a "Dowker space". In 1971,
Rudin proved that such a space exists, but it remains open whether
there must exist a Dowker space of size ℵ1.
In this talk, I shall report on a joint work with Rinot and
Todorčević in which we present a weak sufficient condition
for the existence of a small Dowker space.
- Wednesday 09/09/2026, 17:00 hrs, Week 5,
Department of Mathematics, Room S17#04-04.
No talk.
- Wednesday 16/09/2026, 17.00 hrs, Week 6,
Department of Mathematics, Room S17#04-04.
Nikolay Bazhenov. On computable Stone-type dualities.
In recent years, there has been renewed interest in the
algorithmic aspects of various Stone-type dualities. For instance,
Harrison-Trainor, Melnikov and Ng (2020) proved that a Boolean
algebra B has a computable isomorphic copy if and only if its dual
Stone space St(B) is homeomorphic to a computable Polish space.
In this talk, following the approach of Ershov and Schwidefsky,
we work with effective presentations of topological
T0-spaces with base. We establish a computable
version of a Stone-type duality due to Schwidefsky (2023),
and we discuss its applications in computable topology.
This is joint work with Iskander Kalimullin and Marina Schwidefsky.
- Wednesday 23/09/2026, 17.00 hrs, Week 6,
Department of Mathematics, Room S17#04-04.
Péter Komjáth. Ramsey theorems for graphs.
- Wednesday 30/09/2026, 17:00 hrs, Week 7,
Department of Mathematics, Room S17#04-04.
No Talk.
- Wednesday 07/10/2026, 17:00 hrs, Week 8,
Department of Mathematics, Room S17#04-04.
Neil Barton and Zachary Goodsell.
On the Consistency of Continuum Contingency.
In light of the development of forcing, philosophers and
mathematicians have wondered whether the truths of mathematics
might be contingent. This talk investigates that idea in the
framework of higher-order logic. Our main result is that
forcing-related contingency (e.g., contingency of the
continuum hypothesis) is consistent in the higher-order
logic Bacon and Dorr call ``Classicism + Rigid Comprehension'',
which permits quantification over both properties and modally
rigid classes.
- Wednesday 14/10/2026, 17:00 hrs, Week 9,
Department of Mathematics, Room S17#04-04.
Jia Zekun. η-Maximal sets: From weak arithmetic to
ordinal recursion theory
Post's program asks for a structural thinness property of the
complement of an r.e. set that forces Turing incompleteness.
The program seemed to collapse when Yates built a complete maximal set.
In the 1970s, Dëgtev and Marchenkov revived it by relativizing
Post's notions to an r.e. equivalence relation η:
nonrecursive r.e. semirecursive η-maximal sets exist
and every such set is Turing incomplete. The existence
of maximal sets is strong.
It is equivalent to IΣ over
PA+BΣ2 (Chong–Yang),
and for admissible α, it holds exactly when the
S3-projectum of α is &omega: (Lerman).
Downey conjectured that η-maximal sets are easier to obtain.
In my previous talk, I showed that
PA- + IΣ2 proves they exist.
This talk extends that result in two directions. In each,
η-maximal sets turn out to be no harder to build than
Friedberg–Muchnik pairs, up to the best current results.
In reverse recursion theory,
PA- + IΣ0 + BΣ2 + EXP,
the theory in which Chong and Mourad proved the Friedberg–Muchnik theorem,
proves the existence of a nonrecursive r.e. semirecursive η-maximal
set. Moreover, we will outline how a Post-style solution to
Post's problem can be carried out in this theory by bypassing
the classical detour through η-hyperhypersimplicity.
In ordinal recursion theory, we show that every limit ordinal β
admits a β-r.e. equivalence relation η and a
non-β-recursive β-r.e. η-maximal set A.
When the Σ1-cofinality of β is at
least its Σ1-projectum (in particular, when
β is admissible), both A and the graph of η can be made
regular, tame and strongly β-r.e. This is the same hypothesis
under which Friedman obtained regular, strongly β-r.e.
Friedberg–Muchnik pairs under <wβ.
When the Σ1-cofinality of β is less than its
Σ1-projectum, the Friedberg–Muchnik theorem with
respect to ≤wβ is generally false and the same theorem
with respect to ≤β remains open.
- Wednesday 21/10/2026, 17:00 hrs, Week 10,
Department of Mathematics, Room S17#04-04.
Nurlan Markhabatov. On model-theoretic properties of
pseudofinite unars.
This talk investigates model-theoretic properties of pseudofinite
unars (where a unar is an algebra with a single unary operation).
A criterion for the uncountable categoricity of pseudofinite
unar theories is obtained. Examples of pseudofinite unar theories
are constructed that are superstable but not ω-stable,
ω-stable but not strongly minimal, and
ω-stable but not uncountably categorical.
It is also shown that the theory of every bounded unar is
pseudofinite and ω-stable. During the talk, we will
also attempt to formulate a general criterion for the
pseudofiniteness of unars.
- Wednesday 28/10/2026, 17.00 hrs, Week 11,
Department of Mathematics, Room S17#04-04.
Ye Jinhe.
Regular Inverse Galois Problems over fields avoiding a curve.
The classical inverse Galois problem asks whether every finite group
occurs as a Galois group over Q. A geometric generalization
is the regular inverse Galois problem over a field K, which asks
for regular realizations over K(t). For K = Q,
such realizations yield solutions to the classical problem by
Hilbert irreducibility. While the regular inverse Galois problem
remains open over Q, it is known to have a positive solution
over large fields. In this talk, I will discuss a positive solution
over curve-excluding fields, which are existentially closed among
fields avoiding a fixed curve and provide a class of non-large
fields over which the problem can be solved.
- Thursday 29/10/2026, 10 hrs, Week 11,
Department of Mathematics, Room S17#04-06.
Jia Zekun. Gödel's Rotating Universe: Causal Structure,
Philosophy of time and Relativistic Hypercomputation.
In 1949 Kurt Gödel published a rotating cosmological solution
of Einstein's field equations, containing closed timelike curves
through every event and admitting no global time function.
The model is usually divided among disciplines: philosophers
discuss its challenge to objective temporal becoming,
physicists treat it as an exotic exact solution
and logicians rarely connect it with Gödel's broader
philosophical commitments. This talk brings these strands together.
After introducing the model, we trace its afterlife in physics,
from the causal hierarchy to chronology protection,
then situate it within Gödel's philosophical project:
his realism, his modal reasoning and his conception of
objective existence. We conclude with a less familiar connection
to Malament–Hogarth spacetimes, which appear to permit relativistic
hypercomputation and thereby to threaten Gödel's belief in
the absoluteness of computability. We argue that they challenge
the physical Church–Turing thesis, leaving untouched the
formalism-independent mathematical concept of computability
Gödel regarded as absolute.
This is joint work with An Xinliang and Yang Yue.
- Wednesday 04/11/2026, 17:00 hrs, Week 12,
Department of Mathematics, Room S17#04-04.
Josiah Jacobsen-Grocott.
Definable classes in the weak Turing degrees.
Weak Turing (WT) reducibility was introduced by Davis as a way of
extending Turing reducibility to partial functions. This degree
structure was further studied by Sasso, who coined the term
``weak Turing reducibility'' and compared it to the enumeration
reducibility. Sasso proved that the enumeration degrees are
isomorphic to an initial segment of the WT-degrees among other results.
In this talk we will show how tools used to answer definability
questions in the e-degrees, can be translated to the WT-degrees
to answer some of Sasso's questions about the structure,
including the definability of the initial segment isomorphic
to the e-degrees.
This is joint work with Liling Ko and Keng Meng Ng.
This talk is moved to the next semester and was replaced by an
in-promptu talk of Tran Chieu Minh, as the speaker was ill.
- Wednesday 11/11/2026, 17:00 hrs, Week 13,
Department of Mathematics, Room S17#04-04.
Kyle Gannon. Random theories (and where we find them).
In model theory, and in logic more broadly, we are often interested
in the first-order theory of a given mathematical structure.
Probabilistic constructions, however, typically produce not
a single structure but a random one. For example, the first-order
theory obtained by percolating edges on a graph may depend
on the particular outcome of the percolation. This project
addresses this issue by introducing a syntactic object,
a random theory, associated with random constructions.
We argue that random theories accurately encode the
first-order consequences of such constructions.
In this talk, we will focus on the basic definitions and
examples surrounding these ideas.
This is currently ongoing research with Nikolay Bazhenov and Sam Braunfeld.
Talks from the
previous academic years.