Related papers: Maximality of logic without identity

Descriptive complexity theory aims at inferring a problem's computational complexity from the syntactic complexity of its description. A cornerstone of this theory is Fagin's Theorem, by which a graph property is expressible in existential…

This paper is a study of first-order coherent logic from the point of view of duality and categorical logic. We prove a duality theorem between coherent hyperdoctrines and open polyadic Priestley spaces, which we subsequently apply to prove…

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…

We study first-order as well as infinitary logics extended with quantifiers closed upwards under embeddings. In particular, we show that if a chain of quasi-homogeneous structures is sufficiently long then a given formula of such a logic is…

Let $m\ge 2$ be an integer, $K$ an algebraic number field and $\alpha\in K\setminus \{0,-1\}$ with sufficiently small absolute value. In this article, we provide a new lower bound for linear form in…

We initiate the systematic study of loop conditions of arbitrary finite width. Each loop condition is a finite set of identities of a particular shape, and satisfaction of these identities in an algebra is characterized by it forcing a…

For a cardinal of the form $\kappa=\beth_\kappa$, Shelah's logic $L^1_\kappa$ has a characterisation as the maximal logic above $\bigcup_{\lambda<\kappa} L_{\lambda, \omega}$ satisfying Strong Undefinability of Well Order (SUDWO). SUDWO is…

Let C subset Reg be a non-empty class (of regular cardinal). Then the logic L(Q^{cf}_C) has additional nice properties: it has homogeneous model existence property.

We describe how properties of metric groups and of unitary representations of metric groups can be presented in continuous logic. In particular we find $L_{\omega_1 \omega}$-axiomatization of amenability. We also show that in the case of…

We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $\omega$ implies that the modal logic S4.1.2 is complete with respect to the \v{C}ech-Stone compactification of the natural numbers,…

We use the compactness theorem of continuous logic to give a new proof that $L^r([0,1]; \mathbb{R})$ isometrically embeds into $L^p([0,1]; \mathbb{R})$ whenever $1 \leq p \leq r \leq 2$. We will also give a proof for the complex case. This…

We give a new proof of the completeness of the space $\mathcal{O}_C$ by applying a criterion of compact regularity for the isomorphic sequence space $\lim_{k\rightarrow} (s\hat \otimes (\ell^\infty)_{-k})$. Along the way we show that the…

We study the positive logic FO+ on finite words, and its fragments, pursuing and refining the work initiated in [Kuperberg 2023]. First, we transpose notorious logic equivalences into positive first-order logic: FO+ is equivalent to LTL+ ,…

In two-dimensional Lipschitz domains, we analyze a Brinkman--Darcy--Forchheimer problem on the weighted spaces $\mathbf{H}_0^1(\omega,\Omega) \times L^2(\omega,\Omega)/\mathbb{R}$, where $\omega$ belongs to the Muckenhoupt class $A_2$.…

The Univalent Foundations requires a logic that allows us to define structures on homotopy types, similar to how first-order logic with equality ($\text{FOL}_=$) allows us to define structures on sets. We develop the syntax, semantics and…

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

We characterize exactly the compactness properties of the product of \kappa\ copies of the space \omega\ with the discrete topology. The characterization involves uniform ultrafilters, infinitary languages, and the existence of nonstandard…

Omega-powers of finitary languages are languages of infinite words (omega-languages) in the form V^omega, where V is a finitary language over a finite alphabet X. They appear very naturally in the characterizaton of regular or context-free…

We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfiability problem for this logic is undecidable in general, in…

We show that a version of Martin-L\"of type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with families (supporting these type formers) both in a 1- and a…