逻辑

We investigate how much type theory is able to prove about the natural numbers. A classical result in this area shows that dependent type theory without any universes is conservative over Heyting Arithmetic (HA). We build on this result by…

Let $\mu < \kappa < \lambda$ be three infinite cardinals, the first two being regular. We show that if there is no inner model with large cardinals, $u (\kappa, \lambda)$ is regular, where $u (\kappa, \lambda)$ denotes the least size of a…

We revisit the application of Shelah's Revised GCH Theorem \cite{SheRGCH} to diamond. We also formulate a generalization of the theorem and prove a small fragment of it. Finally we consider another application of the theorem, to covering…

If $V = L$, and $\mu$, $\kappa$ and $\lambda$ are three infinite cardinals with $\mu = {\rm cf} (\mu) < \kappa = {\rm cf}(\kappa) \leq \lambda$, then, as shown in \cite{Heaven}, the $\mu$-club filters on $P_\kappa (\lambda)$ and $P_\kappa…

This proof of Godel's first incompleteness theorem doesn't require omega-consistency, nor does it refer to codes of negated sentences as in Rosser's. It begins from where Godel's usual proof ends, and stalks it till it ends proving it.

We consider some of the various formulations of the Revised GCH Theorem presented in Shelah's original paper \cite{SheRGCH}. We compare them and discuss their meaning.

Halin [1965] proved that if a graph has $n$ many pairwise disjoint rays for each $n$ then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other similar results in terms of computable and proof theoretic…

We provide partial solutions to two problems posed by Shehtman concerning the modal logic of the \v{C}ech-Stone compactification of an ordinal space. We use the Continuum Hypothesis to give a finite axiomatization of the modal logic of…

In this paper we give a new proof for the completeness of infinite valued propositional \L ukasiewicz logic introduced by \L ukasiewicz and Tarski in 1930. Our approach employs a Hilbert-style proof that relies on the concept of maximal…

We introduce a variant of free logic (i.e., a logic admitting terms with nonexistent referents) that accommodates truth-value gluts as well as gaps. Employing a suitable expansion of the Belnap-Dunn four-valued logic, we specify a…

We study varieties generated by semi-primal lattice-expansions by means of category theory. We provide a new proof of the Keimel-Werner topological duality for such varieties and, using similar methods, establish its discrete version. We…

We prove that, assuming $\mathrm{ZF}$, and restricted to any pointed set, Chaitin's $\Omega_U:x\mapsto \Omega_U^x=\sum_{U^x(\sigma)\downarrow}2^{-|\sigma|}$ is not injective for any universal prefix-free Turing machine $U$, and that…

Product logic is one of the main fuzzy logics arising from a continuous t-norm, and its equivalent algebraic semantics is the variety of product algebras. In this contribution, we study maximal filters of product algebras, and their…

A framework to handle tree decompositions of the components of a Borel graph in a Borel fashion is introduced, along the lines of Tserunyan's Stallings Theorem for equivalence relations arXiv:1805.09506. This setting leads to a notion of…

Following Baumgartner [J. Symb. Log. 60 (1995), no. 2], for an ideal $\mathcal{I}$ on $\omega$, we say that an ultrafilter $\mathcal{U}$ on $\omega$ is an $\mathcal{I}$-ultrafilter if for every function $f:\omega\to\omega$ there is $A\in…

Starting from the $\rm{GCH},$ we build a cardinal and $\rm{GCH}$ preserving generic extension of the universe, in which there exists a set $A \subseteq \omega_2$ of size $\aleph_2$ so that every countably infinite subset of $A$ or $\omega_2…

We apply, in the context of semigroups, the main theorem from~\cite{higjac} that an elementary class $\mathcal{C}$ of algebras which is closed under the taking of direct products and homomorphic images is defined by systems of equations. We…

In this paper, we prove a fine condensation theorem. This is quite similar to condensation theorems for pure extender mice in the literature, except that condensation for iteration strategies has been added to the mix.

Within the framework of Zermelo-Fraenkel set theory without the Axiom of Choice, we establish equivalents to the assertion "the union of a countable collection of finite sets is countable" in the context of metric spaces, probability…

Assume $G\prec H$ are groups and ${\cal A}\subseteq{\cal P}(G),\ {\cal B}\subseteq{\cal P}(H)$ are algebras of sets closed under left group translation. Under some additional assumptions we find algebraic connections between the Ellis…