Omer Ben-Neria
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Omer Ben-Neria has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Yair Hayut
Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem, Israel
6 shared publications - Shimon Garti
Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem, Israel
5 shared publications - Itay Kaplan
Einstein Institute of Mathematics, Hebrew University of Jerusalem, 91904, Jerusalem, Israel
3 shared publications - Jing Zhang
University of Toronto
2 shared publications - Philipp Lücke
Fachbereich Mathematik Universität Hamburg Hamburg Germany
2 shared publications - Pierre Simon
Mathematics Department, University of California, Berkeley, Evans Hall Berkeley, CA, 94720-3840, USA
2 shared publications
Latest Publications
- Open Access
Jonsson and Magidor filters
We study the filter versions of square bracket partition relations, focusing on Jonssonicity and Magidority. We show that the singular cardinals in a Kleinberg sequence above some strong partition cardinal are not Magidor, but the limit of the sequence is Magidor. This is done under AD. We also force over a model of AD to obtain a singular cardinal carrying a Magidor filter.
Open AccessJonsson and Magidor filters
We study the filter versions of square bracket partition relations, focusing on Jonssonicity and Magidority. We show that the singular cardinals in a Kleinberg sequence above some strong partition cardinal are not Magidor, but the limit of the sequence is Magidor. This is done under AD. We also force over a model of AD to obtain a singular cardinal carrying a Magidor filter.
- Open Access
- 14 January 2025
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 78 (3) , 769-801
On upper Sigma 1 $\Sigma _1$ -definable closed unbounded setsDefinable stationary sets, and specifically, ordinal definable ones, play a significant role in the study of canonical inner models of set theory and the class HOD of hereditarily ordinal definable sets. Fixing a certain notion of definability and an uncountable cardinal, one can consider the associated family of definable closed unbounded sets. In this paper, we study the extent to which such families can approximate the full closed unbounded filter and their dependence on the defining complexity. Focusing on closed unbounded subsets of a cardinal kappa $\kappa $ which are upper Sigma 1 $\Sigma _1$ -definable in parameters from H Subscript kappa $ _\kappa $ and ordinal parameters, we show that the ability of such closed unbounded sets to well approximate the closed unbounded filter on kappa $\kappa $ can highly vary and strongly depends on key properties of the underlying universe of set theory.- 14 January 2025
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 78 (3) , 769-801
Open AccessOn upper Sigma 1 $\Sigma _1$ -definable closed unbounded setsDefinable stationary sets, and specifically, ordinal definable ones, play a significant role in the study of canonical inner models of set theory and the class HOD of hereditarily ordinal definable sets. Fixing a certain notion of definability and an uncountable cardinal, one can consider the associated family of definable closed unbounded sets. In this paper, we study the extent to which such families can approximate the full closed unbounded filter and their dependence on the defining complexity. Focusing on closed unbounded subsets of a cardinal kappa $\kappa $ which are upper Sigma 1 $\Sigma _1$ -definable in parameters from H Subscript kappa $ _\kappa $ and ordinal parameters, we show that the ability of such closed unbounded sets to well approximate the closed unbounded filter on kappa $\kappa $ can highly vary and strongly depends on key properties of the underlying universe of set theory. - Open Access
On $Σ_1$-Definable Closed Unbounded Sets
Definable stationary sets, and specifically, ordinal definable ones, play a significant role in the study of canonical inner models of set theory and the class HOD of hereditarily ordinal definable sets. Fixing a certain notion of definability and an uncountable cardinal, one can consider the associated family of definable closed unbounded sets. In this paper, we study the extent to which such families can approximate the full closed unbounded filter, and their dependence on the defining complexity. Focusing on closed unbounded subsets of a cardinal $κ$ which are $Σ_1$-definable in parameters from $H_κ$ and ordinal parameters, we show that the ability of such closed unbounded sets to well approximate the closed unbounded filter on $κ$ can highly vary, and strongly depends on key properties of the underlying universe of set theory.Open AccessOn $Σ_1$-Definable Closed Unbounded Sets
Definable stationary sets, and specifically, ordinal definable ones, play a significant role in the study of canonical inner models of set theory and the class HOD of hereditarily ordinal definable sets. Fixing a certain notion of definability and an uncountable cardinal, one can consider the associated family of definable closed unbounded sets. In this paper, we study the extent to which such families can approximate the full closed unbounded filter, and their dependence on the defining complexity. Focusing on closed unbounded subsets of a cardinal $κ$ which are $Σ_1$-definable in parameters from $H_κ$ and ordinal parameters, we show that the ability of such closed unbounded sets to well approximate the closed unbounded filter on $κ$ can highly vary, and strongly depends on key properties of the underlying universe of set theory. - 16 March 2024
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 175 (7)
Approachable free subsets and fine structure derived scales
- 16 March 2024
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 175 (7)
Approachable free subsets and fine structure derived scales
- Open Access
- 4 December 2023
- Published by Cambridge University Press (CUP) in Journal of the Institute of Mathematics of Jussieu
- Vol. 23 (5) , 2159-2173
ON LARGE EXTERNALLY DEFINABLE SETS IN NIP
We study cofinal systems of finite subsets of $\omega _1$ . We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: In an NIP theory, any uncountable externally definable set contains an infinite definable subset. A similar result holds for larger cardinals.- 4 December 2023
- Published by Cambridge University Press (CUP) in Journal of the Institute of Mathematics of Jussieu
- Vol. 23 (5) , 2159-2173
Open AccessON LARGE EXTERNALLY DEFINABLE SETS IN NIP
We study cofinal systems of finite subsets of $\omega _1$ . We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: In an NIP theory, any uncountable externally definable set contains an infinite definable subset. A similar result holds for larger cardinals. - Open Access
- 27 October 2023
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 89 (1) , 1-26
STATIONARY REFLECTION AND THE FAILURE OF THE SCH
In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal such that the singular cardinal hypothesis fails at and every collection of fewer than cf() stationary subsets of + reflects simultaneously. For cf() > , this situation was not previously known to be consistent. Using different methods, we reduce the upper bound on the consistency strength of this situation for cf() = to below a single partially supercompact cardinal. The previous upper bound of infinitely many supercompact cardinals was due to Sharon.
- 27 October 2023
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 89 (1) , 1-26
Open AccessSTATIONARY REFLECTION AND THE FAILURE OF THE SCH
In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal such that the singular cardinal hypothesis fails at and every collection of fewer than cf() stationary subsets of + reflects simultaneously. For cf() > , this situation was not previously known to be consistent. Using different methods, we reduce the upper bound on the consistency strength of this situation for cf() = to below a single partially supercompact cardinal. The previous upper bound of infinitely many supercompact cardinals was due to Sharon.
- Open Access
Stationary Reflection and the failure of SCH
In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal $\nu$ such that the singular cardinal hypothesis fails at $\nu$ and every collection of fewer than $\mathrm{cf}(\nu)$ stationary subsets of $\nu^+$ reflects simultaneously. For $\mathrm{cf}(\nu) > \omega$, this situation was not previously known to be consistent. Using different methods, we reduce the upper bound on the consistency strength of this situation for $\mathrm{cf}(\nu) = \omega$ to below a single partially supercompact cardinal. The previous upper bound of infinitely many supercompact cardinals was due to Sharon.Open AccessStationary Reflection and the failure of SCH
In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal $\nu$ such that the singular cardinal hypothesis fails at $\nu$ and every collection of fewer than $\mathrm{cf}(\nu)$ stationary subsets of $\nu^+$ reflects simultaneously. For $\mathrm{cf}(\nu) > \omega$, this situation was not previously known to be consistent. Using different methods, we reduce the upper bound on the consistency strength of this situation for $\mathrm{cf}(\nu) = \omega$ to below a single partially supercompact cardinal. The previous upper bound of infinitely many supercompact cardinals was due to Sharon. - 4 August 2023
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 63 (1-2) , 119-134
A Mathias criterion for the Magidor iteration of Prikry forcings
- 4 August 2023
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 63 (1-2) , 119-134
A Mathias criterion for the Magidor iteration of Prikry forcings
- Open Access
On large externally definable sets in NIP
We study cofinal systems of finite subsets of $\omega_1$. We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: in an NIP theory, any uncountable externally definable set contains an infinite definable subset. A similar result holds for larger cardinals.Open AccessOn large externally definable sets in NIP
We study cofinal systems of finite subsets of $\omega_1$. We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: in an NIP theory, any uncountable externally definable set contains an infinite definable subset. A similar result holds for larger cardinals. - 19 May 2023
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 376 (8) , 5923-5948
Approximating diamond principles on products at an inaccessible cardinal
We isolatethe approximating diamond principles, which are consequences of the diamond principle at an inaccessible cardinal. We use these principles to find new methods for negating the diamond principle at large cardinals. Most notably, we demonstrate, using Gitik’s overlapping extenders forcing, a new method to get the consistency of the failure of the diamond principle at a large cardinalwithout changing cofinalities or adding fast clubs to . In addition, we show that the approximating diamond principles necessarily hold at a weakly compact cardinal. This result, combined with the fact that in all known models where the diamond principle fails the approximating diamond principles also fail at an inaccessible cardinal, exhibits essential combinatorial obstacles to make the diamond principle fail at a weakly compact cardinal. - 19 May 2023
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 376 (8) , 5923-5948
Approximating diamond principles on products at an inaccessible cardinal
We isolatethe approximating diamond principles, which are consequences of the diamond principle at an inaccessible cardinal. We use these principles to find new methods for negating the diamond principle at large cardinals. Most notably, we demonstrate, using Gitik’s overlapping extenders forcing, a new method to get the consistency of the failure of the diamond principle at a large cardinalwithout changing cofinalities or adding fast clubs to . In addition, we show that the approximating diamond principles necessarily hold at a weakly compact cardinal. This result, combined with the fact that in all known models where the diamond principle fails the approximating diamond principles also fail at an inaccessible cardinal, exhibits essential combinatorial obstacles to make the diamond principle fail at a weakly compact cardinal.