Tootfinder

Scott Logic Lead Developer Darren Smith shares a report of carbon emission measuring software tools in 2025, their scope, and reviews these in the context of principal cloud service providers' offerings, including Google Cloud, Microsoft Azure, and Amazon AWS.
"Tools for measuring Cloud Carbon Emissions (updated for 2025)"

Tools for measuring Cloud Carbon Emissions (updated for 2025)
In this post I'll discuss ways of estimating the emissions caused by your Cloud workloads as a first step towards reaching your organisation's Net Zero goals.

In some Western countries, the Christian holiday of the Resurrection of Jesus is called "Easter". By elementary logic, we can conclude that, in some Eastern countries, that holiday is called "Wester".

Matching logic -- proof system $\mathcal{G}^c$
Lauren\c{t}iu Leu\c{s}tean, Dafina Trufa\c{s}
https://arxiv.org/abs/2506.13801 https://

Matching logic -- proof system $\mathcal{G}^c$
We propose in these notes a new proof system for first-order matching logic with application, obtained by adapting to matching logic Gödel's proof system for first-order intuitionistic logic.

Mixture of Encoders is a vector-native alternative that models both structured and unstructured data in a unified embedding space. Join Filip Makraduli as he introduces the method, demonstrates how it powers natural language search and real-time recommendations, and shares open-source tools and benchmarks for replacing complex hybrid stacks.
Learn more:

The 60-year-old man lying on the street, as far as anyone knew, was just a janitor hit by a drunk driver.
There was no mention of it on the local news, no obituary in the morning paper.
His name might have been Anonymous. But it wasn’t. 
His name was Peter Putnam.
He was a physicist who’d hung out with Albert Einstein, John Archibald Wheeler, and Niels Bohr,
and two blocks from the crash, in his run-down apartment, where his partner, Claude, was startled by a scr…

Finding Peter Putnam
The forgotten janitor who discovered the logic of the mind

Doing a more extensive SI/PI workup on the switch line card in preparation for a) a blog update on the switch project and b) getting all my I's dotted and T's crossed before spending a lot of money stuffing three more boards and ordering the logic board.
Here's the 2.5V rail, putting out a bit over 2A at 2.5V. Ripple is dominated by ~300 kHz switching noise plus some harmonics of the 125 MHz PHY symbol rate (which makes sense this rail is driving the PHY PAM5 transceivers a…

It seems like, again, just following the plain logic of the Constitution and Declaration of Independence (which, again, I do not subscribe to), that every law passed under Trump, every supreme court justice appointment by Trump, every supreme court ruling by Trump appointed justices, all the illegal firing, etc, must all, necessarily, be null and void.
And if not following from the insurrection act, or from the oath of office, then following from the Declaration of Independence itself. The logic here being that a constitution is a contract between the people and their government, which the later upholds in order to maintain its legal status. The violation of said laws by the government violates "consent of the governed" (which, again, I have issues with the concept entirely but we're just going to ignore that) and therefore nullifies the authority of that government, granting " the right of the people to alter or to abolish it."
That seems a lot like the hard reset some folks have been looking for. Given that existing flaws allowed this state to be reached, it would also be necessary for the true authority to correct those mistakes before assuming authority that derives from these principles.
Now, personally, I don't subscribe to any of this logic but it's interesting to explore, as an outsider, where the logic goes.

Material did\'actico de L\'ogica Proposicional para Estructuras Discretas
Margarita Carrera Fournier
https://arxiv.org/abs/2505.13459 https://

Material didáctico de Lógica Proposicional para Estructuras Discretas
One of the most difficult topics in the subject of Discrete Mathematics is the subject of Propositional Logic, therefore the present work had as objective to facilitate the learning of Propositional Logic through the implementation of didactic material with the use of educational technology that contributes to the achievement of the objectives established in the syllabus of the subject of Discrete Mathematics, because the knowledge that it provides to Computer Engineers is essential for their p…

Seems helm 3.18 have changed some rendering logic that gives weird templating errors in various charts, so if you've upgraded you probably want to go back to 3.17.3 until there's a fix. #kubernetes

Today, power speaks in the seductive language of images laced with bigotry, seeded with cruelty, and driven by the logic of exclusion and ethnic cleansing.
Culture is no longer merely a reflection of the past;
it has become its erasure.
It functions as pedagogy — through what Ariella Aïsha Azoulay names as “imperial technologies,” and what I have called “disimagination machines.”
It is designed to strip the colonized not only of their futures but of their historie…

The Interview: Ariella Aïsha Azoulay
“The most intimate aspects of our life continue to be shaped by imperialism, which means that some of the most intimate patterns of experience are shared”

Logic Pro: Update speichert Musikideen automatisch
Apple hat die Mac- und iPad-Varianten seiner Profi-Musiksuite erweitert. Es gibt einen neuen Stem Splitter plus "Flashback Capture" für Vergessliche.

A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic
Justus Becker
https://arxiv.org/abs/2506.14307 https://…

A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic
We present a labelled and non-wellfounded calculus for the bimodal provability logic CS. The system is obtained by modelling the Kripke-like semantics of this logic. As in arXiv:2309.00532, we enforce the second-order property of converse wellfoundedness by using techniques from cyclic proof theory. We will prove soundness and completeness of this system with respect to the semantics and provide a primitive decision procedure together with a way to extract countermodels.

Strongly First Order Disjunctive Embedded Dependencies in Team Semantics
Pietro Galliani
https://arxiv.org/abs/2506.15367 https://arx…

Strongly First Order Disjunctive Embedded Dependencies in Team Semantics
First Order Team Semantics is a generalization of Tarskian Semantics in which formulas are satisfied with respect to sets of assignments. In Team Semantics, it is possible to extend First Order Logic via new types of atoms that describe dependencies between variables; some of these extensions are strictly more expressive than First Order Logic, while others are reducible to it. Many of the atoms studied in Team Semantics are inspired by Database Theory and belong in particular to the class of…

Z3Guide: A Scalable, Student-Centered, and Extensible Educational Environment for Logic Modeling
Ruanqianqian Huang, Ayana Monroe, Peli de Halleux, Sorin Lerner, Nikolaj Bj{\o}rner
https://arxiv.org/abs/2506.08294

Z3Guide: A Scalable, Student-Centered, and Extensible Educational Environment for Logic Modeling
Constraint-satisfaction problems (CSPs) are ubiquitous, ranging from budgeting for grocery shopping to verifying software behavior. Logic modeling helps solve CSPs programmatically using SMT solvers. Despite its importance in many Computer Science disciplines, resources for teaching and learning logic modeling are scarce and scattered, and challenges remain in designing educational environments for logic modeling that are accessible and meet the needs of teachers and students. This paper explor…

Medium writer Paolo Perrone curates a short list of interesting algorithms, the rationale behind them, along with graphs and diagrams to boot.
Algorithms that made this short list:
Wave Function Collapse
The Diffusion Model
Simulated Annealing
Sleep Sort
BOGO Sort
BOID
SHOR’s
Marching Cubes
Practical Byzantine Fault Tolerance and,
Boyer Moore
"The 10 Weirdest, Most Brilliant Algorithms Ever Devised and What They Actually Do&…

10 Weirdest Algorithms That Changed Tech Forever | Data Science Collective
Discover 10 unusual algorithms that defied logic, broke rules, and transformed the way we think about technology and problem-solving.

The logic of my IT department:
"Hey you need to download this exe to install this program necessary to use our system."
*tries to download*
"Oh, it looks like you tried to download an executable? Sorry you can't do that, we blocked the download." 🐷

@… @… @… I have always wanted to actually buy the cards from Lunar Logic, but, well, then I’d ha…

Reconfigurable Digital RRAM Logic Enables In-Situ Pruning and Learning for Edge AI
Songqi Wang, Yue Zhang, Jia Chen, Xinyuan Zhang, Yi Li, Ning Lin, Yangu He, Jichang Yang, Yingjie Yu, Yi Li, Zhongrui Wang, Xiaojuan Qi, Han Wang
https://arxiv.org/abs/2506.13151

Reconfigurable Digital RRAM Logic Enables In-Situ Pruning and Learning for Edge AI
The human brain simultaneously optimizes synaptic weights and topology by growing, pruning, and strengthening synapses while performing all computation entirely in memory. In contrast, modern artificial-intelligence systems separate weight optimization from topology optimization and depend on energy-intensive von Neumann architectures. Here, we present a software-hardware co-design that bridges this gap. On the algorithmic side, we introduce a real-time dynamic weight-pruning strategy that moni…

This is of historical interest on so many levels.
When the notion of AI first appeared, chess was considered the epitome of intelligence (before that it was calculating)—which, of course, it isn’t. Now AI is all about pattern recognition, which certainly covers more of what we associate with human intelligence, but go figure, it’s not *just* pattern recognition either. ⇢

Cold Colors – Sleepless Nights (Tracks Selection) 🖤👨🏼‍🚀
#Mixcloud #Synthwave #Wave #ElectronicMusic

Cold Colors - Sleepless Nights (Tracks Selection)
First tracks selection of the year! Scratch Massive - Pleine lune Tristesse Contemporaine - I Didn't Know Emika - Battles (The Black Dog Remix) Null + Void - Paragon Mansfield.TYA - Logic Coco (Scratch Massive Remix) The Hunt - Brain Test Sébastien Tellier - Kilometer (Arpanet Remix) Identified Patient & Sophie Du Palais - Peaceful Panic Ngly - Speechless Tape P.I.L.A.R. - Anabasis (Drvg Cvltvre Remix)

A Logic For Fresh Labelled Transition Systems
Mohamed H Bandukara, Nikos Tzevelekos
https://arxiv.org/abs/2506.14538 https://arxiv.or…

A Logic For Fresh Labelled Transition Systems
We introduce a Hennessy-Milner logic with recursion for Fresh Labelled Transition Systems (FLTSs). These are nominal labelled transition systems which keep track of the history, i.e. of data values seen so far, and can capture fresh data generation. In particular, FLTSs generalise the computations of Fresh-Register Automata, which in turn are one of the simplest classes of history-dependent automata operating on infinite input alphabets. Each automaton comes equipped with a finite set of regist…

Now personally, I'm not invested in the law and I reject the logical underpinnings of the whole thing. The US is founded on land that already had people on it, that already had multiple systems of authority, so there can be no claim that it has any legal authority to exist at all.
But it's hard to ignore the inconsistency here. Accepting the logic from the Declaration of Independence and the Constitution, there is no way in which the current state can be legitimate and which Trump has the authority to do anything. The last legal president, again, following the logic that assumes such a thing even possible, was Barak Obama. Since the transfer of power, the country has failed to enforce the law.
If the executive cannot complete their oath, then they are considered vacant under the 25th amendment. If the cabinet fails to invoke article 4, then they too are involved in the insurrection (again, simply following the logic outlined pretty clearly here) as are any who would fail to support the invocation.
Since a full takeover of the federal government by insurrectionists wasn't really planned for, I'm guessing that it would necessarily go to the states, being the only remaining legal authority.

Enhancing Symbolic Machine Learning by Subsymbolic Representations
Stephen Roth, Lennart Baur, Derian Boer, Stefan Kramer
https://arxiv.org/abs/2506.14569 …

Enhancing Symbolic Machine Learning by Subsymbolic Representations
The goal of neuro-symbolic AI is to integrate symbolic and subsymbolic AI approaches, to overcome the limitations of either. Prominent systems include Logic Tensor Networks (LTN) or DeepProbLog, which offer neural predicates and end-to-end learning. The versatility of systems like LTNs and DeepProbLog, however, makes them less efficient in simpler settings, for instance, for discriminative machine learning, in particular in domains with many constants. Therefore, we follow a different approach:…

The logic of hyperlinking in the era of social media:
- sure, you can link outside of our platform, but we'll proxy your link through our shortener so that you aren't exactly sure where you're going,
- everybody is confused where the hell they are going (and browsers amplify that nonsense by making address bars even dumber, showing barely anything except the top-level domain)
- oh, feeling too confused? Gotcha, we'll serve you additional screen showing "you're leaving our site, this is the exact link, are you sure?" so that you never run of mundane things to click at.
Reinventing the wheel for the millionth time, hell yeah.
(I have the same concern about those transition screens on Mastodon, but there's at least a tiny bit of logic behind that, especially with multiple different servers involved and stuff)

First EM simulations on the switch logic board after sorting out some licensing issues with the new Sonnet version.
V19 is a lot faster than v18, it doubles the thread cap from 8 to 16 and also replaces the legacy SSE based matrix solver with an AVX-based version (geee, i wonder where they might have got that from...).
First test is the BGA launch for LC0_PHY0_LANE1_TX, a 5 Gbps QSGMII link but also representative of some of the 25G SERDES.
Return loss is better than -13 dB…

Smooth Logic Constraints in Nonlinear Optimization and Optimal Control Problems
J. Wehbeh, E. C. Kerrigan
https://arxiv.org/abs/2506.01742 https://

Smooth Logic Constraints in Nonlinear Optimization and Optimal Control Problems
In some optimal control problems, complex relationships between states and inputs cannot be easily represented using continuous constraints, necessitating the use of discrete logic instead. This paper presents a method for incorporating such logic constraints directly within continuous optimization frameworks, eliminating the need for binary variables or specialized solvers. Our approach reformulates arbitrary logic constraints under minimal assumptions as max-min constraints, which are then sm…

Apple Updates Logic Pro For iOS, Mac With New Features For Recording, ‘Unmixing’ & More https://www.synthtopia.com/content/20…

Considerations on Everett J. Nelson's connexive logic
Davide Fazio, Raffaele Mascella
https://arxiv.org/abs/2506.10893 https://ar…

Considerations on Everett J. Nelson's connexive logic
This work explores Everett John Nelson's connexive logic, outlined in his PhD thesis and partially summarized in his 1930 paper \emph{Intensional Relations}, which is obtained by extending the system $\mathsf{NL}$ (reconstructed by E. Mares and F. Paoli) with a weak conjunction elimination rule explicitly assumed in the former but not in the latter. After a preliminary analysis of Nelson's philosophical ideas, we provide an algebraic-relational semantics for his logic and we investigate possibl…

Logic Mining from Process Logs: Towards Automated Specification and Verification
Radoslaw Klimek, Julia Witek
https://arxiv.org/abs/2506.08628 https://

Logic Mining from Process Logs: Towards Automated Specification and Verification
Logical specifications play a key role in the formal analysis of behavioural models. Automating the derivation of such specifications is particularly valuable in complex systems, where manual construction is time-consuming and error-prone. This article presents an approach for generating logical specifications from process models discovered via workflow mining, combining pattern-based translation with automated reasoning techniques. In contrast to earlier work, we evaluate the method on both ge…

@… Maybe you can share this, or if you have an answer, share it?
https://mastodon.gamedev.place/@jbqueru/114597778380655029

Multipartite Mixed-Species Entanglement over a Quantum Network
D. Main, P. Drmota, E. M. Ainley, A. Agrawal, D. Webb, S. Saner, O. Bazavan, B. C. Nichol, R. Srinivas, D. P. Nadlinger, G. Araneda, D. M. Lucas
https://arxiv.org/abs/2506.14334

Multipartite Mixed-Species Entanglement over a Quantum Network
We generate multipartite entangled states of two, three and four matter qubits, where the entanglement is distributed over macroscopic distances via a photonic network link. Trapped-ion ${}^{88}\text{Sr}^+$ qubits are entangled directly via the optical fibre link, and the entanglement is subsequently extended to ${}^{43}\text{Ca}^+$ memory qubits co-trapped in each network node, using local mixed-species logic gates. We create remotely entangled $\text{Sr}^+$-$\text{Ca}^+$ and $\text{Ca}^+$-$\t…

Cut Tracing with E-Graphs for Boolean FHE Circuit Synthesis
Julien de Castelnau, Mingfei Yu, Giovanni De Micheli
https://arxiv.org/abs/2506.12883 https://

Cut Tracing with E-Graphs for Boolean FHE Circuit Synthesis
Fully Homomorphic Encryption (FHE) is a promising privacy-preserving technology enabling secure computation over encrypted data. A major limitation of current FHE schemes is their high runtime overhead. As a result, automatic optimization of circuits describing FHE computation has garnered significant attention in the logic synthesis community. Existing works primarily target the multiplicative depth (MD) and multiplicative complexity (MC) of FHE circuits, corresponding to the total number of m…

This https://arxiv.org/abs/2401.04003 has been replaced.
link: https://scholar.google.com/scholar?q=a

Simultaneous Task Allocation and Planning for Multi-Robots under Hierarchical Temporal Logic Specifications
Research in robotic planning with temporal logic specifications, such as Linear Temporal Logic (LTL), has relied on single formulas. However, as task complexity increases, LTL formulas become lengthy, making them difficult to interpret and generate, and straining the computational capacities of planners. To address this, we introduce a hierarchical structure for a widely used specification type -- LTL on finite traces (LTL$_f$). The resulting language, termed H-LTL$_f$, is defined with both its…

Notes on applicative matching logic
Laurentiu Leustean
https://arxiv.org/abs/2506.10088 https://arxiv.org/pdf/2506.10088

Notes on applicative matching logic
Matching logic (ML) was developed by Grigore Roşu and collaborators as a logic for defining the formal semantics of programming languages and for specifying and reasoning about the behavior of programs. These lecture notes present basic definitions and results on applicative matching logic (AML), a functional variant of ML introduced recently by Xiaohong Chen and Grigore Roşu. They can be used as an introductory text in the theory of AML. Monk's textbook on mathematical logic has an enormous …

Torsion Theories in a Non-pointed Context
Andrea Cappelletti, Andrea Montoli
https://arxiv.org/abs/2506.13349 https://arxiv.org/pdf/2…

Torsion Theories in a Non-pointed Context
We study a non-pointed version of the notion of torsion theory in the framework of categories equipped with a posetal monocoreflective subcategory such that the coreflector inverts monomorphisms. We explore the connections of such torsion theories with factorization systems and categorical Galois structures. We describe several examples of these torsion theories, in the dual of elementary toposes, in varieties of universal algebras used as models for non-classical logic, and in coslices of the …

Design of an all-facet illuminator for high NA EUV lithography exposure tool based on deep reinforcement learning
Tong Li, Yuqing Chen, Yanqiu Li, Lihui Liu
https://arxiv.org/abs/2506.15558

Design of an all-facet illuminator for high NA EUV lithography exposure tool based on deep reinforcement learning
Using the illuminator for high numerical aperture (NA) extreme ultraviolet (EUV) exposure tool in EUV lithography can lead to support volume production of sub-2 nm logic nodes and leading-edge DRAM nodes. However, the typical design method of the illuminator has issues with the transmission owing to the limitation of optical structure that cannot further reduce process parameter k1, and uniformity due to the restriction of matching method that can only consider one factor affecting uniformity. …

An Interpretable Two-Stage Feature Decomposition Method for Deep Learning-based SAR ATR
Chenwei Wang, Renjie Xu, Congwen Wu, Cunyi Yin, Ziyun Liao, Deqing Mao, Sitong Zhang, Hong Yan
https://arxiv.org/abs/2506.09377

An Interpretable Two-Stage Feature Decomposition Method for Deep Learning-based SAR ATR
Synthetic aperture radar automatic target recognition (SAR ATR) has seen significant performance improvements with deep learning. However, the black-box nature of deep SAR ATR introduces low confidence and high risks in decision-critical SAR applications, hindering practical deployment. To address this issue, deep SAR ATR should provide an interpretable reasoning basis $r_b$ and logic $λ_w$, forming the reasoning logic $\sum_{i} {{r_b^i} \times {λ_w^i}} =pred$ behind the decisions. Therefore,…

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- A Logic of Knowledge and Justifications, with an Application to Computational Trust
Francesco A. Genco

Harnessing the "Reactive Falling Effect" for rehabilitation and performance boosting
Paul-Emmanuel Sornette, Didier Sornette
https://arxiv.org/abs/2506.13959

Harnessing the "Reactive Falling Effect" for rehabilitation and performance boosting
We present Logic Workout, a novel training method based on radical dynamic instability combining rolling, deformation and spring instability on small fitballs. By exploiting the "reactive falling effect", it re-engages innate balance mechanisms and forces real-time motor corrections, leading to better joint control, coordination, and movement precision. Preliminary results from a cohort of 18 participants show complete resolution of chronic pain, enhanced functional mobility, and surprising imp…

from my link log —
Alan Kay did not invent object-oriented programming.
https://www.hillelwayne.com/post/alan-kay/
saved 2025-05-11 https://

The Economic Value of Depth
Pedro Afonso Fernandes
https://arxiv.org/abs/2506.15354 https://arxiv.org/pdf/2506.15354

The Economic Value of Depth
The main goal of this article is to introduce an economic perspective in the social logic of space. Firstly, we describe the economic model of a linear city to show how depth can generate value by creating local monopolies in less integrated spaces. Then, a new syntactic measure, the d-value, is proposed to capture the relation between the depth of some space from outside and the mean depth of all spaces from outside. An application to a public housing estate suggests that economic activities a…

The New York Times' games team is testing a Scrabble-like game called Crossplay in a separate app from the main NYT Games, soft launching in New Zealand on iOS (Jay Peters/The Verge)
https://www.theverge.com/games/682063/the-new-york-…

The New York Times is starting to test its take on Scrabble
The New York Times is launching a Scrabble-like game it calls Crossplay in New Zealand. It is also testing a logic game called Pips.

Cursed idea: push-pull logic family similar to CMOS (i.e. not using resistors like PMOS or NMOS logic did).
But only using NMOS transistors.
Low side: standard NMOS with body at ground
High side: NMOS with body at Vdd and charge pump gate drive boost like fancy low Rds(on) high side load switches use.

This https://arxiv.org/abs/2504.07732 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPL_…

Efficient Formal Verification of Quantum Error Correcting Programs
Quantum error correction (QEC) is fundamental for suppressing noise in quantum hardware and enabling fault-tolerant quantum computation. In this paper, we propose an efficient verification framework for QEC programs. We define an assertion logic and a program logic specifically crafted for QEC programs and establish a sound proof system. We then develop an efficient method for handling verification conditions (VCs) of QEC programs: for Pauli errors, the VCs are reduced to classical assertions t…

Replaced article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- On homomorphic images of ultraproducts
Samuel M. Corson

🇺🇦 #NowPlaying on KEXP's #VarietyMix
Essential Logic:
🎵 World Friction
#EssentialLogic
https://essentiallogic.bandcamp.com/track/world-friction
https://open.spotify.com/track/0V3FCyX3XYTPK8bWTex6jN

Every time I hear the words, "I just feel like..." in conversation, I try to excuse myself from the discussion because that's a tell that the speaker's put no forethought into their argument & likely has no actual evidence of the point they're making.
Don't workshop your homespun logic on me.

A uniform cut-elimination theorem for linear logics with fixed points and super exponentials
Esa\"ie Bauer, Alexis Saurin
https://arxiv.org/abs/2506.14327

A uniform cut-elimination theorem for linear logics with fixed points and super exponentials
In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which may be redundant. A number of approaches in proof theory have been adopted to cope with this need. In the present paper, we consider this issue from the point of view of enhancing linear logic with least and greatest fixed-points and considering such a variet…

Situational-Constrained Sequential Resources Allocation via Reinforcement Learning
Libo Zhang, Yang Chen, Toru Takisaka, Kaiqi Zhao, Weidong Li, Jiamou Liu
https://arxiv.org/abs/2506.14125

Situational-Constrained Sequential Resources Allocation via Reinforcement Learning
Sequential Resource Allocation with situational constraints presents a significant challenge in real-world applications, where resource demands and priorities are context-dependent. This paper introduces a novel framework, SCRL, to address this problem. We formalize situational constraints as logic implications and develop a new algorithm that dynamically penalizes constraint violations. To handle situational constraints effectively, we propose a probabilistic selection mechanism to overcome li…

SR-NCL: an Area-/Energy-Efficient Resilient NCL Architecture Based on Selective Redundancy
Hasnain A. Ziad, Alexander C. Bodoh, Ashiq A. Sakib
https://arxiv.org/abs/2506.15634

SR-NCL: an Area-/Energy-Efficient Resilient NCL Architecture Based on Selective Redundancy
Duplication-based redundancy schemes have proven to be effective in designing fully-resilient Quasi-delay Insensitive (QDI) asynchronous circuits. The complete resiliency, however, is accompanied by significant energy, latency, and area overhead. This paper presents a novel error-tolerant Null Convention Logic (NCL) architecture based on selective redundancy. Results demonstrate the efficacy of the proposed method in terms of area and energy utilization as compared to existing duplication-based…

I’m rewriting my logic language code in Haskell because I got frustrated with Rust’s verbosity and having to deal with garbage collection. I didn’t feel like it was adding enough, and I started to rethink my reasoning for using Rust (so it can be embedded anywhere). I don’t know if this language is going anywhere, maybe it’s fine if I have to rewrite it once it’s popular. It may never be.

[2025-06-20 Fri (UTC), no new articles found for math.LO Logic]
toXiv_bot_toot

Trajectory Optimization for UAV-Based Medical Delivery with Temporal Logic Constraints and Convex Feasible Set Collision Avoidance
Kaiyuan Chen, Yuhan Suo, Shaowei Cui, Yuanqing Xia, Wannian Liang, Shuo Wang
https://arxiv.org/abs/2506.06038

Trajectory Optimization for UAV-Based Medical Delivery with Temporal Logic Constraints and Convex Feasible Set Collision Avoidance
This paper addresses the problem of trajectory optimization for unmanned aerial vehicles (UAVs) performing time-sensitive medical deliveries in urban environments. Specifically, we consider a single UAV with 3 degree-of-freedom dynamics tasked with delivering blood packages to multiple hospitals, each with a predefined time window and priority. Mission objectives are encoded using Signal Temporal Logic (STL), enabling the formal specification of spatial-temporal constraints. To ensure safety, c…

Fuzzy Lattice-based Description Logic
Yiwen Ding, Krishna Manoorkar
https://arxiv.org/abs/2506.05833 https://arxiv.org/pdf/2506.05833…

Fuzzy Lattice-based Description Logic
Recently, description logic LE-ALC was introduced for reasoning in the semantic environment of enriched formal contexts, and a polynomial-time tableaux algorithm was developed to check the consistency of knowledge bases with acyclic TBoxes. In this work, we introduce a fuzzy generalization of LE-ALC called LE-FALC which provides a description logic counterpart of many-valued normal non-distributive logic a.k.a. many-valued LE-logic. This description logic can be used to represent and reason a…

Cut Tracing with E-Graphs for Boolean FHE Circuit Synthesis
Julien de Castelnau, Mingfei Yu, Giovanni De Micheli
https://arxiv.org/abs/2506.12883 https://

Cut Tracing with E-Graphs for Boolean FHE Circuit Synthesis
Fully Homomorphic Encryption (FHE) is a promising privacy-preserving technology enabling secure computation over encrypted data. A major limitation of current FHE schemes is their high runtime overhead. As a result, automatic optimization of circuits describing FHE computation has garnered significant attention in the logic synthesis community. Existing works primarily target the multiplicative depth (MD) and multiplicative complexity (MC) of FHE circuits, corresponding to the total number of m…

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
Automata Linear Dynamic Logic on Finite Traces
https://

from my link log —
roons: modular marble logic.
https://whomtech.com/roons/
saved 2025-05-01 https://dotat.at/:/6T2C6.html

Online Performance Assessment of Multi-Source-Localization for Autonomous Driving Systems Using Subjective Logic
Stefan Orf, Sven Ochs, Marc Ren\'e Zofka, J. Marius Z\"ollner
https://arxiv.org/abs/2506.02932

Online Performance Assessment of Multi-Source-Localization for Autonomous Driving Systems Using Subjective Logic
Autonomous driving (AD) relies heavily on high precision localization as a crucial part of all driving related software components. The precise positioning is necessary for the utilization of high-definition maps, prediction of other road participants and the controlling of the vehicle itself. Due to this reason, the localization is absolutely safety relevant. Typical errors of the localization systems, which are long term drifts, jumps and false localization, that must be detected to enhance s…

Hazel Deriver: A Live Editor for Constructing Rule-Based Derivations
Zhiyao Zhong, Cyrus Omar
https://arxiv.org/abs/2506.10781 https://

Hazel Deriver: A Live Editor for Constructing Rule-Based Derivations
Students in programming languages and formal logic courses often struggle with constructing rule-based derivation trees due to the complexity of applying inference rules, the lack of immediate feedback, and the manual effort required for handwritten proofs. We present Hazel Deriver, a live, web-based editor designed to scaffold derivation construction through multiple layers of support. Built on the Hazel live programming environment, it provides a structured, interactive experience that encour…

LLM-Guided Scenario-based GUI Testing
Shengcheng Yu, Yuchen Ling, Chunrong Fang, Quan Zhou, Chunyang Chen, Shaomin Zhu, Zhenyu Chen
https://arxiv.org/abs/2506.05079

LLM-Guided Scenario-based GUI Testing
The assurance of mobile app GUI is more and more significant. Automated GUI testing approaches of different strategies have been developed, while there are still huge gaps between the approaches and the app business logic, not taking the completion of specific testing scenarios as the exploration target, leading to the exploration missing of critical app functionalities. Learning from the manual testing, which takes testing scenarios with app business logic as the basic granularity, in this pap…

Replaced article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
Some reflections on the relationship between logical incompleteness and concrete incompleteness

Swarm-STL: A Framework for Motion Planning in Large-Scale, Multi-Swarm Systems
Shiyu Cheng, Luyao Niu, Bhaskar Ramasubramanian, Andrew Clark, Radha Poovendran
https://arxiv.org/abs/2506.14749

Swarm-STL: A Framework for Motion Planning in Large-Scale, Multi-Swarm Systems
In multi-agent systems, signal temporal logic (STL) is widely used for path planning to accomplish complex objectives with formal safety guarantees. However, as the number of agents increases, existing approaches encounter significant computational challenges. Recognizing that many complex tasks require cooperation among multiple agents, we propose swarm STL specifications to describe the collective tasks that need to be achieved by a team of agents. Next, we address the motion planning problem…

On the cut-elimination of the modal $\mu$-calculus: Linear Logic to the rescue
Esa\"ie Bauer, Alexis Saurin
https://arxiv.org/abs/2506.09791 https://

On the cut-elimination of the modal $μ$-calculus: Linear Logic to the rescue
This paper presents a proof-theoretic analysis of the modal $μ$-calculus. More precisely, we prove a syntactic cut-elimination for the non-wellfounded modal $μ$-calculus, using methods from linear logic and its exponential modalities. To achieve this, we introduce a new system, \muLLmodinf{}, which is a linear version of the modal $μ$-calculus, intertwining the modalities from the modal $μ$-calculus with the exponential modalities from linear logic. Our strategy for proving cut-elimination …

Replaced article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
Higher arity stability and the functional order property
https://

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

This https://arxiv.org/abs/2210.08508 has been replaced.
link: https://scholar.google.com/scholar?q=a

RevaMp3D: Architecting the Processor Core and Cache Hierarchy for Systems with Monolithically-Integrated Logic and Memory
Recent nano-technological advances enable the Monolithic 3D (M3D) integration of multiple memory and logic layers in a single chip, allowing for fine-grained connections between layers and significantly alleviating main memory bottlenecks. We show for a variety of workloads, on a state-of-the-art M3D-based system, that the performance and energy bottlenecks shift from main memory to the processor core and cache hierarchy. Therefore, there is a need to revisit current designs that have been conv…

This https://arxiv.org/abs/2402.11871 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

From Real World to Logic and Back: Learning Generalizable Relational Concepts For Long Horizon Robot Planning
Humans efficiently generalize from limited demonstrations, but robots still struggle to transfer learned knowledge to complex, unseen tasks with longer horizons and increased complexity. We propose the first known method enabling robots to autonomously invent relational concepts directly from small sets of unannotated, unsegmented demonstrations. The learned symbolic concepts are grounded into logic-based world models, facilitating efficient zero-shot generalization to significantly more comple…

[2025-06-19 Thu (UTC), 4 new articles found for math.LO Logic]
toXiv_bot_toot

Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy
Liesbeth De Mol, Yuri V. Matiyasevich, Eugenio G. Omodeo, Alberto Policriti, Wilfried Sieg, Elaine J. Weyuker
https://arxiv.org/abs/2506.08588

Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy
In his autobiographic essay written in 1999, ``From logic to computer science and back'', Martin David Davis (3/8/1928--1/1/2023) indicated that he viewed himself as a logician \emph{and} a computer scientist. He expanded the essay in 2016 and expressed a new perspective through a changed title, ``My life as a logician''. He points out that logic was the unifying theme underlying his scientific career. Our paper attempts to provide a consistent vision that illuminates Davis' successive contribu…

Making good progress on the switch logic board layout. Still lots to do to get netlist-complete, plus a lot of cleanup once the initial routing is done, but it's getting there.
Added a fan cutout, slightly off center of the FPGA but that's fine (I also want to get hot air off the SFP28s and line cards south of this board).

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
Distributed controller synthesis for deadlock avoidance
https://

[2025-06-18 Wed (UTC), 2 new articles found for math.LO Logic]
toXiv_bot_toot

Syntactic Effectful Realizability in Higher-Order Logic
Liron Cohen (BGU), Ariel Grunfeld (BGU), Dominik Kirst (PICUBE), \'Etienne Miquey (I2M)
https://arxiv.org/abs/2506.09458

Syntactic Effectful Realizability in Higher-Order Logic
Realizability interprets propositions as specifications for computational entities in programming languages. Specifically, syntactic realizability is a powerful machinery that handles realizability as a syntactic translation of propositions into new propositions that describe what it means to realize the input proposition. This paper introduces EffHOL (Effectful Higher-Order Logic), a novel framework that expands syntactic realizability to uniformly support modern programming paradigms with sid…

[2025-06-19 Thu (UTC), no new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

Replaced article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
Blok-Esakia Theorems via Stable Canonical Rules
https://

Logical Inferentialism & Attacks on Classical Logic
Khashayar Irani
https://arxiv.org/abs/2506.04295 https://arxiv.org/pdf/2506.0…

Logical Inferentialism & Attacks on Classical Logic
This paper undertakes a foundational inquiry into logical inferentialism with particular emphasis on the normative standards it establishes and the implications these pose for classical logic. The central question addressed herein is: 'What is Logical Inferentialism & How do its Standards challenge Classical Logic?' In response, the study begins with a survey of the three principal proof systems that is, David Hilbert's axiomatic systems and Gerhard Gentzen's natural deduction and his sequent c…

Axioms of Quantum Mechanics in light of Continuous Model Theory
Boris Zilber
#toXiv_bot_toot

This https://arxiv.org/abs/2505.15053 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Owicki--Gries Logic for Timestamp Semantics
Whereas an extension with non-interference of Hoare logic for sequential programs Owicki--Gries logic ensures the correctness of concurrent programs on strict consistency, it is unsound to weak memory models adopted by modern computer architectures and specifications of programming languages. This paper proposes a novel non-interference notion and provides concurrent program logic sound to timestamp semantics corresponding to a weak memory model that allows delays in the effects of store instru…

[2025-06-17 Tue (UTC), 5 new articles found for math.LO Logic]
toXiv_bot_toot

[2025-06-18 Wed (UTC), 8 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]:
A bargain for mergesorts -- How to prove your mergesort correct and stable, almost for free

This https://arxiv.org/abs/2505.06750 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

LPrL: An Asynchronous Linear Time Hyper Logic
We present a novel asynchronous hyper linear time temporal logic named LPrL (Linear Time Predicate Logic) and establish its basic theory. LPrL is a natural first order extension of LTL (Linear time temporal logic), in which the predicates specify the properties of and the relationships between traces (infinite sequences of actions) using Boolean combinations of LTL formulas. To augment the expressive power of the logic, we introduce a simple language of terms and add the equality predicate t = …

Substitutions of variables are finitely axiomatizable over quantifications and permutations
Hajnal Andr\'eka, Zal\'an Gyenis, Istv\'an N\'emeti
https://arxiv.org/abs/2506.12458

Substitutions of variables are finitely axiomatizable over quantifications and permutations
This paper proves that the equational theory of the class $RA_α^{csp}$ of representable polyadic algebras is finitely axiomatizable over its substitution-free reduct $RA_α^{cp}$, for finite $α$. That is, substitutions of variables in finite variable first-order logic can be described by finitely many axioms over the Boolean operations, existential quantifiers and permutations of variables.

This https://arxiv.org/abs/2502.19311 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Faithful Logic Embeddings in HOL -- Deep and Shallow
Deep and shallow embeddings of non-classical logics in classical higher-order logic have been explored, implemented, and used in various reasoning tools in recent years. This paper presents a method for the simultaneous deployment of deep and shallow embeddings of various degrees in classical higher-order logic. This enables flexible, interactive and automated theorem proving and counterexample finding at meta and object level, as well as automated faithfulness proofs between these logic embedd…

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

This https://arxiv.org/abs/2505.02548 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Modal logic for reasoning about uncertainty and confusion
We consider a modal logic that can formalise statements about uncertainty and beliefs such as `I think that my wallet is in the drawer rather than elsewhere' or `I am confused whether my appointment is on Monday or Tuesday'. To do that, we expand Gödel modal logic $\mathbf{K}\mathsf{G}$ with the involutive negation $\sim$ defined as $v({\sim}ϕ,w)=1-v(ϕ,w)$. We provide semantics with the finite model property for our new logic that we call $\mathbf{K}\mathsf{G_{inv}}$ and show its equivalence…

[2025-06-17 Tue (UTC), 1 new article found for cs.LO Logic in Computer Science]
toXiv_bot_toot

This https://arxiv.org/abs/2503.24078 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

A Complete Mental Temporal Logic for Intelligent Agent
In this paper, we present a complete mental temporal logic, called BPICTL, which generalizes CTL by introducing mental modalities. A sound and complete inference system of BPICTL is given. We prove the finite model property of BPICTL. Furthermore, we present a model checking algorithm for BPICTL.

A Decidable Bundled Fragment of First-Order Modal Logic Without Finite Model Property
Varad Joshi, Anantha Padmanabha
https://arxiv.org/abs/2506.01421 http…

A Decidable Bundled Fragment of First-Order Modal Logic Without Finite Model Property
The satisfiability problem for First-order Modal Logic (\FOML) is undecidable even for simple fragments like having only unary predicates, two variables etc. Recently a new way to identify decidable fragments of \FOML has been introduced called the "bundled fragments", where the quantifiers and modalities are restricted to appear together. Since there are many ways to bundle the quantifiers together, some of them lead to (un)decidable fragments. In (Liu et.al, 2023) the authors prove a `trichot…

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

This https://arxiv.org/abs/2502.19311 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Faithful Logic Embeddings in HOL -- Deep and Shallow
Deep and shallow embeddings of non-classical logics in classical higher-order logic have been explored, implemented, and used in various reasoning tools in recent years. This paper presents a method for the simultaneous deployment of deep and shallow embeddings of various degrees in classical higher-order logic. This enables flexible, interactive and automated theorem proving and counterexample finding at meta and object level, as well as automated faithfulness proofs between these logic embedd…

This https://arxiv.org/abs/2506.01626 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Safety, Relative Tightness and the Probabilistic Frane Rule
Probabilistic separation logic offers an approach to reasoning about imperative probabilistic programs in which a separating conjunction is used as a mechanism for expressing independence properties. Crucial to the effectiveness of the formalism is the frame rule, which enables modular reasoning about independent probabilistic state. We explore a semantic formulation of probabilistic separation logic, in which the frame rule has the same simple formulation as in separation logic, without furthe…

On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions
Nicolaj {\O}. Jensen, Kim G. Larsen, Didier Lime, Ji\v{r}\'i Srba
https://arxiv.org/abs/2506.07802

On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions
Verification of real-time systems with multiple components controlled by multiple parties is a challenging task due to its computational complexity. We present an on-the-fly algorithm for verifying timed alternating-time temporal logic (TATL), a branching-time logic with quantifiers over outcomes that results from coalitions of players in such systems. We combine existing work on games and timed CTL verification in the abstract dependency graph (ADG) framework, which allows for easy creation of…

Safety, Relative Tightness and the Probabilistic Frane Rule
Janez Ignacij Jereb, Alex Simpson
https://arxiv.org/abs/2506.01626 https://

Safety, Relative Tightness and the Probabilistic Frane Rule
Probabilistic separation logic offers an approach to reasoning about imperative probabilistic programs in which a separating conjunction is used as a mechanism for expressing independence properties. Crucial to the effectiveness of the formalism is the frame rule, which enables modular reasoning about independent probabilistic state. We explore a semantic formulation of probabilistic separation logic, in which the frame rule has the same simple formulation as in separation logic, without furthe…

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

[2025-06-12 Thu (UTC), 6 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

Growing a Modular Framework for Modal Systems- HOLMS: a HOL Light Library
Antonella Bilotta
https://arxiv.org/abs/2506.10048 https://…

Growing a Modular Framework for Modal Systems- HOLMS: a HOL Light Library
The present dissertation introduces the research project on HOLMS (\textbf{HOL} Light Library for \textbf{M}odal \textbf{S}ystems), a growing modular framework for modal reasoning within the HOL Light proof assistant. To provide an accessible introduction to the library, the fundamentals of modal logic are outlined first, followed by a concise manual for the proof assistant itself. The core contribution of this work on HOLMS is the development of a unified and modular strategy for proving adequ…

IMALL with a Mixed-State Modality: A Logical Approach to Quantum Computation
Kinnari Dave, Alejandro D\'iaz-Caro, Vladimir Zamdzhiev
https://arxiv.org/abs/2506.09545

IMALL with a Mixed-State Modality: A Logical Approach to Quantum Computation
We introduce a proof language for Intuitionistic Multiplicative Additive Linear Logic (IMALL), extended with a modality B to capture mixed-state quantum computation. The language supports algebraic constructs such as linear combinations, and embeds pure quantum computations within a mixed-state framework via B, interpreted categorically as a functor from a category of Hilbert Spaces to a category of finite-dimensional C*-algebras. Measurement arises as a definable term, not as a constant, and t…

[2025-06-11 Wed (UTC), 4 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot