Eyal Kaplan

dblp:76/1724 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
4since 2021 · last 2026
0000-0001-5315-6154ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 3 first-author · 4 since 2021
YearPublicationVenuePosition
2026 A note on the Ketonen order and Lipschitz reducibility between ultrafilters
Eyal Kaplan
Ann. Pure Appl. Log.1
2025 On Easton Support Iteration of Prikry-Type forcing Notions
abstract
Abstract We consider of constructing normal ultrafilters in extensions are here Easton support iterations of Prikry-type forcing notions. New ways presented. It turns out that, in contrast with other supports, seemingly unrelated measures or extenders can be involved here.
Moti Gitik, Eyal Kaplan
J. Symb. Log.2
2023 Non-stationary support iterations of Prikry forcings and restrictions of ultrapower embeddings to the ground model
abstract
We continue the study started in [2] and characterize j ↾ V , where j : V [ G ] → M [ H ] is an ultrapower embedding by a normal ultrafilter after a non-stationary support iteration of Prikry forcings.
Moti Gitik, Eyal Kaplan
Ann. Pure Appl. Log.2
2023 On Restrictions of Ultrafilters From Generic Extensions To Ground Models
abstract
Let P be a forcing notion and $G\subseteq P$ its generic subset. Suppose that we have in $V[G]$ a $\kappa{-}$ complete ultrafilter1,2W over $\kappa $ . Set $U=W\cap V$ .
Moti Gitik, Eyal Kaplan
J. Symb. Log.2
2009 Derandomized Constructions of k-Wise (Almost) Independent Permutations
Eyal Kaplan, Moni Naor, Omer Reingold
Algorithmica1
2005 Derandomized Constructions of k-Wise (Almost) Independent Permutations
Eyal Kaplan, Moni Naor, Omer Reingold
APPROX-RANDOM1