
We study Rational Lawvere logic (RL). This logic is defined over the extended positive reals with an algebraic structure combining the Lawvere quantale (with the reversed order on the extended reals and a sum as tensor) and a multiplicative quantale (with the usual order on the extended reals and a multiplication as tensor); together they provide a semiring structure. The logic is designed for complex quantitative reasoning, including sequents expressing inequalities between rational functions over the extended positive reals. We give a deduction system and demonstrate its expressiveness by deriving a classical result from probability theory relating the Kantorovich and total variation distances. Our deductive system is complete for finitely axiomatizable theories. The proof of completeness relies on the Krivine-Stengle Positivstellensatz. We additionally provide complexity results for both RL and its affine fragment AL. We consider two decision problems: the satisfiability of a set of sequents and whether a sequent follows from a finite set of sequent. We show that both problems lie in PSPACE for RL, and we give sharper complexity bounds for AL: the first problem is NP-complete, while the second is co-NP-complete. 2012 ACM Subject Classification Theory of computation -> Logic
Colour Refinement is a combinatorial algorithm that computes a vertex colouring for an input graph to reveal its structural asymmetries. Each iteration of the algorithm refines the current colouring by assessing local colour information. Here, the new colour of a vertex is determined by its current colour and the multiset of colours in its neighbourhood. This refinement procedure continues until it reaches a stable partition of the vertex set into colour classes. On the practical side, the algorithm admits fast implementations. Because the final colouring is isomorphism-invariant, executing the algorithm in parallel on two graphs can be used to demonstrate that they are not isomorphic. From a theoretical perspective, the algorithm is perhaps the most straightforward combinatorial approach to detecting asymmetries, i.e. for distinguishing vertices that do not belong to the same orbit of the automorphism group of the graph. Its numerous connections to other areas in computer science stand as evidence of its robustness and naturalness and make it a fascinating object of research. Among the most elegant connections is the link to counting logic. Colour Refinement assigns distinct final colours to two vertices in a graph if and only if there is a formula in the two-variable fragment C-2 of the counting logic C that distinguishes them, i.e. that holds for precisely one of the two vertices. In fact, the vertex colours translate directly into logical formulas with one free variable. As a consequence, Colour Refinement distinguishes two graphs if and only if there is a C-2-sentence that distinguishes them. This correspondence extends to higher dimensions: the k-variable fragment Ck of C corresponds to the ( k - 1)-dimensional extension of Colour Refinement, the ( k - 1)-dimensional Weisfeiler-Leman algorithm. This algorithm computes a unique colouring for a graph G if and only if G is definable in C-k, i.e. there is a sentence in C-k whose only models are G and its isomorphic copies. As a matter of fact, the link to the logic C goes even deeper: the number of Colour Refinement iterations required to compute distinct colours corresponds exactly to the quantifier depth of a distinguishing formula. As the iterations induce a sequence of strictly nested vertex partitions, the process must terminate after at most n - 1 rounds, where n is the number of vertices. Consequently, n - 1 serves as a trivial upper bound for both the number of iterations and the quantifier depth required to distinguish any two (distinguishable) vertices in C-2. My talk provides an introduction to the link between the Colour Refinement procedure and the logic C-2. We revisit a simple characterisation of their expressivity on graphs and on general relational structures. The characterisation implies that definability of a graph in C-2 can be checked very efficiently. We then discuss tight lower bounds on the quantifier depth of C-2-formulas to distinguish vertices. We obtained infinite families of certificates for these bounds via a thorough analysis of computational data from Colour Refinement executions. We finish with a presentation of a recent purely theoretical reverse-engineering approach to finding long-refinement graphs and a classification of all such graphs with small (or, equivalently, large) degrees. The talk is based on the collaborations [1, 2, 3] and unpublished work. 2012 ACM Subject Classification Theory of computation -> Finite Model Theory; Theory of computation -> Graph algorithms analysis; Mathematics of computing -> Combinatorial algorithms; Mathematics of computing -> Graph theory
Quantum information theory has provided the formal framework for describing how information is stored, transmitted, and transformed in physical quantum systems [6, 7, 9]. Its entropic formulations underpin our understanding of quantum computation, communication, and cryptography. Yet this theory traditionally treats all quantum operations as freely available, ignoring computational restrictions. In practice, however, any manipulation of quantum information must be performed by devices of bounded complexity and runtime. Capturing such realistic constraints requires extending quantum information theory to include computational efficiency as a fundamental component. This work takes a first step toward building a computational version of quantum information theory, one that treats efficiency as part of the theory itself. The goal is to understand how the behavior of quantum information changes when the parties involved can only perform computationally efficient operations. This approach bridges the abstract, ideal setting of quantum information theory with the practical limitations of real quantum devices, offering a means to study information processing under realistic resource constraints. At the center of this work are two new quantities: the quantum computational min-entropy and the quantum computational max-entropy. These entropies extend standard quantum entropies by explicitly limiting the computational power of the observer or adversary. The quantum computational min-entropy captures how unpredictable a quantum system A remains to an observer holding system B, when that observer is restricted to quantum circuits of bounded size. Formally, for a bipartite state rho AB, we define (c) H-s (min)(A|B)rho := - log d(A) max (epsilon s) B > A' F ((parallel to(A)circle times epsilon(s))(rho(AB)),|Phi (AA')> Quantum information theory; Theory of computation -> Quantum complexity theory
Fog of War chess is a popular variant of classical chess, in which both players have only partial information about the position of the opponent's pieces. This study provides the first theoretical analysis of endgames in Fog of War chess. In particular, we analyze the setups king and queen versus king, king and rook versus king, and king and two rooks versus king. We show that a king and queen can always guarantee a win against a lone king. In contrast to classical chess, a king and a rook cannot guarantee a win against a lone king. However, adding one more rook guarantees a win.
President is a popular card game in which players may play one to four cards of the same rank. Since it is less enjoyable with too few human players, to address this, we study the player-simulation problem for President: realizing the moves of a virtual player while keeping its hand hidden. We propose a selection protocol, which selects multiple cards of the same rank uniformly at random from a hidden virtual player's hand, whose rank exceeds the latest played cards. Our construction reduces the task to secure sorting, so the overall efficiency is dominated by the underlying sorting protocol. To address this bottleneck, we design an efficient sorting protocol, which reduces the number of steps from O(mlogm) to O(m), compared to the existing sorting protocols.