逻辑

Exacting and ultraexacting cardinals are large cardinal numbers compatible with the Zermelo-Fraenkel axioms of set theory, including the Axiom of Choice. In contrast with standard large cardinal notions, their existence implies that the…

Given an ordered field $\mathbb{T}$ of formal series over an ordered field $\mathbf{R}$ equipped with a composition law $\circ \colon \mathbb{T} \times \mathbb{T}^{>\mathbb{R}} \longrightarrow \mathbb{T}$, we give conditions for…

We study the existence of formal Taylor expansions for functions defined on fields of generalised series. We prove a general result for the existence and convergence of those expansions for fields equipped with a derivation and an…

We present a new version of the Friedman-Magidor theorem: for every measurable cardinal $\kappa$ and $\tau\leq\kappa^{++}$, there exists a forcing extension $V\subseteq V[G]$ such that any normal measure $U\in V$ on $\kappa$ has exactly…

Quantifier-elimination or model-completeness of the affine part of some classical first order theories are proved.

Every maximal Hardy field has a proper elementary differential subfield that is Dedekind complete in the maximal Hardy field. This pair of Hardy fields is a transserial tame pair, shown to have a complete and model complete elementary…

The following article treats about convex geometries which are lower semi-modular and join semi-distributive lattices. Firstly, it is shown that there is a class $K$ of infinite convex geometries which can be build out of finite ones by…

For cardinals $\mathfrak{a}$ and $\mathfrak{b}$, we write $\mathfrak{a}=^\ast\mathfrak{b}$ if there are sets $A$ and $B$ of cardinalities $\mathfrak{a}$ and $\mathfrak{b}$, respectively, such that there are partial surjections from $A$ onto…

This short note introduces a formal system of truth and paradoxicality, outlining the main motivation, and proving its $\omega$-consistency. The system is called TP, for 'Truth and Paradoxicality'.

This paper establishes a formal framework, grounded in mathematical logic and order theory, to analyze the inherent limitations of radical transparency. We demonstrate that self-referential disclosure policies inevitably encounter…

We study subsystems of open induction which are strongly connected to methods of automated inductive theorem proving. Specifically, we consider systems obtained from restricting induction to atoms, literals, clauses, and dual clauses. We…

We force over a model of AD to obtain the consistency of the Galvin number having countable cofinality.

We consider logics derived from Euclidean spaces $\mathbb{R}^n$. Each Euclidean space carries relations consisting of those pairs that are, respectively, distance more than 1 apart, distance less than 1 apart, and distance 1 apart. Each…

For uncountable downwards closed subtrees $U$ and $W$ of an $\omega_1$-tree $T$, we say that $U$ and $W$ are strongly almost disjoint if their intersection is a finite union of countable chains. The tree $T$ is strongly non-saturated if…

The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper, as new foundations for the construction of $\kappa$-Souslin trees in a uniform way that does not depend on the nature of the (regular uncountable)…

We discuss a new approach to functional interpretations based on uniform quantification and relativization. The uniform quantification in the background permits a more penetrating analysis of principles related to collection and…

We investigate the computability of the isomorphism set $\operatorname{Iso}(G_A,G_B)$ between $G_A$ and $G_B$, where $G_A$ is a subgroup of $\mathbb{Q}^n$ generated by columns of integer powers of a non-singular $n \times n$-matrix $A$ with…

In this article, we study a degenerate version of Ramsey's theorem for pairs and two colors ($\mathsf{RT}^2_2$), in which the homogeneous sets for color 1 are of bounded size. By $\mathsf{RT}^2_2$, it follows that every such coloring admits…

In this paper, we present a proof of the consistency of the New Foundations set theory ($\mathit{NF}$). $\mathit{NF}$'s main idea is to permit very large sets (including the Universal Set) by restricting set formation to stratified…

In this paper we study the limit theory of numerical semigroups with two generators. We give a complete axiomatization in some cases.