English
Related papers

Related papers: Cohen-like first order structures

200 papers

We investigate some versions of amoeba for tree-forcings in the generalized Cantor and Baire spaces. This answers [10, Question 3.20] and generalizes a line of research that in the standard case has been studied in [11], [13], and [7].…

Logic · Mathematics 2020-08-13 Giorgio Laguzzi

We show that in an ultraproduct of finite fields, the mod-$n$ nonstandard size of definable sets varies definably in families. Moreover, if $K$ is any pseudofinite field, then one can assign "nonstandard sizes mod $n$" to definable sets in…

Logic · Mathematics 2019-12-17 Will Johnson

We revisit Kolchin's results on definability of differential Galois groups of strongly normal extensions, in the case where the field of constants is not necessarily algebraically closed. In certain classes of differential topological…

Logic · Mathematics 2017-05-17 Quentin Brouette , Francoise Point

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard

Let $X$ be a Banach space. We study the circumstances under which there exists an uncountable set $\mathcal A\subset X$ of unit vectors such that $\|x-y\|>1$ for distinct $x,y\in \mathcal A$. We prove that such a set exists if $X$ is…

Functional Analysis · Mathematics 2016-10-26 Tomasz Kania , Tomasz Kochanek

We sow that there exists a generic extension of the G\"{o}del's constructible universe in which diamond holds and there exists a subset $Y \subseteq \omega_1$ such that for stationary many $\delta < \omega_1,$ the set $Y \cap \delta$ is not…

Logic · Mathematics 2023-11-07 Mohammad Golshani , Saharon Shelah

We investigate extension of a measure to a very general set of undetermined structure. Structure may be imposed on this set in special cases

Functional Analysis · Mathematics 2008-02-14 Peter S Chami , Norris Sookoo

We study pushdown systems where control states, stack alphabet, and transition relation, instead of being finite, are first-order definable in a fixed countably-infinite structure. We show that the reachability analysis can be addressed…

Formal Languages and Automata Theory · Computer Science 2015-07-20 Lorenzo Clemente , Sławomir Lasota

We study classes of graded structures satisfying the properties of amalgamation, joint embedding and hereditariness. Given appropriate conditions, we can build a graded analogue of the Fraisse limit. Some examples such as the class of all…

Logic · Mathematics 2018-09-24 Guillermo Badia , Carles Noguera

We study the possible structures which can be carried by sets which have no countable subset, but which fail to be `surjectively Dedekind finite', in two possible senses, that there is a surjection to $\omega$, or alternatively, that there…

Logic · Mathematics 2025-09-17 Supakun Panasawatwong , J K Truss

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

Logic · Mathematics 2008-06-04 Wesley Calvert

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

Combinatorics · Mathematics 2026-04-22 Victoria Ironmonger , Nik Ruškuc

Different group structures which underline the integrable systems are considered. In some cases, the quantization of the integrable system can be provided with substituting groups by their quantum counterparts. However, some other group…

High Energy Physics - Theory · Physics 2007-05-23 A. Mironov

We define and study two classes of uncountable $\subseteq^*$-chains: Hausdorff towers and Suslin towers. We discuss their existence in various models of set theory. Then, some of the results and methods are used to provide examples of…

Logic · Mathematics 2014-10-01 Piotr Borodulin-Nadzieja , David Chodounský

We provide a self-contained introduction to the classical theory of universal-homogeneous models (also known as generic structures, rich models, or Fra\"iss\'e limits). In the literature, most treatments restrict consideration to embeddings…

Logic · Mathematics 2010-09-10 Silvia Barbina , Domenico Zambella

We define coarse proximity structures, which are an analog of small-scale proximity spaces in the large-scale context. We show that metric spaces induce coarse proximity structures, and we construct a natural small-scale proximity…

Metric Geometry · Mathematics 2024-04-16 Pawel Grzegrzolka , Jeremy Siegert

We formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper generic extension and show that the latter also satisfies…

Logic in Computer Science · Computer Science 2020-04-21 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

We study the Vapnik-Chervonenkis (VC) density of definable families in certain stable first-order theories. In particular we obtain uniform bounds on VC density of definable families in finite U-rank theories without the finite cover…

Logic · Mathematics 2016-02-10 M. Aschenbrenner , A. Dolich , D. Haskell , D. Macpherson , S. Starchenko

We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every (possibly infinite) regular set F of finite…

Combinatorics · Mathematics 2013-03-05 Jan Hubička , Jaroslav Nešetřil