2 citations · 3 across the 4 of their papers we have counts for
4 papers · 1 filter
P not= NP for infinite time Turing machines
Ralf Schindler
We state a version of the P=?NP problem for infinite time Turing machines. It is observed that P not= NP for this version.
\nabla_κ, remarkable cardinals, and 0^#
Ralf Schindler
For an uncountable regular cardinal κwe let \nabla_κ(A) be the statement that A \subset κand for all regular θ> κ, the set of all X \in [θ]^<κsuch that X \cap κ\in κand otp(X \cap…
Iterations of V and the core model
Ralf Schindler
Answering a question which was around for some while we prove that if π: V -> M is such that M is transitive and closed under ω-sequences then the core model of M is an iterate of…
More on mutual stationarity
Ralf Schindler
Extending a result of Foreman and Magidor we prove that in the core model for almost linear iterations the following holds. There is a sequence (S^n_α: n<ω,α>0) such that each indi…