We investigate the development of terms during cut-elimination in first-order logic and Peano arithmetic for proofs of existential formulas. The form of witness terms in cut-free p...
Let M be a premouse with a top extender, F. Suppose that (a) M is linearly coarsely iterable via hitting F and its images, and (b) if M is a linear iterate of M as in (a), then M ...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realiz...
Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russ...
We give some restrictions for the search for a model of the club principle with no Souslin trees. We show that (2, [], is almost constant on) together with CH and "all Aronsza...