Tootfinder

Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards (Extended Version)
Bartosz Bednarczyk, Emanuel Kiero\'nski
https://arxiv.org/abs/2509.09218 https://…

Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards (Extended Version)
We study the Guarded Fragment with Regular Guards (RGF), which combines the expressive power of the Guarded Fragment (GF) with Propositional Dynamic Logic with Intersection and Converse (ICPDL). Our logic generalizes, in a uniform way, many previously-studied extensions of GF, including (conjunctions of) transitive or equivalence guards, transitive or equivalence closure and more. We prove 2EXPTIME-completeness of the satisfiability problem for RGF, showing that RGF is not harder than ICPDL or …

Optimum 1-Step Majority-Logic Decoding of Binary Reed-Muller Codes
Hoang Ly, Emina Soljanin
https://arxiv.org/abs/2508.08736 https://arxiv.org/pdf/2508.087…

Optimum 1-Step Majority-Logic Decoding of Binary Reed-Muller Codes
The classical majority-logic decoder proposed by Reed for Reed-Muller codes RM(r, m) of order r and length 2^m, unfolds in r+1 sequential steps, decoding message symbols from highest to lowest degree. Several follow-up decoding algorithms reduced the number of steps, but for a limited set of parameters, or at the expense of reduced performance, or relying on the existence of some combinatorial structures. We show that any one-step majority-logic decoder-that is, a decoder performing all majorit…

Two years later, Cowboys might finally be going ‘all-in’... in 2026 https://cowboyswire.usatoday.com/story/sports/nfl/cowboys/2025/11/11/trades-logic-dallas-cowboys-all-in-2026/87201218007/

Hybrid Models for Natural Language Reasoning: The Case of Syllogistic Logic
Manuel Vargas Guzm\'an, Jakub Szymanik, Maciej Malicki
https://arxiv.org/abs/2510.09472 https://

Hybrid Models for Natural Language Reasoning: The Case of Syllogistic Logic
Despite the remarkable progress in neural models, their ability to generalize, a cornerstone for applications like logical reasoning, remains a critical challenge. We delineate two fundamental aspects of this ability: compositionality, the capacity to abstract atomic logical rules underlying complex inferences, and recursiveness, the aptitude to build intricate representations through iterative application of inference rules. In the literature, these two aspects are often confounded together un…

What You Code Is What We Prove: Translating BLE App Logic into Formal Models with LLMs for Vulnerability Detection
Biwei Yan, Yue Zhang, Minghui Xu, Runyu Pan, Jinku Li, Xiuzhen Cheng
https://arxiv.org/abs/2509.09291

What You Code Is What We Prove: Translating BLE App Logic into Formal Models with LLMs for Vulnerability Detection
The application layer of Bluetooth Low Energy (BLE) is a growing source of security vulnerabilities, as developers often neglect to implement critical protections such as encryption, authentication, and freshness. While formal verification offers a principled way to check these properties, the manual effort of constructing formal models makes it impractical for large-scale analysis. This paper introduces a key insight: BLE application security analysis can be reframed as a semantic translation …

The Fractal Logic of $\Phi$-adic Recursion
Milan Rosko
https://arxiv.org/abs/2510.08934 https://arxiv.org/pdf/2510.08934

The Fractal Logic of $Φ$-adic Recursion
We establish that valid $Σ_1$ propositional inference admits reduction to Fibonacci-indexed witness equations. Specifically, modus ponens verification reduces to solving a linear Diophantine equation in $O(M(\log n))$ time, where $M$ denotes integer multiplication complexity. This reduction is transitive: tautology verification proceeds via Fibonacci index arithmetic, bypassing semantic evaluation entirely. The core discovery is a transitive closure principle in $Φ$-scaled space (Hausdorff di…

listening to colleagues try to talk through the logic of "agentic" systems feels like they're just now discovering/reinventing multithreading, message-passing, and IPC
...except that every single component is stochastically noisy and fundamentally not unit-testable

ok so the MHO98 logic analyzer is. not good. at all.
and the protocol decoders are basically not useful, i can see why they haven't bothered implementing even 10 of them (they only decode what's exactly on screen, like on the lower end models)
it's best understood as "logic analyzer attachment to orient you for where you want to see your analog traces" more so than a "logic analyzer" per se in any meaningful sense of the term

Truth-Aware Decoding: A Program-Logic Approach to Factual Language Generation
Faruk Alpay, Hamdi Alakkad
https://arxiv.org/abs/2510.07331 https://arxiv.org…

Truth-Aware Decoding: A Program-Logic Approach to Factual Language Generation
This paper introduces Truth-Aware Decoding (TAD), a verification-oriented decoding scheme that aligns neural language generation with knowledge bases. Situated in the tradition of probabilistic program semantics for sequence models, TAD augments modern instruction-tuned systems with a lattice of semantic guards that operate at decode time. Our contributions are fourfold: (i) a constraint-based semantics that renders oracle filtering as a program-logic judgment, (ii) a proof that greedy selectio…

Explaining Concept Drift through the Evolution of Group Counterfactuals
Ignacy St\k{e}pka, Jerzy Stefanowski
https://arxiv.org/abs/2509.09616 https://arxiv…

Explaining Concept Drift through the Evolution of Group Counterfactuals
Machine learning models in dynamic environments often suffer from concept drift, where changes in the data distribution degrade performance. While detecting this drift is a well-studied topic, explaining how and why the model's decision-making logic changes still remains a significant challenge. In this paper, we introduce a novel methodology to explain concept drift by analyzing the temporal evolution of group-based counterfactual explanations (GCEs). Our approach tracks shifts in the GCEs' cl…

Complex Logical Instruction Generation
Mian Zhang, Shujian Liu, Sixun Dong, Ming Yin, Yebowen Hu, Xun Wang, Steven Ma, Song Wang, Sathish Reddy Indurthi, Haoyun Deng, Zhiyu Zoey Chen, Kaiqiang Song
https://arxiv.org/abs/2508.09125

Complex Logical Instruction Generation
Instruction following has catalyzed the recent era of Large Language Models (LLMs) and is the foundational skill underpinning more advanced capabilities such as reasoning and agentic behaviors. As tasks grow more challenging, the logic structures embedded in natural language instructions becomes increasingly intricate. However, how well LLMs perform on such logic-rich instructions remains under-explored. We propose LogicIFGen and LogicIFEval. LogicIFGen is a scalable, automated framework for ge…

TraceRAG: A LLM-Based Framework for Explainable Android Malware Detection and Behavior Analysis
Guangyu Zhang, Xixuan Wang, Shiyu Sun, Peiyan Xiao, Kun Sun, Yanhai Xiong
https://arxiv.org/abs/2509.08865

TraceRAG: A LLM-Based Framework for Explainable Android Malware Detection and Behavior Analysis
Sophisticated evasion tactics in malicious Android applications, combined with their intricate behavioral semantics, enable attackers to conceal malicious logic within legitimate functions, underscoring the critical need for robust and in-depth analysis frameworks. However, traditional analysis techniques often fail to recover deeply hidden behaviors or provide human-readable justifications for their decisions. Inspired by advances in large language models (LLMs), we introduce TraceRAG, a retri…

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
Alessandro Artale, Christopher Hampson, Roman Kontchakov, Andrea Mazzullo, Frank Wolter
https://arxiv.org/abs/2509.08165

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only holds, however, under the provision that non-rigid constants, definite descriptions and non-trivial counting are not admitted. Indeed, several monodic fragments having at least one of these features are known to be undecidable. We investigate these features syst…

Ex-PM Sunak becomes human Clippy for Microsoft, Anthropic:
«Known for creating systems that defy logic and often require a forced restart, Sunak will continue to serve as an MP on the Conservative backbenches» 😄
https://www.theregister.com/2025/10/10/former_uk_prime_minister_rishi/?td=rt-3a

The Vegan Logic Test: If You Believe These 6 Things, You’re Nearly There https://veganfta.com/blog/2025/09/24/the-vegan-logic-test-if-you-believe-these-6-things-youre-nearly-there/?utm_source=Mastodon

The Vegan Logic Test: If You Believe These 6 Things, You’re Nearly There
People have some serious issues when the word ‘vegan’ comes up. It can trigger defensiveness. But have you considered that you may, in some ways, think like a vegan more than you previously thought?

🇺🇦 #NowPlaying on #BBC6Music's #LaurenLaverne
LoneLady:
🎵 (There Is) No Logic
#LoneLady
https://lonelady.bandcamp.com/track/there-is-no-logic
https://open.spotify.com/track/4W7YlNbPlnHQd6RaCE3UyS

Series B, Episode 04 - Horizon
[Teleport section]
AVON: [Snapping on a bracelet] What do these detectors look like?
ORAC: Logic would suggest they are camouflaged - in plants.
https://blake.torpidity.net/m/204/536 B7B3

Replaced article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- Notes on the equiconsistency of ZFC without the Power Set axiom and second order PA
Vladimir Kanovei, Vassily Lyubetsky

Compact Plasmonic Logic Gates Enabled by Magnetoelectric Light Funneling for On-Chip Optical Computing in the Telecom Band
Adib Md. Tawsif, Khondokar Zahin, A. K. M. Hasibul Hoque, Ying Yin Tsui, Md Zahurul Islam
https://arxiv.org/abs/2509.06143

Compact Plasmonic Logic Gates Enabled by Magnetoelectric Light Funneling for On-Chip Optical Computing in the Telecom Band
The realization of all-optical logic gates (AOLGs) is important for advancing photonic integrated circuit (PIC) design and optical data communication. Various photonic structures and design techniques, including two-dimensional photonic crystals, silicon waveguides, plasmonic waveguides, diffractive neural networks, and inverse design techniques, are actively being explored to achieve multifunctional, high-performance optical logic gates with fast data processing capabilities. Among these, plas…

Replaced article(s) found for cs.SC. https://arxiv.org/list/cs.SC/new
[1/1]:
- Solving unification in the description logic $\mathcal{FL}_\bot$
Barbara Morawska, Dariusz Marzec

On Assessing Overall Survival (OS) in Oncology Studies
Jason C. Hsu
https://arxiv.org/abs/2510.07122 https://arxiv.org/pdf/2510.07122

On Assessing Overall Survival (OS) in Oncology Studies
In assessing Overall Survival (OS) in oncology studies, it is essential for the efficacy measure to be Logic-respecting, for otherwise patients may be incorrectly targeted. This paper explains, while Time Ratio (TR) is Logic-respecting, Hazard Ratio (HR) is not Logic-respecting. With Time Ratio (TR) being recommended, a smooth transitioning strategy is suggested. The conclusion states: Logicality requires, and Subgroup Mixable Estimation (SME) delivers, an efficacy assessment for the overall po…

Anchored Implication & Event-Indexed Fixed Points in Hilbert Spaces: Uniqueness and Quantitative Rates
Faruk Alpay, Bugra Kilictas, Taylan Alpay
https://arxiv.org/abs/2508.08397

Anchored Implication & Event-Indexed Fixed Points in Hilbert Spaces: Uniqueness and Quantitative Rates
We develop a synthesis of orthomodular logic (projections as propositions) with operator fixed-point theory in Hilbert spaces. First, we introduce an anchored implication connective $A \Rightarrow^{\mathrm{comm}}_{P} B$, defined semantically so that it is true only when either $A$ is false or else $A$ is true and $B$ is true in a ''commuting'' context specified by a fixed nonzero projection $P$. This connective refines material implication by adding a side condition $[E_B,P]=0$ (commutation of …

Crosslisted article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- An MDL-Style Cost Functional KC, Distribution-Preserving Reductions ($A2^d$), and an $AC^0$ log L...
Marko Lela

Imaging of Gate-Controlled Suppression of Superconductivity via the Meissner Effect
P. J. Scheidegger, K. J. Knapp, U. Ognjanovic, L. Ruf, S. Diesch, E. Scheer, A. Di Bernardo, C. L. Degen
https://arxiv.org/abs/2510.09044

Imaging of Gate-Controlled Suppression of Superconductivity via the Meissner Effect
It was recently discovered that supercurrents flowing through thin superconducting nanowires can be quenched by a gate voltage. This gate control of supercurrents, known as the GCS effect, could enable superconducting transistor logic. Here, we report that the GCS also manifests in a suppression of Meissner screening, establishing the phenomenon as a genuine feature of superconductivity that is not restricted to transport. Using a scanning nitrogen-vacancy magnetometer at sub-Kelvin temperature…

A 28nm Multiply-Accumulate ASIC Architecture for On-Chip Data Compression in MHz Frame Rate X-ray and Electron Pixel Detectors
Rami Rasheedi, Nicholas Contini, Mohamed Adel Gharib, Sebastian Strempfer, Senthil Gnanasekaran, Salma Abdelzaher, Tejas Guruswamy, Kazutomo Yoshii, Mike Hammer, Henry Shi, Yu-Sheng Chen, Lorenzo Rota, Dionisio Doering, Angelo Dragone, Tao Zhou, Antonino Miceli

A 28nm Multiply-Accumulate ASIC Architecture for On-Chip Data Compression in MHz Frame Rate X-ray and Electron Pixel Detectors
Modern X-ray detector systems urgently require compact, efficient, and fast data compression schemes to handle the transmission of big data from pixel arrays, enabling frame rates in the MHz regime. In this work, a data compression ASIC that implements a streaming fixed-length lossy compression scheme is introduced and analyzed, proving the feasibility and benefits of on-chip compression. The compression scheme utilizes a vector matrix product logic, which performs a number of floating-point mu…

XML Prompting as Grammar-Constrained Interaction: Fixed-Point Semantics, Convergence Guarantees, and Human-AI Protocols
Faruk Alpay, Taylan Alpay
https://arxiv.org/abs/2509.08182

XML Prompting as Grammar-Constrained Interaction: Fixed-Point Semantics, Convergence Guarantees, and Human-AI Protocols
Structured prompting with XML tags has emerged as an effective way to steer large language models (LLMs) toward parseable, schema-adherent outputs in real-world systems. We develop a logic-first treatment of XML prompting that unifies (i) grammar-constrained decoding, (ii) fixed-point semantics over lattices of hierarchical prompts, and (iii) convergent human-AI interaction loops. We formalize a complete lattice of XML trees under a refinement order and prove that monotone prompt-to-prompt oper…

After today's capitulation by the D-party Fox News is forecasting a total sweep by the R-party in November 2026.
Given that the D-party can't organize themselves out of a wet paper bag, and then sinks their own boat by elevating identity politics over pretty much everything else, I can see the logic in such a move by Fox News.
(And, no, Fox News did not really predict that total sweep.)

Inductive Learning for Possibilistic Logic Programs Under Stable Models
Hongbo Hu, Yisong Wang, Yi Huang, Kewen Wang
https://arxiv.org/abs/2510.07069 https://

Inductive Learning for Possibilistic Logic Programs Under Stable Models
Possibilistic logic programs (poss-programs) under stable models are a major variant of answer set programming (ASP). While its semantics (possibilistic stable models) and properties have been well investigated, the problem of inductive reasoning has not been investigated yet. This paper presents an approach to extracting poss-programs from a background program and examples (parts of intended possibilistic stable models). To this end, the notion of induction tasks is first formally defined, its…

Evaluating Rapid Makespan Predictions for Heterogeneous Systems with Programmable Logic
Martin Wilhelm, Franz Freitag, Max Tzschoppe, Thilo Pionteck
https://arxiv.org/abs/2510.06998

Evaluating Rapid Makespan Predictions for Heterogeneous Systems with Programmable Logic
Heterogeneous computing systems, which combine general-purpose processors with specialized accelerators, are increasingly important for optimizing the performance of modern applications. A central challenge is to decide which parts of an application should be executed on which accelerator or, more generally, how to map the tasks of an application to available devices. Predicting the impact of a change in a task mapping on the overall makespan is non-trivial. While there are very capable simulat…

Crosslisted article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- On actions and split extensions in varieties of hoops: the case of strong section
Manuel Mancini, Giuseppe Metere, Federica Piazza

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Strong normalization through idempotent intersection types: a new syntactical approach
Pablo Barenbaum, Simona Ronchi Della Rocca, Cristian Sottile

AI music startup Suno launches Suno Studio, in beta with its premier plan; the digital audio workstation combines Suno's music generation tools into one product (Kristin Robinson/Billboard)
https://www.billboard.com/pro/ai-music-company-suno-launches…

AI Music Giant Suno Launches DAW to Rival Logic, Ableton
AI music company Suno has launched a DAW to rival Logic, Ableton, FL Studio and more longtime DAWs.

A multi-layered embedded intrusion detection framework for programmable logic controllers
Rishabh Das. Aaron Werth, Tommy Morris
https://arxiv.org/abs/2510.07171 https://…

A multi-layered embedded intrusion detection framework for programmable logic controllers
Industrial control system (ICS) operations use trusted endpoints like human machine interfaces (HMIs) and workstations to relay commands to programmable logic controllers (PLCs). Because most PLCs lack layered defenses, compromise of a trusted endpoint can drive unsafe actuator commands and risk safety-critical operation. This research presents an embedded intrusion detection system that runs inside the controller and uses header-level telemetry to detect and respond to network attacks. The sys…

MM-HELIX: Boosting Multimodal Long-Chain Reflective Reasoning with Holistic Platform and Adaptive Hybrid Policy Optimization
Xiangyu Zhao, Junming Lin, Tianhao Liang, Yifan Zhou, Wenhao Chai, Yuzhe Gu, Weiyun Wang, Kai Chen, Gen Luo, Wenwei Zhang, Junchi Yan, Hua Yang, Haodong Duan, Xue Yang
https://arxiv.org/abs/2510.08540

MM-HELIX: Boosting Multimodal Long-Chain Reflective Reasoning with Holistic Platform and Adaptive Hybrid Policy Optimization
While current Multimodal Large Language Models (MLLMs) have demonstrated proficiency in reasoning tasks such as mathematics and logic, their capacity for long-chain reflective reasoning, a prerequisite for solving complex real-world problems, remains largely underexplored. In this work, we first conduct an extensive empirical investigation to evaluate this capability. Leveraging a carefully designed data synthesis engine, we construct MM-HELIX, a multimodal benchmark consisting 1,260 samples of…

Skyrmion manipulation and logic gate functionality in transition metal multilayers
Tamali Mukherjee, V Satya Narayana Murthy, Banasree Sadhukhan
https://arxiv.org/abs/2509.05951

Skyrmion manipulation and logic gate functionality in transition metal multilayers
Magnetic skyrmions, due to their topological stability and high mobility, are strong candidates for information carriers in spintronic devices. To advance their practical applications, a detailed understanding of their nucleation and current-driven dynamics is essential. We investigate the formation and manipulation of skyrmions in a square nano structure (200 $\times$ 200 nm$^{2}$, 1 nm thick) of PdFe/Ir(111) multilayers subjected to nano second current pulses with magnitude ranging from (1-5)…

AP-observation Automata for Abstraction-based Verification of Continuous-time Systems (Extended Version)
Sasinee Pruekprasert, Clovis Eberhart
https://arxiv.org/abs/2509.08343 h…

AP-observation Automata for Abstraction-based Verification of Continuous-time Systems (Extended Version)
A key challenge in abstraction-based verification and control under complex specifications such as Linear Temporal Logic (LTL) is that abstract models retain significantly less information than their original systems. This issue is especially true for continuous-time systems, where the system state trajectories are split into intervals of discrete actions, and satisfaction of atomic propositions is abstracted to a whole time interval. To tackle this challenge, this work introduces a novel trans…

The analogy theorem in Hoare logic
Nikitin Nikita
https://arxiv.org/abs/2510.03685 https://arxiv.org/pdf/2510.03685…

The analogy theorem in Hoare logic
The introduction of machine learning methods has led to significant advances in automation, optimization, and discoveries in various fields of science and technology. However, their widespread application faces a fundamental limitation: the transfer of models between data domains generally lacks a rigorous mathematical justification. The key problem is the lack of formal criteria to guarantee that a model trained on one type of data will retain its properties on another.This paper proposes a so…

Replaced article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- Nonamenable subforests of multi-ended quasi-pmp graphs
Ruiyuan Chen, Grigory Terlov, Anush Tserunyan
…

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Double Glueing over Free Exponential: with Measure Theoretic Applications
Masahiro Hamano

Crosslisted article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Feasibility-Guided Fair Adaptive Offline Reinforcement Learning for Medicaid Care Management
Basu, Patel, Sheth, Muralidharan, Elamaran, Kinra, Batniji

MoLoRAG: Bootstrapping Document Understanding via Multi-modal Logic-aware Retrieval
Xixi Wu, Yanchao Tan, Nan Hou, Ruiyang Zhang, Hong Cheng
https://arxiv.org/abs/2509.07666 htt…

MoLoRAG: Bootstrapping Document Understanding via Multi-modal Logic-aware Retrieval
Document Understanding is a foundational AI capability with broad applications, and Document Question Answering (DocQA) is a key evaluation task. Traditional methods convert the document into text for processing by Large Language Models (LLMs), but this process strips away critical multi-modal information like figures. While Large Vision-Language Models (LVLMs) address this limitation, their constrained input size makes multi-page document comprehension infeasible. Retrieval-augmented generatio…

Replaced article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- Countably-categorical Boolean rings with distinguished ideals
Andrew Apps
htt…

Handling Open-Vocabulary Constructs in Formalizing Specifications: Retrieval-Augmented Parsing with Expert Knowledge
Mohammad Saqib Hasan, Sayontan Ghosh, Dhruv Verma, Geoff Kuenning, Erez Zadok, Scott A. Smolka, Niranjan Balasubramanian
https://arxiv.org/abs/2509.08808

Handling Open-Vocabulary Constructs in Formalizing Specifications: Retrieval-Augmented Parsing with Expert Knowledge
We study the problem of Open-Vocabulary Constructs(OVCs) -- ones not known beforehand -- in the context of converting natural language (NL) specifications into formal languages (e.g., temporal logic or code). Models fare poorly on OVCs due to a lack of necessary knowledge a priori. In such situations, a domain expert can provide correct constructs at inference time based on their preferences or domain knowledge. Our goal is to effectively reuse this inference-time, expert-provided knowledge for…

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Targeting Completeness: Automated Complexity Analysis of Integer Programs
Nils Lommen, \'El\'eanore Meyer, J\"urgen Giesl

crab computer https://www.technologyreview.com/2012/04/12/186779/computer-scientists-build-computer-using-swarms-of-crabs/

Advancing Plasmonic Computing with Single-Beam Logic Primitives
Komal Gupta, Anand Hegde, Chen-Bin Huang
https://arxiv.org/abs/2510.03733 https://arxiv.org…

Advancing Plasmonic Computing with Single-Beam Logic Primitives
Plasmonic logic circuits combine ultrafast operation with nanoscale integration, making them a strong candidate for next-generation optical computing. Realizing this potential, however, requires overcoming practical challenges such as bulky interferometric designs and reliance on secondary control signals. This work advances plasmonic logic by introducing a single-global threshold mechanism in plasmonic two-wire transmission lines, empowered with polarization modal selectivity and geometric tun…

Crosslisted article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
Alessandro Artale, Christopher Hampson, Roman Kontchakov, Andrea Mazzullo, Frank Wolter

A Hoare Logic for Symmetry Properties
Vaibhav Mehta, Justin Hsu
https://arxiv.org/abs/2509.00587 https://arxiv.org/pdf/2509.00587

A Hoare Logic for Symmetry Properties
Many natural program correctness properties can be stated in terms of symmetries, but existing formal methods have little support for reasoning about such properties. We consider how to formally verify a broad class of symmetry properties expressed in terms of group actions. To specify these properties, we design a syntax for group actions, supporting standard constructions and a natural notion of entailment. Then, we develop a Hoare-style logic for verifying symmetry properties of …

Interpolation in First-Order Logic
Balder ten Cate, Jesse Comer
https://arxiv.org/abs/2510.03822 https://arxiv.org/pdf/2510.03822

Interpolation in First-Order Logic
In this chapter we give a basic overview of known results regarding Craig interpolation for first-order logic as well as for fragments of first-order logic. Our aim is to provide an entry point into the literature on interpolation theorems for first-order logic and fragments of first-order logic, and their applications. In particular, we cover a range of known refinements of the Craig interpolation theorem, we discuss several important applications of interpolation in logic and computer science…

Domain size asymptotics for Markov logic networks
Vera Koponen
https://arxiv.org/abs/2509.04192 https://arxiv.org/pdf/2509.04192

Domain size asymptotics for Markov logic networks
A Markov logic network (MLN) determines a probability distribution on the set of structures, or ``possible worlds'', with an arbitrary finite domain. We study the properties of such distributions as the domain size tends to infinity. Three types of concrete examples of MLNs will be considered, and the properties of random structures with domain sizes tending to infinity will be studied: (1) Arbitrary quantifier-free MLNs over a language with only one relation symbol which has arity 1. In this c…

[2025-10-13 Mon (UTC), 3 new articles found for math.LO Logic]
toXiv_bot_toot

[2025-10-13 Mon (UTC), 1 new article found for cs.LO Logic in Computer Science]
toXiv_bot_toot

TLGLock: A New Approach in Logic Locking Using Key-Driven Charge Recycling in Threshold Logic Gates
Abdullah Sahruri, Martin Margala
https://arxiv.org/abs/2508.17809 https://

TLGLock: A New Approach in Logic Locking Using Key-Driven Charge Recycling in Threshold Logic Gates
Logic locking remains one of the most promising defenses against hardware piracy, yet current approaches often face challenges in scalability and design overhead. In this paper, we present TLGLock, a new design paradigm that leverages the structural expressiveness of Threshold Logic Gates (TLGs) and the energy efficiency of charge recycling to enforce key-dependent functionality at the gate level. By embedding the key into the gate's weighted logic and utilizing dynamic charge sharing, TLGLock …

[2025-09-12 Fri (UTC), 2 new articles found for math.LO Logic]
toXiv_bot_toot

[2025-09-12 Fri (UTC), 1 new article found for cs.LO Logic in Computer Science]
toXiv_bot_toot

[2025-08-13 Wed (UTC), 2 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

[2025-08-13 Wed (UTC), 3 new articles found for math.LO Logic]
toXiv_bot_toot

Curved Boolean Logic: A Contextual Generalization of Propositional Logic with Algorithmic Consequences
Maximilian R. P. von Liechtenstein
https://arxiv.org/abs/2510.04716 https:…

Curved Boolean Logic: A Contextual Generalization of Propositional Logic with Algorithmic Consequences
Curved Boolean Logic (CBL) generalizes propositional logic by allowing local truth assignments that do not extend to a single global valuation, analogous to curvature in geometry. We give equivalent sheaf and exclusivity-graph semantics and a context-aware proof calculus that is conservative in the flat limit. We formalize CBL-SAT and basic complexity (NP-complete in general) and present operational operators (CBL-AC and CBL-CONS) that prune contradictions earlier on classical hardware. We mode…

Beyond Pass@k: Breadth-Depth Metrics for Reasoning Boundaries
Marius Dragoi, Ioana Pintilie, Florin Gogianu, Florin Brad
https://arxiv.org/abs/2510.08325 https://

Beyond Pass@k: Breadth-Depth Metrics for Reasoning Boundaries
Reinforcement Learning with Verifiable Rewards (RLVR) has emerged as a powerful paradigm to improve Large Language Models on reasoning tasks such as coding, math or logic. To assess the reasoning boundary (the fraction of problems a model can solve) researchers often report Pass@k at large sampling budgets. Recent results reveal a crossover phenomenon: while RLVR models outperform the base model at small k values, the base model usually outperforms them when sampling a very large number of comp…

U-Turn: Enhancing Incorrectness Analysis by Reversing Direction
Flavio Ascari, Roberto Bruni, Roberta Gori, Azalea Raad
https://arxiv.org/abs/2510.09292 https://

U-Turn: Enhancing Incorrectness Analysis by Reversing Direction
O'Hearn's Incorrectness Logic (IL) has sparked renewed interest in static analyses that aim to detect program errors rather than prove their absence, thereby avoiding false alarms -- a critical factor for practical adoption in industrial settings. As new incorrectness logics emerge to capture diverse error-related properties, a key question arises: can the combination of (in)correctness techniques enhance precision, expressiveness, automation, or scalability? Notable frameworks, such as outcome…

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
Aleksi Anttila, Juha Kontinen, Fan Yang
https://arxiv.org/abs/2510.08122 https://arxiv…

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
We initiate the study of the complexity-theoretic properties of convex logics in team semantics. We focus on the extension of classical propositional logic with the nonemptiness atom NE, a logic known to be both convex and union closed. We show that the satisfiability problem for this logic is NP-complete, that its validity problem is coNP-complete, and that its model-checking problem is in P.

Evaluation of LLMs for Process Model Analysis and Optimization
Akhil Kumar, Jianliang Leon Zhao, Om Dobariya
https://arxiv.org/abs/2510.07489 https://arxiv…

Evaluation of LLMs for Process Model Analysis and Optimization
In this paper, we report our experience with several LLMs for their ability to understand a process model in an interactive, conversational style, find syntactical and logical errors in it, and reason with it in depth through a natural language (NL) interface. Our findings show that a vanilla, untrained LLM like ChatGPT (model o3) in a zero-shot setting is effective in understanding BPMN process models from images and answering queries about them intelligently at syntactic, logic, and semantic …

Provability Models
Mojtaba Mojtahedi, Borja Sierra Miranda
https://arxiv.org/abs/2510.06696 https://arxiv.org/pdf/2510.06696…

Provability Models
In this paper, we study a new Kripke-style semantics for classical modal logic, named as provability models. We study provability models for the propositional modal logics K, K4, S4 GL, GLP and the interpretability logic ILM. Provability models combine features of Kripke models with the assignment of logics to individual worlds. Originally introduced in [Mojtahedi, 2022], these models allowed the first author to establish arithmetical completeness for intuitionistic provability logic. Interesti…

Strategy Logic, Imperfect Information, and Hyperproperties
Raven Beutner, Bernd Finkbeiner
https://arxiv.org/abs/2510.03952 https://arxiv.org/pdf/2510.0395…

Strategy Logic, Imperfect Information, and Hyperproperties
Strategy logic (SL) is a powerful temporal logic that enables first-class reasoning over strategic behavior in multi-agent systems (MAS). In many MASs, the agents (and their strategies) cannot observe the global state of the system, leading to many extensions of SL centered around imperfect information, such as strategy logic with imperfect information (SL$_\mathit{ii}$). Along orthogonal lines, researchers have studied the combination of strategic behavior and hyperproperties. Hyperproperties …

Replaced article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- Cantor digraphs and abbreviations of formulas
Martin Klazar
https://

Crosslisted article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Truth-Aware Decoding: A Program-Logic Approach to Factual Language Generation
Faruk Alpay, Hamdi Alakkad

Replaced article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- Some Results on Finitely Splitting Subtrees of Aronszajn Trees
John Krueger
h…

Tableaux for epistemic G\"{o}del logic
Marta B\'ilkov\'a, Thomas Ferguson, Daniil Kozhemiachenko
https://arxiv.org/abs/2510.04642 https://arxi…

Tableaux for epistemic Gödel logic
We propose a multi-agent epistemic logic capturing reasoning with degrees of plausibility that agents can assign to a given statement, with $1$ interpreted as "entirely plausible for the agent" and $0$ as "completely implausible" (i.e., the agent knows that the statement is false). We formalise such reasoning in an expansion of Gödel fuzzy logic with an involutive negation and multiple $\mathbf{S5}$-like modalities. As already Gödel single-modal logics are known to lack the finite model prope…

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Order in Partial Markov Categories
Elena Di Lavore, Mario Rom\'an, Pawe{\l} Soboci\'nski, M\'ark Sz\'eles

Crosslisted article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Un cadre paraconsistant pour l'{\'e}valuation de similarit{\'e} dans les bases de connaissances
Jos\'e-Luis Vilchis Medina (ENSTA Bretagne, Lab-STICC, Lab-STICC_ROBEX)

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Homological Invariants of Higher-Order Equational Theories
Mirai Ikebuchi
https://

Continuation Semantics for Fixpoint Modal Logic and Computation Tree Logics
Ryota Kojima, Corina Cirstea
https://arxiv.org/abs/2510.04653 https://arxiv.org…

Continuation Semantics for Fixpoint Modal Logic and Computation Tree Logics
We introduce continuation semantics for both fixpoint modal logic (FML) and Computation Tree Logic* (CTL*), parameterised by a choice of branching type and quantitative predicate lifting. Our main contribution is proving that they are equivalent to coalgebraic semantics, for all branching types. Our continuation semantics is defined over coalgebras of the continuation monad whose answer type coincides with the domain of truth values of the formulas. By identifying predicates and continuations, …

Lattice Annotated Temporal (LAT) Logic for Non-Markovian Reasoning
Kaustuv Mukherji, Jaikrishna Manojkumar Patil, Dyuman Aditya, Paulo Shakarian, Devendra Parkar, Lahari Pokala, Clark Dorman, Gerardo I. Simari
https://arxiv.org/abs/2509.02958

Lattice Annotated Temporal (LAT) Logic for Non-Markovian Reasoning
We introduce Lattice Annotated Temporal (LAT) Logic, an extension of Generalized Annotated Logic Programs (GAPs) that incorporates temporal reasoning and supports open-world semantics through the use of a lower lattice structure. This logic combines an efficient deduction process with temporal logic programming to support non-Markovian relationships and open-world reasoning capabilities. The open-world aspect, a by-product of the use of the lower-lattice annotation structure, allows for efficie…

[2025-09-11 Thu (UTC), 1 new article found for math.LO Logic]
toXiv_bot_toot

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- A Calibration-Free Fixed Point of Curved Boolean Logic Matching the Fine-Structure Constant
Maximilian R. P. von Liechtenstein

Crosslisted article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- Languages of Words of Low Automatic Complexity Are Hard to Compute
Joey Chen, Bj{\o}rn Kjos-Hanssen, Ivan Koswara, Linus Richter, Frank Stephan

TREBL -- A Relative Complete Temporal Event-B Logic. Part I: Theory
Klaus-Dieter Schewe, Flavio Ferrarotti, Peter Rivi\`ere, Neeraj Kumar Singh, Guillaume Dupont, Yamine A\"it Ameur
https://arxiv.org/abs/2509.01462

TREBL -- A Relative Complete Temporal Event-B Logic. Part I: Theory
The verification of liveness conditions is an important aspect of state-based rigorous methods. This article addresses the extension of the logic of Event-B to a powerful logic, in which properties of traces of an Event-B machine can be expressed. However, all formulae of this logic are still interpreted over states of an Event-B machine rather than traces. The logic exploits that for an Event-B machine $M$ a state $S$ determines all traces of $M$ starting in $S$. We identify a fragment called …

Replaced article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- Infinite convex geometries with lower semi-modularity and join semi-distributivity
Adam Mata

Axiomatisation for an asynchronous epistemic logic with sending and receiving messages
Philippe Balbiani, Hans van Ditmarsch, Clara Lerouvillois
https://arxiv.org/abs/2510.02890

Axiomatisation for an asynchronous epistemic logic with sending and receiving messages
We investigate a public announcement logic for asynchronous public announcements wherein the sending of the announcements by the environment is separated from the reception of the announcements by the individual agents. Both come with different modalities. In the logical semantics, formulas are interpreted in a world of a Kripke model but given a history of prior announcements and receptions of announcements that already happened. An axiomatisation AA for such a logic has been given in prior wo…

Replaced article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- Proxy principles in combinatorial set theory
Ari Meir Brodsky, Assaf Rinot, Shira Yadai

Replaced article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- Relative Unification in Intuitionistic Logic: Towards provability logic of HA
Mojtaba Mojtahedi

[2025-09-11 Thu (UTC), 5 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- On the Unprovability of Circuit Size Bounds in Intuitionistic $\mathsf{S}^1_2$
Lijie Chen, Jiatu Li, Igor C. Oliveira

Crosslisted article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Autonomous Code Evolution Meets NP-Completeness
Cunxi Yu, Rongjian Liang, Chia-Tung Ho, Haoxing Ren

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- On the Unprovability of Circuit Size Bounds in Intuitionistic $\mathsf{S}^1_2$
Lijie Chen, Jiatu Li, Igor C. Oliveira

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
Agi Kurucz, Frank Wolter, Michael Zakharyaschev

Replaced article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- Logical Dependence of Physical Determinism on Set-theoretic Metatheory
Justin Clarke-Doane

Trace Repair for Temporal Behavior Trees
Sebastian Schirmer, Philipp Schitz, Johann C. Dauer, Bernd Finkbeiner, Sriram Sankaranarayanan
https://arxiv.org/abs/2509.08610 https://…

Trace Repair for Temporal Behavior Trees
We present methods for repairing traces against specifications given as temporal behavior trees (TBT). TBT are a specification formalism for action sequences in robotics and cyber-physical systems, where specifications of sub-behaviors, given in signal temporal logic, are composed using operators for sequential and parallel composition, fallbacks, and repetition. Trace repairs are useful to explain failures and as training examples that avoid the observed problems. In principle, repairs can be …

Crosslisted article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- Consciousness As Entropy Reduction (Short Version)
Yifeng Chen, J. W. Sanders

Hammering Higher Order Set Theory
Chad E. Brown, Cezary Kaliszyk, Martin Suda, Josef Urban
https://arxiv.org/abs/2509.08264 https://arxiv.org/pdf/2509.0826…

Hammering Higher Order Set Theory
We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of two. Higher order automated theorem provers are particularly useful here, since the underlying framework of higher order set theory coincides with the classical extensional higher order logic of (most) higher order automated theorem provers, so no significant tr…

[2025-10-10 Fri (UTC), 6 new articles found for math.LO Logic]
toXiv_bot_toot

A Timed Obstruction Logic for Dynamic Game Models
David Cortes, Jean Leneutre, Vadim Malvone, James Ortiz
https://arxiv.org/abs/2510.06045 https://arxiv.or…

A Timed Obstruction Logic for Dynamic Game Models
Real-time cybersecurity and privacy applications require reliable verification methods and system design tools to ensure their correctness. Many of these reactive real-time applications embedded in various infrastructures, such as airports, hospitals, and oil pipelines, are potentially vulnerable to malicious cyber-attacks. Recently, a growing literature has recognized Timed Game Theory as a sound theoretical foundation for modeling strategic interactions between attackers and defenders. This p…

Crosslisted article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- Graphical small cancellation and hyperfiniteness of boundary actions
Chris Karpinski, Damian Osajda, Koichi Oyakawa

[2025-09-10 Wed (UTC), 1 new article found for math.LO Logic]
toXiv_bot_toot

Crosslisted article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- The Algebra of Meaning: Why Machines Need Montague More Than Moore's Law
Cheonkam Jeong, Sungdo Kim, Jewoo Park

Crosslisted article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Scalable Learning of One-Counter Automata via State-Merging Algorithms
Shibashis Guha, Anirban Majumdar, Prince Mathew, A. V. Sreejith

[2025-10-10 Fri (UTC), 7 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

[2025-09-10 Wed (UTC), 1 new article found for cs.LO Logic in Computer Science]
toXiv_bot_toot

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Extensional Taylor Expansion
Lison Blondeau-Patissier, Pierre Clairambault, Lionel Vaux Auclair