Logic in Computer Science Papers of the Week

This paper considers online intrusion-risk assessment and graded warning for unmanned aerial vehicles under bounded measurement attacks. To address this problem, we develop a monitoring framework that combines trusted state estimation, attack-aware risk assessment, and probabilistic signal temporal logic (PrSTL).

``Emergence'' refers to the fact that different mathematical languages and theories seem to be required to describe scientific theories that operate at different spatial and temporal scales.

However, parsing the format is non-trivial and can become a bottleneck, e.g. when retrieving benchmark metadata or normalising the input for solvers. We introduce blazing-smtlib, a Rust parsing library for SMT-LIB, and BSmtLib, its port to Lean.

Prominent examples include the AKLT model and Kitaev's toric code model, which serve as paradigmatic models of symmetry-protected topological phases and topological order, respectively.

In particular, we show that in monadically dependent classes, tuples of fixed length have only $|U|^{O(1)}$ types of fixed quantifier rank over any set of parameters $U$.

We prove that every monadically dependent graph class has almost bounded merge-width, thereby confirming a conjecture of the first and the last author [STOC '25].

Work applying quantum-inspired techniques and structures to other fields such as (classical) computation, linguistics, artificial intelligence, and causality is also welcome.

We construct a finite computational calculus in which retained logarithmic branches supply memory, analytic observations select operations, and descent through a covering exposes deeper memory.

We show that shortest paths and equidistance guarded by geodesic cycles are definable in ordinary vertex-set MSO on graph classes of bounded cycle-basis length.

This paper presents the Math Foundation Formalization Agent (MFF-Agent), a general-purpose intelligent agent designed to support formalization tasks across multiple mathematical domains.

We conduct the first systematic mining of 53 Lean Blueprint projects, a previously untapped corpus of 3,805 manually curated informal+formal nodes that capture rare, research-level premises absent from Mathlib4.

The highest-scoring model, GPT-6.1 Sol (max), proved 31 (44.3%) proof targets.

The goal of this paper is to provide lower and upper bounds on the ordinals that are needed to construct final coalgebras over $R$-modules as the limit of a transfinite sequence of functor iterations.

We present the Whiel (a contraction of Whi(le-R)el) system for Lean-certified reasoning about imperative relational programs.

Hence, not every map from $I\times J$ into an arbitrary convex semilattice $X$ extends uniquely to a homomorphism from $\mathcal FI\times\mathcal FJ$ to $X$. We investigate a condition on a map $\varphi$ of $I\times J$ into some convex semilattice $X$ that is always necessary and often sufficient for $\varphi$ to have such an extension to a homomorphism $\Phi$ of $\mathcal FI\times\mathcal FJ$ into $X$.

We study the minimum number of clauses required to encode a boolean function into a CNF formula with auxiliary variables.

Although coding agents have been explored for automated proof construction, existing Verus benchmarks offer limited coverage of concurrency-specific examples that connect atomic operations to abstract protocols. To address this gap, we introduce VerusWeave, the first benchmark dedicated to concurrent proof repair, derived from four open-source projects.

Building on ideas from both approaches, we present a new construction that directly yields logical twins in Łukasiewicz logic.

We study distributed synthesis for two processes communicating in rounds over unreliable links, with at least one message delivered in every round.