相关论文: Continuous Fraisse Conjecture
Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…
A number of model-comparison games central to (finite) model theory, such as pebble and Ehrenfeucht-Fra\"{i}ss\'{e} games, can be captured as comonads on categories of relational structures. In particular, the coalgebras for these comonads…
We classify up to coarse equivalence all countable abelian groups of finite torsion free rank. The Q-cohomological dimension and the torsion free rank are the two invariants that give us such classification. We also prove that any countable…
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…
We consider approximations of a continuous function on a countable normed Fr\'{e}chet space by analytic and $*$-analytic. Also we found a criterium of the existence of an extension of a continuous function from a dense subspace of a…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
We show that sheet closures appear as associated varieties of affine vertex algebras. Further, we give new examples of non-admissible affine vertex algebras whose associated variety is contained in the nilpotent cone. We also prove some…
In what follows, essentially two things will be accomplished: Firstly, it will be proven that a version of the Arzel\`a--Ascoli theorem and the Fr\'echet--Kolmogorov theorem are equivalent to the axiom of countable choice for subsets of…
We survey discrete and continuous model-theoretic notions which have important connections to general topology. We present a self-contained exposition of several interactions between continuous logic and $C_p$-theory which have applications…
We show that every countable Borel equivalence relation structurable by $n$-dimensional contractible simplicial complexes embeds into one which is structurable by such complexes with the further property that each vertex belongs to at most…
The aim of this paper is to to show the admissibility of some class of Frechet spaces (see Definition 2.3). In particular, this generalizes the main results of [3]. As an application, we show the admissibility of a large class modular…
We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…
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…
We prove that, for every theory $T$ which is given by an ${\mathcal L}_{\omega_1,\omega}$ sentence, $T$ has less than $2^{\aleph_0}$ many countable models if and only if we have that, for every $X\in 2^\omega$ on a cone of Turing degrees,…
We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).
We show that the Dual Borel Conjecture implies that ${\mathfrak d}> \aleph_1$ and find some topological characterizations of perfectly meager and universally meager sets.
We show that quasi-projective relation algebras and directed cylindric algebras are equivalent categorialy. We work out a Godels second incompleteness theorem for finite varibale fragments of first order logic. We show that distinct set…
A sibling of a relational structure $R$ is any structure $S$ which can be embedded into $R$ and, vice versa, in which $R$ can be embedded. Let $sib(R)$ be the number of siblings of $R$, these siblings being counted up to isomorphism.…