Nadav Meir

dblp:167/9969 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
3since 2021 · last 2022
0000-0002-7774-2892ORCID · corroborated

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

Theory of computation · 4 · 4 first-author · 3 since 2021
YearPublicationVenuePosition
2022 Infinite lexicographic products
Nadav Meir
Ann. Pure Appl. Log.1
2022 Pseudo-finite Sets, Pseudo-O-Minimality - erratum
Nadav Meir
J. Symb. Log.1
2021 Pseudo-finite Sets, Pseudo-O-Minimality
abstract
Abstract We give an example of two ordered structures $\mathcal {M},\mathcal {N}$ in the same language $\mathcal {L}$ with the same universe, the same order and admitting the same one-variable definable subsets such that $\mathcal {M}$ is a model of the common theory of o-minimal $\mathcal {L}$ -structures and $\mathcal {N}$ admits a definable, closed, bounded, and discrete subset and a definable injective self-mapping of that subset which is not surjective. This answers negatively two question by Schoutens; the first being whether there is an axiomatization of the common theory of o-minimal structures in a given language by conditions on one-variable definable sets alone. The second being whether definable completeness and type completeness imply the pigeonhole principle. It also partially answers a question by Fornasiero asking whether definable completeness of an expansion of a real closed field implies the pigeonhole principle.
Nadav Meir
J. Symb. Log.1
2016 On Products of Elementarily indivisible Structures
abstract
Abstract We say a structure ${\cal M}$ in a first-order language ${\cal L}$ is indivisible if for every coloring of its universe in two colors, there is a monochromatic substructure ${\cal M}\prime \subseteq {\cal M}$ such that ${\cal M}\prime \cong {\cal M}$ . Additionally, we say that ${\cal M}$ is symmetrically indivisible if ${\cal M}\prime$ can be chosen to be symmetrically embedded in ${\cal M}$ (that is, every automorphism of ${\cal M}\prime$ can be extended to an automorphism of ${\cal M}$ ). Similarly, we say that ${\cal M}$ is elementarily indivisible if ${\cal M}\prime$ can be chosen to be an elementary substructure. We define new products of structures in a relational language. We use these products to give recipes for construction of elementarily indivisible structures which are not transitive and elementarily indivisible structures which are not symmetrically indivisible, answering two questions presented by A. Hasson, M. Kojman, and A. Onshuus.
Nadav Meir
J. Symb. Log.1