Theory & Algorithms · Computer Science & AI
Logic in Computer Science
The newest papers in Logic in Computer Science that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
168 papers, from 4 September 2026 to 5 November 2026: 168 arXiv preprints.
Get the few papers worth your time in Logic in Computer Science every morning.
Follow Logic in Computer Science 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, page 7
Jev thinks "I don't know'', but doesn't say it: Introducing Sys1Cal-v1 Dataset for Probability Calibration
The appearance of Jev marked the era of System One Models, foundation models that return structured decisions with probability distributions rather than text.Irene: Equivalence Checking of Hybrid Quantum Programs via Structure-Preserving Symbolic Reduction
Equivalence checking is essential for validating compiler transformations of hybrid quantum programs, which combine quantum operations, measurements, and classical control.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…More than 83.69% of the zeros of the Riemann zeta function are distinct
The lower asymptotic proportion of distinct nontrivial zeros of the Riemann zeta function, counted with multiplicity, is at least $0.8369928814\ldots$.Zero-Storage Procedural Neural Synthesis via Boundary Dynamics: Formal Verification in Lean 4 and Bare-Metal Gauntlet Validation
Contemporary neural inference architectures rely on dense floating-point weight matrices stored in high-bandwidth memory (VRAM), incurring severe memory-wall bottlenecks and preventing native…Protected Cores Are Not Enough: Certifying AI-Proposed Revisions of Temporal Specifications
Runtime monitoring traditionally evaluates a specification that is fixed before execution or externally modified when requirements change.E-CONAN (Entailment, CONtradition And Neutral) Diagnostics Dataset Investigating Linguistic Phenomena in Arabic Natural Language Understanding
Natural Language Understanding (NLU) plays a crucial role in various applications, yet its performance suffers from weaknesses in handling the complexities of human languages, ranging from lexical…Quizzing the Translation: A Prover-Grounded Evaluation Metric for NL$\rightarrow$FOL
A standard pipeline for symbolic reasoning over natural-language problems translates them into first-order logic and invokes a theorem prover.Task-Aware Discretization of Differentiable Logic Gate Networks
Differentiable logic gate networks (DLGNs) enable gradient-based training of highly efficient Boolean networks by relaxing discrete logic gates during training and discretizing them for inference.Progression- vs Automata-based Anticipatory Monitoring of LTL over Finite Traces (Extended Version)
When safety-critical systems are developed from a known internal specification, their correctness can be established by model checking.Choir: An Open Protocol for Distributed Multi-Agent Autoformalization
AI agents can now formalize entire textbooks and major theorems in proof assistants such as Lean, but current efforts are typically centralized: a single team runs all agents and bears the full…Realizability Is Not Enough: Encoding, Liveness, and Auditing of Synthesized Robot Supervisors
High-level robotic supervisors coordinate capabilities whose reported outcomes determine the robot's next action.Proceedings Tenth Symposium on Working Formal Methods
The 10th Working Formal Methods Symposium (FROM 2026) was held in Timişoara, Romania on September 15-17, 2026.Compiling Sufficient Governance Context from Declared Losses and Reachable States: Exact Observation-Contract Synthesis with Cardinality and Cost Objectives
We call the object this paper derives and certifies a minimal sufficient governance context: given a finite reachable-state model, a deterministic declared verdict, and candidate observable…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.Exactness at Inference: A Representational Criterion for Out-of-Distribution Generalization
A model generalizes outside its training distribution only when it computes a representation structurally equivalent to the generating mechanism, not an approximation fitted to it.Modular Composition of Inductive Types Using Lean Meta-programming
Inductive types are ubiquitous building blocks in many programming and theorem proving languages.SoK: Formal Methods for Fact-Checking and Information Integrity
An automated fact-checking system returns a label: the claim is true, or it is false.LogicTrack: Auditing Reasoning Trajectories of Large Language Models with Formal Logic Solvers
Chain-of-Thought (CoT) reasoning has been shown to improve the performance of large language models (LLMs), yet existing optimization methods largely rely on outcome-based feedback, leaving the…Long-horizon autoformalization of a core theorem underlying MIP* = RE
Landmark mathematical formalizations have taken specialist teams years to complete.