arXiv cs.LO Logic in Computer Science

Arvid Becker, Pedro Cabalar, Martin Di\'eguez, Susana Hahn, Javier Romero, Torsten Schaub: Implementing Metric Temporal Answer Set Programming https://arxiv.org/abs/2601.20735 https://arxiv.org/pdf/2601.20735 https://arxiv.org/html/2601.20735

Paul Tarau: Modeling Next-Token Prediction as Left-Nested Intuitionistic Implication https://arxiv.org/abs/2601.19915 https://arxiv.org/pdf/2601.19915 https://arxiv.org/html/2601.19915

Luis Berlioz, Paul-Andr\'e Melli\`es: The Latent Space of Equational Theories https://arxiv.org/abs/2601.20759 https://arxiv.org/pdf/2601.20759 https://arxiv.org/html/2601.20759

Paolo Baldan, Roberto Bruni, Francesco Ranzato, Diletta Rigo: A Program Logic for Abstract (Hyper)Properties https://arxiv.org/abs/2601.20370 https://arxiv.org/pdf/2601.20370 https://arxiv.org/html/2601.20370

[2026-01-29 Thu (UTC), 2 new articles found for csLO Logic in Computer Science]

Richard Mandel, Corto Mascle, Georg Zetzsche: The complexity of downward closures of indexed languages https://arxiv.org/abs/2601.19466 https://arxiv.org/pdf/2601.19466 https://arxiv.org/html/2601.19466

Samy Avrillon, Ambrus Kaposi, Ambroise Lafont, Niyousha Najmaei, Johann Rosain: For Generalised Algebraic Theories, Two Sorts Are Enough https://arxiv.org/abs/2601.19426 https://arxiv.org/pdf/2601.19426 https://arxiv.org/html/2601.19426

St\'ephane Demri, Tianwen Gu: Robustness of Constraint Automata for Description Logics with Concrete Domains https://arxiv.org/abs/2601.19644 https://arxiv.org/pdf/2601.19644 https://arxiv.org/html/2601.19644

Florian Bruse, Martin Lange: A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes https://arxiv.org/abs/2601.19641 https://arxiv.org/pdf/2601.19641 https://arxiv.org/html/2601.19641

Eric Alsmann, Lowejatan Noori, Martin Lange: On the Expressiveness of State Space Models via Temporal Logics https://arxiv.org/abs/2601.19467 https://arxiv.org/pdf/2601.19467 https://arxiv.org/html/2601.19467

[2026-01-28 Wed (UTC), 3 new articles found for csLO Logic in Computer Science]

Daniel Neuen, Tim Seppelt: Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs https://arxiv.org/abs/2601.18602 https://arxiv.org/pdf/2601.18602 https://arxiv.org/html/2601.18602

Ma\"el Dumas, Aliaume Lopez: Well-quasi-ordered classes of bounded clique-width https://arxiv.org/abs/2601.18571 https://arxiv.org/pdf/2601.18571 https://arxiv.org/html/2601.18571

Jens Kosiol, Steffen Zschaler: A note on nested conditions for finite categories of subgraphs https://arxiv.org/abs/2601.18376 https://arxiv.org/pdf/2601.18376 https://arxiv.org/html/2601.18376

Piotr Bacik, Anton Varonka: On the Subspace Orbit Problem and the Simultaneous Skolem Problem https://arxiv.org/abs/2601.18349 https://arxiv.org/pdf/2601.18349 https://arxiv.org/html/2601.18349

L\'eonard Brice, Thomas A. Henzinger, K. S. Thejaswini: Dicey Games: Shared Sources of Randomness in Distributed Systems https://arxiv.org/abs/2601.18303 https://arxiv.org/pdf/2601.18303 https://arxiv.org/html/2601.18303

Ehud Shapiro: Types for Grassroots Logic Programs https://arxiv.org/abs/2601.17957 https://arxiv.org/pdf/2601.17957 https://arxiv.org/html/2601.17957

Jha, Arora, , Zheutlin, Isaza, Shwartz, Deng, Sow, Mahindru, Puri: Think Locally, Explain Globally: Graph-Guided LLM Investigations via Local Reasoning and Belief Propagation https://arxiv.org/abs/2601.17915 https://arxiv.org/pdf/2601.17915 https://arxiv.org/html/2601.17915

Hugo Bazille, J\'er\'emy Dubut, Uli Fahrenberg, Krzysztof Ziemia\'nski: Variants of Higher-Dimensional Automata https://arxiv.org/abs/2601.17537 https://arxiv.org/pdf/2601.17537 https://arxiv.org/html/2601.17537

Zhengqing Zang, Yuqi Ding, Yanmei Gu, Changkai Song, Zhengkai Yang, Guoping Du, Junbo Zhao, Haobo Wang: A Syllogistic Probe: Tracing the Evolution of Logic Reasoning in Large Language Models https://arxiv.org/abs/2601.17426 https://arxiv.org/pdf/2601.17426 https://arxiv.org/html/2601.17426

Ruotong Cheng, Azadeh Farzan: Symmetric Proofs of Parameterized Programs https://arxiv.org/abs/2601.18745 https://arxiv.org/pdf/2601.18745 https://arxiv.org/html/2601.18745

Corentin Barloy, Felix Tschirbs, Nils Vortmeier, Thomas Zeume: Algebraic Characterizations of Classes of Regular Languages in DynFO https://arxiv.org/abs/2601.18429 https://arxiv.org/pdf/2601.18429 https://arxiv.org/html/2601.18429

Paul-Andr\'e Melli\`es, Vincent Moreau: A cartesian closed fibration of higher-order regular languages https://arxiv.org/abs/2601.18000 https://arxiv.org/pdf/2601.18000 https://arxiv.org/html/2601.18000

Yong Wang: Structural Operational Semantics for True Concurrency https://arxiv.org/abs/2601.17322 https://arxiv.org/pdf/2601.17322 https://arxiv.org/html/2601.17322

[2026-01-27 Tue (UTC), 4 new articles found for csLO Logic in Computer Science]

Markus Anders, Cayden Codel, Marijn J. H. Heule: Orbitopal Fixing in SAT https://arxiv.org/abs/2601.16855 https://arxiv.org/pdf/2601.16855 https://arxiv.org/html/2601.16855

[2026-01-26 Mon (UTC), 1 new article found for csLO Logic in Computer Science]

Hector Buffi\`ere, Yuquan Lin, Jaroslav Ne\v{s}et\v{r}il, Patrice Ossona de Mendez, Sebastian Siebertz: Characterizations of monadically dependent tree-ordered weakly sparse structures https://arxiv.org/abs/2601.16039 https://arxiv.org/pdf/2601.16039 https://arxiv.org/html/2601.16039

Antonio Casares, Christof L\"oding, Igor Walukiewicz: Layered automata: A canonical model for automata over infinite words https://arxiv.org/abs/2601.15940 https://arxiv.org/pdf/2601.15940 https://arxiv.org/html/2601.15940

Nikolas M\"ahlmann, Sebastian Siebertz: Existential Positive Transductions of Sparse Graphs https://arxiv.org/abs/2601.15890 https://arxiv.org/pdf/2601.15890 https://arxiv.org/html/2601.15890