10 citations · 22 across the 20 of their papers we have counts for
22 papers
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He +8
These open problems were presented in the Problem Sessions held during the Tianyuan Workshop on Definability and Computation, June 22-26, 2026. The problems are organized into sect…
Countable ranks at the first and second projective levels
Merlin Carl, Philipp Schlicht, Philip Welch
A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the s…
Asymmetric cut and choose games
Peter Holy, Philipp Schlicht, Christopher Turner +1
We investigate a variety of cut and choose games, their relationship with (generic) large cardinals, and show that they can be used to characterize a number of properties of ideals…
When cardinals determine the power set: inner models and Härtig quantifier logic
Jouko Väänänen, Philip Welch
We make use of some observations on the core model, for example assuming , and that there is no inner model with a Woodin cardinal, and is an inner model with the sa…
Characterisations of Variant Transfinite Computational Models: Infinite Time Turing, Ordinal Time Turing, and Blum-Shub-Smale machines
Philip Welch
We consider how changes in transfinite machine architecture can sometimes alter substantially their capabilities. We approach the subject by answering three open problems touching…
Decision times of infinite computations
Merlin Carl, Philipp Schlicht, Philip Welch
The decision time of an infinite time algorithm is the supremum of its halting times over all real inputs. The decision time of a set of reals is the least decision time of an algo…