逻辑

Recently, a surprising connection between algorithmic learning of algebraic structures and descriptive set theory has emerged. Following this line of research, we define the learning power of an equivalence relation $E$ on a topological…

In arXiv:0905.1675, Nik Weaver proposed a novel intuitionistic formal theory of third-order arithmetic as a formalisation of his philosophical position known as mathematical conceptualism. In this paper, we will construct a realisability…

In this short note, we study C((t)) in the language of valued rings. We show that a definable subset of C((t))n (or in monster model, Mn) is definably compact iff it is closed and unbounded. Then we give some comments on definable groups…

We present an $L$-like construction that produces the minimal model of $\mathsf{AD}_\mathbb{R}+$"$\Theta$ is regular". In fact, our construction can produce any model of $\mathsf{AD}^++\mathsf{AD}_\mathbb{R}+V=L(P(\mathbb{R}))$ in which…

We show that, in the model constructed by adding sufficiently many Cohen reals, derived limits are additive on a large class of systems. This generalizes the work of Jeffrey Bergfalk, Michael Hru\v s\'ak, and Chris Lambie-Hanson which…

This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…

We study Doob's Consistency Theorem and Freedman's Inconsistency Theorem from the vantage point of computable probability and algorithmic randomness. We show that the Schnorr random elements of the parameter space are computably consistent,…

In this paper, we introduce the notion of a pseudo-irreducible filter in a residuated lattice and compare this concept with related notions such as prime and maximal filters. Then, we recall the Boolean lifting property for filters and…

We outline a class of term-languages for epistemic grounding inspired by Prawitz's theory of grounds. We show how denotation functions can be defined over these languages, relating terms to proof-objects built up of constructive functions.…

We define a class of formal systems inspired by Prawitz's theory of grounds. The latter is a semantics that aims at accounting for epistemic grounding, namely, at explaining why and how deductively valid inferences have the power to…

Bishop's constructive mathematics school rejects the Law of Excluded Middle, but instead vastly makes use of weaker versions of the Choice. In this paper we pioneer an example, which shows that this road is not consistent, as our example…

We characterise the model-theoretic algebraic closure in Zilber's exponential field. A key step involves showing that certain algebraic varieties have finite intersections with certain finite-rank subgroups of the graph of exponentiation.…

In the product $L_1\times L_2$ of two Kripke complete consistent logics, local tabularity of $L_1$ and $L_2$ is necessary for local tabularity of $L_1\times L_2$. However, it is not sufficient: the product of two locally tabular logics may…

We show that if an equivalence relation $E$ on a Polish space is a countable union of smooth Borel subequivalence relations, then there is either a Borel reduction of $E$ to a countable Borel equivalence relation on a Polish space or a…

Suppose $\kappa$ is a regular cardinal and $\bar a=\langle \mu_i: i<\kappa \rangle$ is a non-decreasing sequence of regular cardinals. We study the set of possible cofinalities of cuts Pcut$(\bar a)=\{(\lambda_1, \lambda_2):$ for some…

I discuss two approaches to monotonic proof-theoretic semantics. In the first one, which I call SVA, consequence is understood in terms of existence of valid arguments. The latter involve the notions of argument structure and justification…

We study the existence of a $\Theta$ sentence which is simultaneously $\Gamma$-conservative over consistent RE extensions $T$ and $U$ of Peano Arithmetic for various reasonable pairs $(\Gamma, \Theta)$. As a result of this study, we prove…

We revisit Smullyan's paper ``Truth and Provability'' (2013) for three purposes. First, we introduce the notion of Smullyan models to give a precise definition for Smullyan's framework discussed in that paper. Second, we clarify the…

We introduce an abstract framework for forcing over a free Suslin tree with suborders of products of forcings which add some structure to the tree using countable approximations. The main ideas of this framework are consistency, separation,…

We introduce the model-companion of the theory of fields expanded by a unary function for a multiplicative map, which we call ACFH. Among others, we prove that this theory is NSOP$_1$ and not simple, that the kernel of the map is a generic…