Related papers: Definable Coherent Ultrapowers and Elementary Exte…
Quillen defined a {\em model category} to be a category with finite limits and colimits carrying a certain extra structure. In this paper, we show that only finite products and coproducts (in addition to the certain extra structure alluded…
We discuss the connection between various orders on the class of all the ultrafilters and certain compactness properties of abstract logics and of topological spaces. We present a model theoretical characterization of Comfort order. We…
A class of subharmonic functions represented by the modified kernels are proved to have the growth estimates $u(z)= o(y^{1-\alpha}|z|^{m+\alpha})$ at infinity in the upper half plane ${\bf C}_{+}$, which generalizes the growth properties of…
An infinite cardinal $\lambda$ is called Fr\'echet if the Fr\'echet filter on $\lambda$ extends to a countably complete ultrafilter. We investigate the relationship between Fr\'echet cardinals and strongly compact cardinals under a…
We prove that, under suitable assumptions on a category C, the existence of supercompact cardinals implies that every absolute epireflective class of objects of C is a small-orthogonality class. More precisely, if L is a localization…
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…
Functorial semi-norms are semi-normed refinements of functors such as singular (co)homology. We investigate how different types of representability affect the (non-)triviality of finite functorial semi-norms on certain functors or classes.…
The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…
In this paper we propose an approach to homotopical algebra where the basic ingredient is a category with two classes of distinguished morphisms: strong and weak equivalences. These data determine the cofibrant objects by an extension…
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
The interrelations between various classes of convergence spaces defined by countability conditions are studied. Remarkably, they all find characterizations in the usual space of ultrafilters in terms of classical topological properties.…
We deal with finitely additive measures defined on all subsets of natural numbers which extend the asymptotic density (density measures). We consider a class of density measures which are constructed from free ultrafilters on natural…
We construct, using mild combinatorial hypotheses, a real Menger set that is not Scheepers, and two real sets that are Menger in all finite powers, with a non-Menger product. By a forcing-theoretic argument, we show that the same holds in…
We define the functor $\textrm{ncDef}_{(Z_1,\ldots,Z_n)}$ of non-commutative deformations of an $n$-tuple of objects in an arbitrary $k$-linear abelian category $\mathcal{Z}$. In our categorified approach, we view the underlying spaces of…
We introduce Gowers--Matet forcing with a finite sequence of pairwise non-isomorphic Ramsey ultrafilters over $\omega$, and with this forcing we settle the long-standing problem of the spectrum of numbers near-coherence classes. We prove…
We consider metric ultraproducts of finite groups with respect to some classes of length functions. All sofic groups embed into these ultraproducts. We study embeddings of normed groups. We also show that in some natural situations such an…
We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…
Ultrafunctions are a particular class of generalized functions defined on a hyperreal field $\mathbb{R}^{*}\supset\mathbb{R}$ that allow to solve variational problems with no classical solutions. We recall the construction of ultrafunctions…
We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which…
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…