逻辑

Ono's modal FL-algebras are models of an extension of Full Lambek logic that has the modalities ! and ? of linear logic. Here we define a notion of modal FL-cover system that combines aspects of Beth-Kripke-Joyal semantics with Girard's…

Fine's influential Canonicity Theorem states that if a modal logic is determined by a first-order definable class of Kripke frames, then it is valid in its canonical frames. This article reviews the background and context of this result,…

There has been renewed interest in recent years in McKinsey and Tarski's interpretation of modal logic in topological spaces and their proof that S4 is the logic of any separable dense-in-itself metric space. Here we extend this work to the…

We define a Kripke semantics for a conditional logic based on the propositional logic $\mathsf{N4}$, the paraconsistent variant of Nelson's logic of strong negation; we axiomatize the minimal system induced by this semantics. The resulting…

We sow that there exists a generic extension of the G\"{o}del's constructible universe in which diamond holds and there exists a subset $Y \subseteq \omega_1$ such that for stationary many $\delta < \omega_1,$ the set $Y \cap \delta$ is not…

The purpose of this article is to give new constructions of linear orders which are minimal with respect to being non-$\sigma$-scattered. Specifically, we will show that Jensen's principle $\diamondsuit$ implies that there is a minimal…

We unveil new patterns of Structural Reflection in the large-cardinal hierarchy below the first measurable cardinal. Namely, we give two different characterizations of strongly unfoldable and subtle cardinals in terms of a weak form of the…

We study the relations between two consequences of the Continuum Hypothesis discovered by Wac{\l}aw Sierpi\'nski, concerning uniform continuity of continuous functions and uniform convergence of sequences of real-valued functions, defined…

In this paper, we study some new examples of ideals on $\omega$ with maximal Tukey type (that is, maximal among partial orders of size continuum). This discussion segues into an examination of a refinement of the Tukey order -- known as the…

In this paper, we discuss a proof system $\mathsf{NGL}$ for the logic $\mathbf{GL}$ of provability, which is equipped with an $\omega$-rule. We show the three classes of transitive Kripke frames, the class which strongly validates the…

We consider the question of when sets definable in first-order expansions of groups contain the product of two infinite sets (we refer to this as the "productset property"). We first show that the productset property holds for any definable…

We use axioms of abstract ternary relations to define the notion of a free amalgamation theory. These form a subclass of first-order theories, without the strict order property, encompassing many prominent examples of countable structures…

The paper is a contribution to intuitionistic reverse mathematics. We work in a weak formal system for intuitionistic analysis. The Principle of Open Induction on Cantor space is the statement that every open subset of Cantor space that is…

Solovay's arithmetical completeness theorem states that the modal logic of provability coincides with the modal logic $\mathbf{GL}$. Hamkins and L\"owe studied the modal logical aspects of set theoretic multiverse and proved that the modal…

We resolve the strong Elementary Equivalence versus Isomorphism Problem for finitely generated fields. That is, we show that for every field in this class there is a first-order sentence which characterizes this field within the class up to…

We give a proof of the existence of generalized definable locally compact models for arbitrary approximate subgroups via an application of topological dynamics in model theory. Our construction is simpler and shorter than the original one…

Let $X$ be a definable group definable over a small model $M_0$. Recall that a global type $p$ on $X$ is definable $f$-generic over $M_0$ if every left translate of $p$ is definable over $M_0$. We call $p$ strongly $f$-generic over $M_0$ if…

We show that in contrast to the Rado graph, the Henson graphs are not computably indivisible.

We prove that the consistency strength of Martin's Maximum restricted to partial orders of cardinality $\omega_1$ follows from the consistency of ZFC.

A tree ${\mathbb T} =\langle T\leq \rangle$ is reversible iff there is no order $\preccurlyeq \;\varsubsetneq \;\leq $ such that ${\mathbb T} \cong \langle T ,\preccurlyeq\rangle$. Using a characterization of reversibility via back and…