Related papers: Strongly Minimal Sets and Categoricity in Continuo…
Higher categorical structures are often defined by induction on dimension, which a priori produces only finite-dimensional structures. In this paper we show how to extend such definitions to infinite dimensions using the theory of terminal…
We consider several quantities related to weak sequential completeness of a Banach space and prove some of their properties in general and in $L$-embedded Banach spaces, improving in particular an inequality of G. Godefroy, N. Kalton and D.…
In aiming to apply to a broader class of examples the Avigad-Iovino "ultraproducts and metastability" approach to obtaining uniformity for convergence of sequences, we construct a framework using continuous logic that in particular is able…
The study of minimal complements in a group or a semigroup was initiated by Nathanson. The notion of minimal complements and being a minimal complement leads to the notion of co-minimal pairs which was considered in a prior work of the…
We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…
We study semantic and syntactic properties of spherical orders and their elementary theories, including finite and dense orders and their theories. It is shown that theories of dense $n$-spherical orders are countably categorical and…
Baizhanov and Baldwin introduced the notion of benign and weakly benign sets to investigate the preservation of stability by naming arbitrary subsets of a stable structure. They connected the notion with works of Baldwin, Benedikt,…
We show that every Banach space in which weakly compact sets are super weakly compact in automatically weakly sequentially complete answering a question by Silber (2024). In the proof we show how to build a weakly compact set which is not…
A Banach space $X$ is said to have Efremov's property ($\mathcal{E}$) if every element of the weak$^*$-closure of a convex bounded set $C \subseteq X^*$ is the weak$^*$-limit of a sequence in $C$. By assuming the Continuum Hypothesis, we…
In this paper, we study the descriptive complexity of some inevitable classes of Banach spaces. Precisely, as shown in [Go], every Banach space either contains a hereditarily indecomposable subspace or an unconditional basis, and, as shown…
Within Bishop Set Theory, a reconstruction of Bishop's theory of sets, we study the so-called completely separated sets, that is sets equipped with a positive notion of an inequality, induced by a given set of real-valued functions. We…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
Using the category of metric spaces as a template, we develop a metric analogue of the categorical semantics of classical/intuitionistic logic, and show that the natural notion of predicate in this "continuous semantics" is equivalent to…
The logico-algebraic study of Lewis's hierarchy of variably strict conditional logics has been essentially unexplored, hindering our understanding of their mathematical foundations, and the connections with other logical systems. This work…
The notion of clause set cycle abstracts a family of methods for automated inductive theorem proving based on the detection of cyclic dependencies between clause sets. By discerning the underlying logical features of clause set cycles, we…
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…
We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…
We present a bisequent calculus (BSC) for the minimal theory of definite descriptions (DD) in the setting of neutral free logic, where formulae with non-denoting terms have no truth value. The treatment of quantifiers, atomic formulae and…
We give several new characterizations of $IP$ (the independence property) and $SOP$ (the strict order property) for continuous first order logic and study their relations to the function theory and the Banach space theory. We suggest new…
Positive logic is a generalisation of full first-order logic that does not have negation built in. Still, many model-theoretic ideas, tools and techniques work perfectly fine in positive logic. Importantly, there is a compactness theorem.…