逻辑

We work in the Cantor space $2^\omega$. The results of the paper adhere the following pattern. Let $\mathcal{I}\in \{\mathcal{M}, \mathcal{N}, \mathcal{M}\cap \mathcal{N}, \mathcal{E}\}$ and $T$ be a perfect, uniformly perfect or Silver…

We define temporal axioms that are sound and complete for the temporal validities over $(\reals^2, <)$.

A tree is pathwise-random if all of its paths are Martin-Lof random. We show that (a) no weakly 2-random real computes a perfect pathwise-random tree; it follows that the class of perfect pathwise-random trees is null, with respect to any…

In 2023, Kuznetsov and Speranski introduced infinitary action logic with multiplexing $!^m\nabla \mathrm{ACT}_\omega$ and proved that the derivability problem for it lies between the $\omega$ and $\omega^\omega$ levels of the…

We study the modal completeness and the finite frame property of several sublogics of the logic $\mathbf{IL}$ of interpretability with respect to Visser frames, which are also called simplified Veltman frames. Among other things, we prove…

We study the isomorphism relation on Borel classes of locally compact Polish metric structures. We prove that isomorphism on such classes is always classifiable by countable structures (equivalently: Borel reducible to graph isomorphism),…

We show that it is possible to add $\kappa^+-$Cohen subsets to $\kappa$ with a Prikry forcing over $\kappa$. This answers a question from \cite{HayutBenhanouGitik}. A strengthening of non-Galvin property is introduced. It is shown to be…

There exist two notions of typicality in computability theory, namely, genericity and randomness. In this article, we introduce a new notion of genericity, called partition genericity, which is at the intersection of these two notions of…

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

For which infinite cardinals $\kappa$ is there a partition of the real line $\mathbb R$ into precisely $\kappa$ Borel sets? Hausdorff famously proved that there is a partition of $\mathbb R$ into $\aleph_1$ Borel sets. But other than this,…

The classes stable, simple and NSOP$_1$ in the stability hierarchy for first-order theories can be characterised by the existence of a certain independence relation. For each of them there is a canonicity theorem: there can be at most one…

Generalizing the notion of a tight almost disjoint family, we introduce the notions of a {\em tight eventually different} family of functions in Baire space and a {\em tight eventually different set of permutations} of $\omega$. Such sets…

We adapt the notion of a (relatively) definable subset of Aut(M) when M is a saturated model to the case Aut(M/A) when M is atomic and strongly omega-homogeneous over A. We discuss the existence and uniqueness of invariant measures on the…

$\nabla$-algebra is a natural generalization of Heyting algebra, unifying many algebraic structures including bounded lattices, Heyting algebras, temporal Heyting algebras and the algebraic presentation of the dynamic topological systems.…

Ibeling et al. (2023). axiomatize increasingly expressive languages of causation and probability, and Mosse et al. (2024) show that reasoning (specifically the satisfiability problem) in each causal language is as difficult, from a…

In this note we study one-dimensional definable sets in power series fields with perfect residue fields. Using the description of automorphisms given by Schilling, in \cite{S44}, we show that such sets are unions of existentially definable…

In the present paper we prove the compactness theorem with respect to partial structures and quasi-truth, using the technique of ultraproducts. Partial structures and quasi-truth are two notions developed within the partial structures…

I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…

This paper proves that a plactic monoid of any finite rank will have decidable first order theory. This resolves other open decidability problems about the finite rank plactic monoids, such as the Diophantine problem and identity checking.…

We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…