Related papers: Cohen-like first order structures
In this paper we show that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. The necessary prerequisite…
We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are…
Measures generated by Iterated Function Systems composed of uncountably many one--dimensional affine maps are studied. We present numerical techniques as well as rigorous results that establish whether these measures are absolutely or…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
We investigate Hindman- and Owings-type Ramsey-theoretic statements in Zermelo-Fraenkel set theory without the Axiom of Choice, with some occasional extra assumptions (such as the Axiom of Dependent Choice and/or the Axiom of Determinacy).…
A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set-forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class-forcing extension which…
This paper establishes a classification of the critical numbers for restricted sumsets in finite abelian groups, determining them exactly for even-order groups and bounding them for odd-order groups, while revealing a fundamental structural…
Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…
In order to introduce the notion of causality in noncommutative geometry it is necessary to extend Gelfand theory to the context of ordered spaces. In a previous work we have already given an algebraic caracterization of the set of…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
We verify a conjecture of Vershik by showing that Hall's universal countable locally finite group can be embedded as a dense subgroup in the isometry group of the Urysohn space and in the automorphism group of the random graph. In fact, we…
We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…
The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…
The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…
The late-time cosmological dynamics of disformal gravity are investigated using dynamical systems methods. It is shown that in the general case there are no stable attractors that screen fifth-forces locally and simultaneously describe a…
Given any countable group $G$, we construct uncountably many quasi-isometry classes of proper geodesic metric spaces with quasi-isometry group isomorphic to $G$. Moreover, if the group $G$ is a hyperbolic group, the spaces we construct are…
We study the universal cover of the complex one-dimensional torus as a model-theoretic structure in a natural language. We consider also abstract covers of one-dimensional tori over algebraically closed fields of characteristic zero. The…
When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…
Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of the non-uniform quantified constraint satisfaction problem…