Related papers: Cohen-like first order structures
We study the existence of uncountable first-order structures that are homogeneous with respect to their finitely generated substructures. In many classical cases this is either well-known or follows from general facts, for example, if the…
Building on the work of Avraham, Rubin, and Shelah, we aim to build a variant of the Fra\"iss\'e theory for uncountable models built from finite submodels. With this aim, we generalize the notion of an increasing set of reals to other…
Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…
We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…
We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…
Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…
In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…
I prove several theorems concerning upward closure and amalgamation in the generic multiverse of a countable transitive model of set theory. Every such model $W$ has forcing extensions $W[c]$ and $W[d]$ by adding a Cohen real, which cannot…
In this paper I introduce a new and intuitive first-order foundational theory (where the concept of set is not primitive) and use it to show that the power set of an infinite set does not exist. In particular, proofs of uncountability of a…
We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…
We study rigidity properties of linearly ordered sets (chains) under automorphisms, order-embeddings, epimorphisms, and endomorphisms. We focus on two main cases, dense subchains of the real numbers, and uncountable dense chains of higher…
Given a countable model of set theory, we study the structure of its generic multiverse, the collection of its forcing extensions and ground models, ordered by inclusion. Mostowski showed that any finite poset embeds into the generic…
Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…
We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by…
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…
We present three examples of countable homogeneous structures (also called Fraisse limits) whose automorphism groups are not universal, namely, fail to contain isomorphic copies of all automorphism groups of their substructures. Our first…
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…