Related papers: Epimorphisms, definability and cardinalities

We generalize the prequantization central extension of a group of diffeomorphisms preserving a closed 2-form \omega (\omega-invariant diffeomorphisms) to an abelian extension of a group of diffeomorphisms preserving a closed vector valued…

We introduce the notion of \emph{topo-symmetric extensions} of topological groups, a new generalization of classical group extensions that incorporates both topological and symmetry constraints. We define morphisms between such extensions,…

We classify the propositional modal validities arising from the category of sets under its natural classes of morphisms. The resulting validities depend on the morphism class, the size of the world, and the permitted substitution instances.…

Without leaving finite mathematics and using finite topological spaces only, we give a definition of homeomorphisms of finite abstract simplicial complexes or finite graphs. Besides exploring the definition in various contexts, we add some…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Let lambda be aleph_0 or a strong limit of cofinality aleph_0. Suppose that (G_m,p_{m,n}:m =< n<omega) and (H_m,p^t_{m,n}: m=< n < omega) are projective systems of groups of cardinality less than lambda and suppose that for every n<omega…

We work in a first-order setting where structures are spread out over a metric space, with quantification allowed only over bounded subsets. Assuming a doubling property for the metric space, we define a canonical {\em core} $\mathcal{J}$…

We prove completeness, interpolation and omitting types for certain predicate topological logics that properly extend the first order case. We aslo count the non isomorphic topological models of a countable theory

Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

In a category with enough limits and colimits, one can form the universal automorphism on an endomorphism in two dual senses. Sometimes these dual constructions coincide, as in the categories of finite sets, finite-dimensional vector…

We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…

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…

The classifying topos of a geometric theory is a topos such that geometric morphisms into it correspond to models of that theory. We study classifying toposes for different infinitary logics: first-order, sub-first-order (i.e. geometric…

Essential $\aleph_0$-categoricity; i.e., $\aleph_0$-categoricity in some full countable language, is shown to be a robust notion for strongly minimal compact complex manifolds. Characterisations of triviality and essential…

The category of models of any theory $T$ in any first-order language $L$ has the surprising property that any small category that is elementarily equivalent with it, already embeds in it. The proof uses an abstract argument via ultrapowers,…

The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…

We prove that a certain homological epimorphism between two algebras induces a triangle equivalence between their singularity categories. Applying the result to a construction of matrix algebras, we describe the singularity categories of…

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…