逻辑

We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka…

For a class $\Gamma$ of formulas, $\Gamma$ local reflection principle $\mathrm{Rfn}_{\Gamma}(T)$ for a theory $T$ of arithmetic is a scheme formalizing the $\Gamma$-soundness of $T$. Beklemishev proved that for every $\Gamma \in \{\Sigma_n,…

This introduction begins with a section on fundamental notions of mathematical logic, including propositional logic, predicate or first-order logic, completeness, compactness, the L\"owenheim-Skolem theorem, Craig interpolation, Beth's…

We prove that in Borel models of arithmetic on an uncountable Polish space, neither addition nor multiplication is continuous. This is an analogue of Tennenbaum's Theorem for topological models of arithmetic. This answers a question of…

We investigate how set-theoretic forcing can be seen as a computational process on the models of set theory. Given an oracle for information about a model of set theory $\langle M,\in^M\rangle$, we explain senses in which one may compute…

We study the structure of the partial order induced by the definability relation on definitions of truth for the language of arithmetic. Formally, a definition of truth is any sentence $\alpha$ which extends a weak arithmetical theory…

We provide a characterization of when a countably infinite set of finite sets contains an infinite sunflower. We also show that the collection of such sets is Turing equivalent to the set of programs such that whenever the program converges…

Mathematicians invented Mathematics to escape from words, but at last they depend on them just as much as everybody else. At the end, all basic definitions will be reliant on words, yet the mathematician believes that he's elevated from…

We study the question of when a given countable ordinal $\alpha$ is $\Sigma^1_n$- or $\Pi^1_n$-reflecting in models which are neither $\mathsf{PD}$ models nor the constructible universe, focusing on generic extensions of $L$. We prove,…

In order to facilitate historical research in logic, we provide an english translation of a french article by Cha{\"i}m Perelman, called 'L'antinomie de M. G{\"o}del', published in the Bulletins de l'Acad{\'e}mie royale de Belgique in 1936.

We show that, for every orthogonal lub-complete poset P, we can introduce multiple-valued implications sharing properties with quantum implications presented for orthomodular lattices by Kalmbach. We call them classical implication,…

We study several intertwined hierarchies between $\kappa$-Ramsey cardinals and measurable cardinals to illuminate the structure of the large cardinal hierarchy in this region. In particular, we study baby versions of measurability…

In this paper we give an ordinal analysis of a set theory with $\Pi_{1}$-Collection.

In this paper, we study some variations of Namba forcing $\mathrm{Nm}(\kappa,\lambda)$ over $\mathcal{P}_{\kappa}\lambda$ and show that its semiproperness implies $\mathrm{SSR}([\lambda]^{\omega},{<}\kappa)$. In particular, Prikry forcing…

In this paper, we argue that the usual approach to modelling knowledge and belief with the necessity modality $\Box$ does not produce intuitive outcomes in the framework of the Belnap--Dunn logic ($\mathsf{BD}$, alias $\mathsf{FDE}$ --…

Since the introduction by Hodges, and refinement by V\"a\"an\"anen, team semantic constructions have been used to generate expressively enriched logics still conserving nice properties, such as compactness or decidability. In contrast,…

We study interpolation properties for Shavrukov's bimodal logic $\mathbf{GR}$ of usual and Rosser provability predicates. For this purpose, we introduce a new sublogic $\mathbf{GR}^\circ$ of $\mathbf{GR}$ and its relational semantics. Based…

Unlike in classical modal logic, in non-classical modal logics the box and diamond operators frequently fail to be interdefinable. Instead, these logics impose some compatibility conditions which tie the box and diamond operators together…

Arrow's Impossibility Theorem establishes bounds on what we can require from voting systems. Given satisfaction of a small collection of "fairness" axioms, it shows votes can only exist as dictatorships in which one voter determines all…

We consider d-minimal expansions of ordered fields. We demonstrate the existence of definable quotients of definable sets by definable equivalence relations when several technical conditions are satisfied. These conditions are satisfied…