Related papers: Reflection calculus and conservativity spectra
The Ohno-Nakagawa (O-N) reflection theorem is an unexpectedly simple identity relating the number of $\mathrm{GL}_2 \mathbb{Z}$-classes of binary cubic forms (equivalently, cubic rings) of two different discriminants $D$, $-27D$; it…
Language models can use verifiable rewards to improve at a wide variety of reasoning tasks. However, both parametric (e.g. RLVR) and non-parametric (e.g. prompt optimization) approaches to doing so typically require hundreds of training…
We define a congruence module $\Psi_A(M)$ associated to a surjective $\mathcal O$-algebra morphism $\lambda\colon A \to \mathcal{O}$, with $\mathcal{O}$ a discrete valuation ring, $A$ a complete noetherian local $\mathcal{O}$-algebra…
We present a new type system with support for proofs of programs in a call-by-value language with control operators. The proof mechanism relies on observational equivalence of (untyped) programs. It appears in two type constructors, which…
We study the correspondence theory of intuitionistic modal logic in modal Fairtlough-Mendler semantics (modal FM semantics) \cite{FaMe97}, which is the intuitionistic modal version of possibility semantics \cite{Ho16}. We identify the…
We analyze reflection positive representations in terms of positive Hankel operators. This is motivated by the fact that positive Hankel operators are described in terms of their Carleson measures, whereas the compatibility condition…
We study the computational expressivity of proof systems with fixed point operators, within the 'proofs-as-programs' paradigm. We start with a calculus muLJ (due to Clairambault) that extends intuitionistic logic by least and greatest…
This paper presents a formal theory of Krivine's classical realisability interpretation for first-order Peano arithmetic ($\mathsf{PA}$). To formulate the theory as an extension of $\mathsf{PA}$, we first modify Krivine's original…
The present paper deals with the representation theory of the reflection equation algebra, connected with a Hecke type R-matrix. Up to some reasonable additional conditions the R-matrix is arbitrary (not necessary originated from quantum…
We continue [GbSh:568] (math.LO/0003164), proving a stronger result under the special continuum hypothesis (CH). The original question of Eklof and Mekler related to dual abelian groups. We want to find a particular example of a dual group,…
Right-linear (or left-linear) grammars are a well-known class of context-free grammars computing just the regular languages. They may naturally be written as expressions with (least) fixed points but with products restricted to letters as…
This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually polynomial-time reducible to their fragments with at most two…
The concept of reflection positivity has its origins in the work of Osterwalder--Schrader on constructive quantum field theory and duality between unitary representations of the euclidean motion group and the Poincare group. On the…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
In the representation theory of finite-dimensional algebras, the study of projective presentations of maximal rank is closely related to the study of generically $\tau$-regular irreducible components of varieties of modules over such…
We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal $\alpha$ there exists an ordinal $\beta$ such that $1+\beta\cdot(\beta+\alpha)$ (ordinal arithmetic) admits an…
Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic…
We consider reflection-positivity (Osterwalder-Schrader positivity, O.S.-p.) as it is used in the study of renormalization questions in physics. In concrete cases, this refers to specific Hilbert spaces that arise before and after the…
Dependently typed lambda calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types" notion, such calculi can also encode the correspondence between…
By adapting Salomaa's complete proof system for equality of regular expressions under the language semantics, Milner (1984) formulated a sound proof system for bisimilarity of regular expressions under the process interpretation he…