English
Related papers

Related papers: ST and TS as Product and Sum

200 papers

Tabular intermediate logics are intermediate logics characterized by finite posets treated as Kripke frames. For a poset $\mathbb{P}$, let $L(\mathbb{P})$ denote the corresponding tabular intermediate logic. We investigate the complexity of…

Logic in Computer Science · Computer Science 2025-09-16 Paweł Rzążewski , Michał Stronkowski

We present general mappings between classical spin systems and quantum physics. More precisely, we show how to express partition functions and correlation functions of arbitrary classical spin models as inner products between quantum…

Quantum Physics · Physics 2009-08-27 R. Hübener , M. Van den Nest , W. Dür , H. J. Briegel

There has been a growing interest in extracting formal descriptions of the system behaviors from data. Signal Temporal Logic (STL) is an expressive formal language used to describe spatial-temporal properties with interpretability. This…

Logic in Computer Science · Computer Science 2024-05-16 Danyang Li , Mingyu Cai , Cristian-Ioan Vasile , Roberto Tron

Stone duality generalizes to an equivalence between the categories $\mathsf{Stone}^{\mathsf{R}}$ of Stone spaces and closed relations and $\mathsf{BA}^\mathsf{S}$ of boolean algebras and subordination relations. Splitting equivalences in…

General Topology · Mathematics 2025-01-28 Marco Abbadini , Guram Bezhanishvili , Luca Carai

It was recently shown that the theory of linear stochastic systems can be viewed as a particular case of the theory of linear systems on a certain commutative ring of power series in a countable number of variables. In the present work we…

Functional Analysis · Mathematics 2011-04-11 Daniel Alpay , Haim Attia

We associate lattices to the sets of unions and intersections of left and right quotients of a regular language. For both unions and intersections, we show that the lattices we produce using left and right quotients are dual to each other.…

Formal Languages and Automata Theory · Computer Science 2023-09-07 Jason Bell , Daniel Smertnig , Hellis Tamm

Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof. Providing a convincing proof-net counterpart to…

Logic · Mathematics 2012-03-20 Richard McKinley

I review the proposal of Berenstein-Douglas for a completely general definition of Seiberg duality. To give evidence for their conjecture I present the first example of a physical dual pair and explicitly check that it satisfies the…

High Energy Physics - Theory · Physics 2009-11-07 Volker Braun

This paper studies properties of the logic BV, which is an extension of multiplicative linear logic (MLL) with a self-dual non-commutative operator. BV is presented in the calculus of structures, a proof theoretic formalism that supports…

Logic in Computer Science · Computer Science 2017-01-11 Alwen Tiu

Invariant inference algorithms such as interpolation-based inference and IC3/PDR show that it is feasible, in practice, to find inductive invariants for many interesting systems, but non-trivial upper bounds on the computational complexity…

Programming Languages · Computer Science 2022-08-17 Yotam M. Y. Feldman , Sharon Shoham

We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…

Combinatorics · Mathematics 2019-09-20 Michael Albert , Mathilde Bouvel , Valentin Féray

We establish a correspondence (or duality) between the characters and the crystal bases of finite-dimensional representations of quantum groups associated to Langlands dual semi-simple Lie algebras. This duality may also be stated purely in…

Quantum Algebra · Mathematics 2011-03-08 Edward Frenkel , David Hernandez

The ground state of the toric code, that of the two-dimensional class D superconductor, and the partition sum of the two-dimensional Ising model are dual to each other. This duality is remarkable inasmuch as it connects systems commonly…

Strongly Correlated Electrons · Physics 2024-03-21 C. Wille , J. Eisert , A. Altland

Through the $\eta$-inner product, we investigate $\cal PT$-symmetric quantum mechanics from the viewpoint of superposition and coherence theory. It is argued that $\cal PT$-symmetric quantum systems are endowed with stationary superposition…

Quantum Physics · Physics 2018-09-26 Minyi Huang , Ray-Kuang Lee , Junde Wu

Let $K \subset {\mathbb R}^n$ be a compact definable set in an o-minimal structure over $\mathbb R$, e.g., a semi-algebraic or a subanalytic set. A definable family $\{ S_\delta|\> 0< \delta \in {\mathbb R} \}$ of compact subsets of $K$, is…

Algebraic Geometry · Mathematics 2017-05-17 Saugata Basu , Andrei Gabrielov , Nicolai Vorobjov

Two Heegaard Floer knot complexes are called stably equivalent if an acyclic complex can be added to each complex to make them filtered chain homotopy equivalent. Hom showed that if two knots are concordant, then their knot complexes are…

Geometric Topology · Mathematics 2020-03-11 Samantha Allen

This report first shows the equivalence bewteen several formulations of classical logic in intuitionistic logic (tertium non datur, reductio ad absurdum, Pierce's law). Then it establishes the correctness of the G\"odel-Kolmogorov…

Logic · Mathematics 2016-02-26 Richard Moot , Christian Retoré

We find a duality between two well-known trees, the Calkin-Wilf tree and the Stern-Brocot tree, derived from cluster algebra theory. The vertex sets of these trees are the set of rational numbers, and they have cluster structures induced by…

Number Theory · Mathematics 2022-10-11 Yasuaki Gyoda

In this paper we recall some results for conditional events, compound conditionals, conditional random quantities, p-consistency, and p-entailment. Then, we show the equivalence between bets on conditionals and conditional bets, by…

Artificial Intelligence · Computer Science 2025-02-11 Angelo Gilio , David E. Over , Niki Pfeifer , Giuseppe Sanfilippo

We present a generic tree-interpolation algorithm in the SMT context with quantifiers. The algorithm takes a proof of unsatisfiability using resolution and quantifier instantiation and computes interpolants (which may contain quantifiers).…

Logic in Computer Science · Computer Science 2023-05-22 Elisabeth Henkel , Jochen Hoenicke , Tanja Schindler
‹ Prev 1 8 9 10 Next ›