Related papers: ST and TS as Product and Sum
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
We show how Stone duality can be extended from maps to relations. This is achieved by working order enriched and defining a relation from A to B as both an order-preserving function from the opposite of A times B to the 2-element chain and…
Connections between classical and quantum integrable systems are analyzed from the viewpoint of Slavnov products of Bethe states. It is well known that, modulo model dependent aspects, the functional structure of Slavnov products generally…
We prove K-theoretic and shifted K-theoretic analogues of the bijection of Stanton and White between domino tableaux and pairs of semistandard tableaux. As a result, we obtain product formulas for pairs of stable Grothendieck polynomials…
This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is…
Pitts' proof-theoretic technique for uniform interpolation, which generates uniform interpolants from terminating sequent calculi, has only been applied to logics on an intuitionistic basis through single-succedent sequent calculi. We adapt…
In this paper we introduce and study the theories of pseudo links and singular links in the Solid Torus, ST. Pseudo links are links with some missing crossing information that naturally generalize the notion of knot diagrams, and that have…
Uniform interpolation is a strengthening of interpolation that holds for certain propositional logics. The starting point of this chapter is a theorem of A. Pitts, which shows that uniform interpolation holds for intuitionistic…
Recent approaches to verifying programs in separation logics for concurrency have used state transition systems (STSs) to specify the atomic operations of programs. A key challenge in the setting has been to compose such STSs into larger…
Sylvester doubles sums, introduced first by Sylvester are symmetric expressions of the roots of two polynomials. Sylvester's definition of double sums makes no sense in the presence of multiple roots, since the definition involves…
A cyclic proof system gives us another way of representing inductive definitions and efficient proof search. In 2011 Brotherston and Simpson conjectured the equivalence between the provability of the classical cyclic proof system and that…
We introduce the notion of crystallographic T-duality, inspired by the appearance of $K$-theory with graded equivariant twists in the study of topological crystalline materials. Besides giving a range of new topological T-dualities, it also…
The paper is devoted to a systematic study of the duality of processes in the sense that $E f(X_t^x,y)=E f (x, Y_t^y)$ for a certain $f$. This classical topic has well known applications in interacting particles, intertwining,…
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…
Human communication is based on a variety of inferences that we draw from sentences, often going beyond what is literally said. While there is wide agreement on the basic distinction between entailment, implicature, and presupposition, the…
A new matrix product, called the semi-tensor product (STP), is briefly reviewed. The STP extends the classical matrix product to two arbitrary matrices. Under STP the set of matrices becomes a monoid (semi-group with identity). Some related…
Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…
A complete analysis is given of the computable reductions that hold between $\mathsf{SRT}^2_2$, $\mathsf{SPT}^2_2$, and $\mathsf{SIPT}^2_2$. In particular, while $\mathsf{D}^2_2\le_{\rm sW}\mathsf{SIPT}^2_2\le_{\rm…
Signal temporal logic (STL) was introduced for monitoring temporal properties of continuous-time signals for continuous and hybrid systems. Differential dynamic logic (dL) was introduced to reason about the end states of a hybrid program.…
We introduce a logic, called LT, to express properties of transductions, i.e. binary relations from input to output (finite) words. In LT, the input/output dependencies are modelled via an origin function which associates to any position of…