Related papers: Strongly Minimal Sets and Categoricity in Continuo…

The notion of weak cyclic monotonicity of set-valued maps generalizing the cyclic monotonicity is introduced. The existence of solutions of differential inclusions with compact, upper semi-continuous, not necessarily convex right-hand sides…

We collect several open questions in Banach spaces, mostly related to measure theoretic aspects of the theory. The problems are divided into five categories: miscellaneous problems in Banach spaces (non-separable $L^p$ spaces, compactness…

In this paper, we introduce the classes of weakly surjunctive and linearly surjunctive groups which include all sofic groups and more generally all surjunctive groups. We investigate various properties of such groups and establish in…

We show that the standard approach of minimal invariant sets, which applies Zorn's Lemma and is used to prove fixed point theorems for non-expansive mappings in Banach spaces can be applied without any reference to the full Axiom of Choice…

Caucal hierarchy is a well-known class of graphs with decidable monadic theories. It were proved by L. Braud and A. Carayol that well-orderings in the hierarchy are the well-orderings with order types less than $\varepsilon_0$. Naturally,…

In this paper structure of infinite dimensional Banach spaces is studied by using an asymptotic approach based on stabilization at infinity of finite dimensional subspaces which appear everywhere far away. This leads to notions of…

We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also…

This thesis addresses Pour-El and Richards' fourth question from their book "Computability in analysis and physics", concerning the relation between higher order recursion theory and computability in analysis. Among other things it is shown…

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…

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…

In the framework of propositional {\L}ukasiewicz logic, a suitable notion of implicit definability, tailored to the intended real-valued semantics and referring to the elements of its domain, is introduced. Several variants of implicitly…

We set up a descriptive set-theoretic framework to study Lipschitz-free spaces and use the reduction argument of Bossard to prove several results. We prove two universality results: if a separable Banach space is isomorphically universal…

We extend the concept of "almost indiscernible theory" introduced by Pillay and Sklinos in [Bull. Symb. Log., 2015] (which was itself a modernization and expansion of Baldwin and Shelah [Algebra Universalis, 1983]), to uncountable languages…

We consider a definition of a weakly convex set which is a generalization of the notion of a weakly convex set in the sense of Vial and a proximally smooth set in the sense of Clarke, from the case of the Hilbert space to a class of Banach…

We list a number of problems in several topics related to compactness in nonseparable Banach spaces. Namely, about the Hilbertian ball in its weak topology, spaces of continuous functions on Eberlein compacta, WCG Banach spaces, Valdivia…

Quantified modal logic provides a natural logical language for reasoning about modal attitudes even while retaining the richness of quantification for referring to predicates over domains. But then most fragments of the logic are…

We prove new characterisations of exponential stability for positive linear discrete-time systems in ordered Banach spaces, in terms of small-gain conditions. Such conditions have played an important role in the finite-dimensional systems…

This paper presents some finite combinatorics of set systems with applications to model theory, particularly the study of dependent theories. There are two main results. First, we give a way of producing lower bounds on VC_ind-density, and…

We describe an infinitary logic for metric structures which is analogous to $L_{\omega_1, \omega}$. We show that this logic is capable of expressing several concepts from analysis that cannot be expressed in finitary continuous logic. Using…

We study a metric-like structure on categories, showing that the concept of the limit of a sequence in a metric space and the concept of the colimit of a sequence in a category have a common generalization. The main concept is a norm on a…