Related papers: Reducing $\omega$-model reflection to iterated syn…
Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…
We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…
The main purpose of this paper is to present a new and more uniform model-theoretic/combinatorial proof of the theorem ([5]): The randomization $T^{R}$ of a complete first-order theory $T$ with $NIP$ is a (complete) first-order continuous…
In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications, in a similar spirit than a set of proof trees. The main…
In this note, we investigate iterations of consistency, local and uniform reflection over $\mathbf{HA}$ (Heyting Arithmetic). In the case of uniform reflection, we give a new proof of Dragalin's extension of Feferman's completeness theorem…
We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
Let $T$ be an infinitely generated tilting module of projective dimension at most one over an arbitrary associative ring $A$, and let $B$ be the endomorphism ring of $T$. In this paper, we prove that if $T$ is good then there exists a ring…
We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…
Transformations of well partial orders induce functions on the ordinals, via the notion of maximal order type. In most examples from the literature, these functions are not normal, in marked contrast with the central role that normal…
We present a new asynchronous model of computation named Stellar Resolution based on first-order unification. This model of computation is obtained as a formalisation of Girard's transcendental syntax programme, sketched in a series of…
This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…
The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…
Recursive saturation and resplendence are two important notions in models of arithmetic. Kaye, Kossak, and Kotlarski introduced the notion of arithmetic saturation and argued that recursive saturation might not be as rigid as first assumed.…
Large language models (LLMs) have proven to be highly effective for solving complex reasoning tasks. Surprisingly, their capabilities can often be improved by iterating on previously generated solutions. In this context, a reasoning plan…
Dependent Object Types (DOT) is intended to be a core calculus for modelling Scala. Its distinguishing feature is abstract type members, fields in objects that hold types rather than values. Proving soundness of DOT has been surprisingly…
We prove an iteration theorem which guarantees for a wide class of nice iterations of $\omega_1$-preserving forcings that $\omega_1$ is not collapse, at the price of needing large cardinals to burn as fuel. More precisely, we show that a…
Continuing [Fuchino, Ottenbreit and Sakai[9, 10]] and [Fuchino and Ottenbreit[11]], we further study reflection principles in connection with the L\"owenheim-Skolem Theorems of stationary logics. In this paper, we mainly analyze the…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
The set theory KP$\Pi_{N+1}$ for $\Pi_{N+1}$-reflecting universes is shown to be $\Pi_{N+1}$-conservative over iterations of $\Pi_{N}$-recursively Mahlo operations for each $N\geq 2$.