Related papers: Classes of structures with no intermediate isomorp…
In this paper, we study the rigidity of uniform Roe algebras via the ideal structures. We showed that for given metric spaces X and Y with bounded geometry, if their uniform Roe algebras are isomorphic, then they are coarse equivalent.
The paper studies a cluster of systems for fully disquotational truth based on the restriction of initial sequents. Unlike well-known alternative approaches, such systems display both a simple and intuitive model theory and remarkable…
A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…
The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
We study the notion of linear sofic approximations for algebras, analogous to the concept of sofic representations for groups. We prove that for a finitely generated amenable $K$-algebra with no zero divisors, all linear sofic…
We examine recursive monotonic functions on the Lindenbaum algebra of $\mathsf{EA}$. We prove that no such function sends every consistent $\varphi$ to a sentence with deductive strength strictly between $\varphi$ and…
We generalize the classical Tanaka result on the finiteness of symmetry algebra for non-degenerate pseudo-product structures to the case when the completely-integrable distributions defining the pseudo-product structure are no longer…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
A longstanding open problem is whether there exists a non syntactical model of the untyped lambda-calculus whose theory is exactly the least lambda-theory (l-beta). In this paper we investigate the more general question of whether the…
A longstanding open problem is whether there exists a non-syntactical model of untyped lambda-calculus whose theory is exactly the least equational lambda-theory (=Lb). In this paper we make use of the Visser topology for investigating the…
We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset).…
Definitions of dense linear orders (with/without endpoints), separable linear orders, complete linear orders, the countable chain condition for linear orders, a Suslin line/Suslin tree and Suslin's problem Statement and proof of Cantor's…
We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…
I study definable sets in affine continuous logic. Let $T$ be an affine theory. After giving some general results, it is proved that if $T$ has a first order model, its extremal theory is a complete first order theory and first order…
We investigate asymptotically flat manifolds with cone structure at infinity. We show that any such manifold M has a finite number of ends. For simply connected ends we classify all possible cones at infinity, except for the 4-dimensional…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
We employ the theory of canonical extensions to study residuation algebras whose associated relational structures are functional, i.e., for which the ternary relations associated to the expanded operations admit an interpretation as…
The use of exponentials in linear logic greatly enhances its expressive power. In this paper we focus on nonassociative noncommutative multiplicative linear logic, and systematically explore modal axioms K, T, and 4 as well as the…
Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of constructor terms in the left-hand side; the computational intuition is that rules cannot build new data…