逻辑

We show that all maximal Hardy fields are elementarily equivalent as differential fields, and give various applications of this result and its proof. We also answer some questions on Hardy fields posed by Boshernitzan.

In a recent paper, we have introduced two types of fuzzy simulations (forward and backward) and five types of fuzzy bisimulations (forward, backward, forward-backward, backward-forward and regular) between Kripke models for the fuzzy…

We show that under mild set theoretic hypotheses we have rigidity for algebras of continuous functions over Higson coronas, topological spaces arising in coarse geometry. In particular, we show that under $\mathsf{OCA}$ and $\mathsf…

Using a definition of Jordan curve similar to that of Dieudonn\'e, we prove that our notion is equivalent to that used by Berg et al. in their constructive proof of the Jordan Curve Theorem. We then establish a number of properties of…

As part of a broader family of logics, [1, 3] introduced two key logical systems: $\mathsf{iK_{d}}$, which encapsulates the basic logical structure of dynamic topological systems, and $\mathsf{iK_{d*}}$, which provides a well-behaved yet…

Based on earlier work of the third author, we construct a Chang-type model with supercompact measures extending a derived model of a given hod mouse with a regular cardinal $\delta$ that is both a limit of Woodin cardinals and a limit of…

A three-valued logic L is subclassical when it is defined by a single matrix having the classical two-element matrix as a subreduct. In this case, the language of L can be expanded with special unary connectives, called external operators.…

We continue our local analysis of groups interpretable in various dp-minimal valued fields, as introduced in [8]. We associate with every infinite group $G$ interpretable in those fields an infinite type-definable infinitesimal subgroup…

Inspired by Bartoszy\'nski's work on small sets, we introduce a new ideal defined by interval partitions on natural numbers and summable sequences of positive reals. Similarly, we present another ideal that relies on Bartoszy\'nski's and…

Inquisitive modal logic, InqML, in its epistemic incarnation, extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. We use the natural notion of…

In [11] Sklinos proved that any uncountable free group is not $\aleph_1$-homogenenous. This was later generalized by Belegradek in [1] to torsion-free residually finite relatively free groups, leaving open whether the assumption of residual…

Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and…

We prove that persistently finite algebras are not created by completions of algebras, in any ordered discriminator variety. A persistently finite algebra is one without infinite simple extensions. We prove that finite measurable relation…

A series of nonrepresentable relation algebras is constructed from groups. We use them to prove that there are continuum many subvarieties between the variety of representable relation algebras and the variety of coset relation algebras. We…

A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…

A coset relation algebra is one embeddable into some full coset relation algebra, the latter is an algebra constructed from a system of groups, a coordinated system of isomorphisms between quotients of these groups, and a system of cosets…

A relation algebra is measurable if the identity element is a sum of atoms, and the square x;1;x of each subidentity atom x is a sum of non-zero functional elements. These functional elements form a group Gx. We prove that a measurable…

We exhibit two relation algebra atom structures such that they are elementarily equivalent but their term algebras are not. This answers Problem 14.19 in the book Hirsch, R. and Hodkinson, I., "Relation Algebras by Games", North-Holland,…

We present an alternative cyclic proof system for Peano arithmetic that could be simpler than the existing ones and well-adapted both for proof analysis and for automatizing inductive proof search. In addition, we will show how various…

Our approach establishes a natural correspondence between complete orthomodular lattices and certain types of quantales. Firstly, given a complete orthomodular lattice X, we associate with it a Foulis quantale Lin(X) consisting of its…