Related papers: Reflection calculus and conservativity spectra
In clinical decision-making, predictive models face a persistent trade-off: accurate models are often opaque "black boxes," while interpretable methods frequently lack predictive precision or statistical grounding. In this paper, we…
This paper aims at reviewing and analysing the method of reflections. The latter is an iterative procedure designed to linear boundary value problems set in multiply connected domains. Being based on a decomposition of the domain boundary,…
We describe a "slow" version of the hierarchy of uniform reflection principles over Peano Arithmetic ($\mathbf{PA}$). These principles are unprovable in Peano Arithmetic (even when extended by usual reflection principles of lower…
This paper explores the semantics of a combinatory fragment of reFLect, the lambda-calculus underlying a functional language used by Intel Corporation for hardware design and verification. ReFLect is similar to ML, but has a primitive data…
It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this…
In this work we investigate the possibility of using the reflection algebra as a source of functional equations. More precisely, we obtain functional relations determining the partition function of the six-vertex model with domain-wall…
For those of us who generally live in the world of syntax, semantic proof techniques such as reducibility, realizability or logical relations seem somewhat magical despite -- or perhaps due to -- their seemingly unreasonable effectiveness.…
We construct a formal theory, which we call reflectica, whose language possesses the following properties of natural language: it is a self-reflecting language and an intensional language. By a self-reflecting language we understand an…
We continue our study of the representations of the Reflection Equation Algebra (=REA) on Hilbert spaces, focusing again on the REA constructed from the $R$-matrix associated to the standard $q$-deformation of $GL(N,\mathbb{C})$ for…
We introduce Refinement Reflection, a new framework for building SMT-based deductive verifiers. The key idea is to reflect the code implementing a user-defined function into the function's (output) refinement type. As a consequence, at uses…
The Sigma formulas of the language of arithmetic express semidecidable relations on the natural numbers. More generally, whenever a totality of objects is regarded as incomplete, the Sigma formulas express relations that are witnessed in a…
This paper discusses the general structure of reflection positive Euclidean covariant distributions that can be used to construct Euclidean representations of relativistic quantum mechanical models of systems of a finite number of degrees…
While large language models (LLMs) are proficient at question-answering (QA), it is not always clear how (or even if) an answer follows from their latent "beliefs". This lack of interpretability is a growing impediment to widespread use of…
This is a continuation of our "Lecture on Kac--Moody Lie algebras of the arithmetic type" \cite{25}. We consider hyperbolic (i.e. signature $(n,1)$) integral symmetric bilinear form $S:M\times M \to {\Bbb Z}$ (i.e. hyperbolic lattice),…
While LLMs exhibit impressive fluency and factual recall, they struggle with robust causal reasoning, often relying on spurious correlations and brittle patterns. Similarly, traditional Reinforcement Learning agents also lack causal…
Harvey Friedman shows that, over Peano Arithmetic, the consistency statement for a finitely axiomatised theory $A$ can be characterised as the weakest statement $C$ over Peano Arithmetic such that ${\sf PA}+C$ interprets $A$. We study which…
We show that products of propositional modal logics containing the logic of reflexive frames T as a factor are embeddable into their single-variable fragments. The proof is a simplified version of the proof, to appear, of a similar result…
In this paper we study MapReduce computations from a complexity-theoretic perspective. First, we formulate a uniform version of the MRC model of Karloff et al. (2010). We then show that the class of regular languages, and moreover all of…
In this paper we give an overview of an essential part of a Pi^0_1 ordinal analysis of Peano Arithmetic (PA) as presented by Beklemishev. This analysis is mainly performed within the polymodal provability logic GLP. We reflect on ways of…
Relational concept analysis (RCA) is an extension of formal concept analysis allowing to deal with several related contexts simultaneously. It has been designed for learning description logic theories from data and used within various…