Related papers: Bilattice-Catastrophe Isomorphism for Four-Valued …
We consider close-packed tiling models of geometric objects -- a mixture of hardcore dimers and plaquettes -- as a generalisation of the familiar dimer models. Specifically, on an anisotropic cubic lattice, we demand that each site be…
Display calculi are generalized sequent calculi which enjoy a `canonical' cut elimination strategy. That is, their cut elimination is uniformly obtained by verifying the assumptions of a meta-theorem, and is preserved by adding or removing…
The integration of vision-language models such as CLIP and Concept Bottleneck Models (CBMs) offers a promising approach to explaining deep neural network (DNN) decisions using concepts understandable by humans, addressing the black-box…
Neural networks excel at pattern recognition but struggle with reliable logical reasoning, often violating basic logical principles during inference. We address this limitation by developing a categorical framework that systematically…
A study of certain symplectic $4$-orbifolds with vanishing canonical class is initiated. We show that for any such symplectic $4$-orbifold $X$, there is a canonically constructed symplectic $4$-orbifold $Y$, together with a cyclic orbifold…
We present a comprehensive structural analysis of the Collatz conjecture through ~1014 computational experiments yielding 630 formal results. By systematically deploying 29 distinct mathematical paradigms--including transfer operator…
This paper proposes an approach to information-based logics using many-logic modal structures (MLMS). These structures can express accessibility relations between worlds with different underlying logics by anchoring them to a base lattice,…
The phi4 scalar field theory in three dimensions, prototype for the study of phase transitions, is investigated by means of the hierarchical reference theory (HRT) in its smooth cutoff formulation. The critical behavior is described by…
We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We treat them as subsystem codes and show that the set of transversally implementable…
Branch and bound algorithms have been developed for reliability analysis of coherent systems. They exhibit a set of advantages; in particular, they can find a computationally efficient representation of a system failure or survival event,…
This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…
In a one-parameter study of a noninvertible family of maps of the plane arising in the context of a numerical integration scheme, Lorenz studied a sequence of transitions from an attracting fixed point to "computational chaos." As part of…
In this paper the theory of Carry Value Transformation (CVT) is designed and developed on a pair of n-bit strings and is used to produce many interesting patterns. One of them is found to be a self-similar fractal whose dimension is same as…
In this paper, we define a multi-type calculus for inquisitive logic, which is sound, complete and enjoys Belnap-style cut-elimination and subformula property. Inquisitive logic is the logic of inquisitive semantics, a semantic framework…
Causal Dynamical Triangulations (CDT) is a lattice approach to quantum gravity. CDT has rich phase structure, including a semiclassical phase consistent with Einstein's general relativity. Some of the observed phase transitions are second…
The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…
We applied a method of symmetry reduction to the gas dynamics equations with a special form of the equation of state. This equation of state is a pressure represented as the sum of a density and an entropy functions. The symmetry Lie…
Using the LP algebraic toolkit, Conway's original topograph is rethought of as a cluster construction, paving the way for a wider topography based on mutation-type local rules. As a remarkable application of such cluster-driven upgrade,…
We prove strong completeness of a range of substructural logics with respect to a natural poset-based relational semantics using a coalgebraic version of completeness-via-canonicity. By formalizing the problem in the language of coalgebraic…
We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…