Pure Math · Mathematics & Statistics
Logic
The newest papers in Logic that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
17 papers, from 7 September 2026 to 5 November 2026: 17 arXiv preprints.
Get the few papers worth your time in Logic every morning.
Follow Logic and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers
First-Order Model Checking on Monadically Dependent Graph Classes
Monadically dependent graph classes are those in which first-order logic cannot encode all graphs.An Engineering Reading of the Bounded Halting Problem and Observable Properties of a Universal Machine
The halting problem asks whether a program eventually halts, with unrestricted resources.Monadically Dependent Graph Classes Have Almost Bounded Merge-Width
A graph class $\mathcal{C}$ is monadically dependent if one cannot interpret all graphs in vertex-colored graphs from $\mathcal{C}$ using a fixed formula of first-order logic.Classical and Quantum Logics with Multiple Non-Equivalent and Non-Isomorphic Models
Both quantum and classical logics have several mutually non-equivalent and non-isomorphic models as has repeatedly been proved in the literature.Polyteam logics for quantum contextuality
We introduce logics of dependence and independence over polyteams (that is, databases with multiple relation schemes), in a similar way as in arXiv:1704.02158v3 [cs.LO].On the gradient conjecture at infinity: Finite spherical length for gradient trajectories of definable potentials
We prove that for every open $ U \subseteq \mathbb R^n $ the spherical projection of every gradient trajectory $θ(t)$, $t \geq 0$, of a definable $C^1$-potential $F \colon U \to \mathbb R$ has…Tactix: Towards a Programmable Strategy Interface for Flexible SAT Solving
Modern SAT solvers combine a rich repertoire of proof rules with sophisticated strategies that determine when and how to apply them.Classification of bipartite observables III: simplicity, mixtures and quantum error correction
This is the third of a series of three papers that bring model theory to quantum information.A Computationally-Efficient Closed-Form $C^{s,1}$-Extension Formula
We identify explicit closed-form and variational formulae for interpolating the exact values and derivatives through order $s$ of a $C^{s,1}$ function $f:\mathbb{R}^d\to\mathbb{R}$ at $N$ distinct…Navier-Stokes lost in translation: Why Lean verification of AI autoformalisation does not guarantee correct natural language proofs
Autoformalisation is increasingly used to verify mathematical texts, including those generated by AI, as in OpenAI's announced proof of blow-up of solutions to the Navier-Stokes equations.Proofs Without Nominals: Gödel's Ontological Argument, its Shallow Embedding, and the Open Questions of the Monatshefte Notes
The shallow embedding of higher-order modal logic in classical higher-order logic, used in Benzmüller and Scott's Notes on Gödel's and Scott's variants of the ontological argument (2025), reaches…Eventual and Strong Eventual Notions in Public Announcements
In dynamic epistemic logic, the four notions of success, self-refutation, true lies, and impossible lies have been discussed in the context of public announcements.Contributions to the hierarchy of probabilistic languages
We reconsider the theory of probabilistic formal languages generated by n-gram models and by probabilistic context-free grammars (PCFGs).Stable Regularity Lemmas: Efficient Algorithms and Essentially Tight Littlestone Bounds
In this paper, we determine the precise asymptotics of the number of parts of stable regularity equipartitions in terms of the Littlestone dimension: every graph $G$ of Littlestone dimension…Diversity of EML-type operators
The discovery of the EML operator, sufficient to evaluate the standard explicit purely transcendental elementary functions, has led to considerable interest and discussion across multiple scientific…The Semantic Elevation Operator and the Closure of the Undecidable Class under Preservation
The undecidability of a program's static semantic properties is governed by Rice's theorem.Monadic Second-Order Logic in HOL: Deep and Shallow with Automated Faithfulness (Extended Preprint)
In Isabelle/HOL, we apply the deep-and-shallow embedding methodology of our prior work to monadic second-order logic (MSO).