Related papers: Intuitionistic Euler-Venn Diagrams (extended)
Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all "Geometry of Interaction" (GoI) constructions introduced so far. This series of work was inspired from Girard's…
In this paper we intend to study implications in their most general form, generalizing different classes of implications including the Heyting implication, sub-structural implications and weak strict implications. Following the topological…
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…
We classify the three-dimensional representations of the modular group that are reducible but indecomposable, and their associated spaces of holomorphic vector-valued modular forms. We then demonstrate how such representations may be…
The graphs induced by partition logics allow a dual probabilistic interpretation: a classical one for which probabilities lie on the convex hull of the dispersion-free weights, and another one, suggested independently from the quantum Born…
We explore various semantic understandings of dual intuitionistic logic by exploring the relationship between co-Heyting algebras and topological spaces. First, we discuss the relevant ideas in the setting of Heyting algebras and…
The cut method has been proved to be extremely useful in chemical graph theory. In this paper the cut method is extended to hypergraphs. More precisely, the method is developed for the Wiener index of $k$-uniform partial cube-hypergraphs.…
Recent e-graph applications have typically considered concrete semantics of expressions, where the notion of equivalence stems from concrete interpretation of expressions. However, equivalences that hold over one interpretation may not hold…
We establish a novel representation of arbitrary Euler-Zagier sums in terms of weighted vacuum graphs. This representation uses a toy quantum field theory with infinitely many propagators and interaction vertices. The propagators involve…
In a classical Hamiltonian theory with second class constraints the phase space functions on the constraint surface are observables. We give general formulas for extended observables, which are expressions representing the observables in…
This paper provides the generating series for the embedding of tree-like graphs of arbitrary number of vertices, accourding to their genus. It applies and extends the techniques of Chan, where it was used to give an alternate proof of the…
Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
Neural networks have greatly boosted performance in computer vision by learning powerful representations of input data. The drawback of end-to-end training for maximal overall performance are black-box models whose hidden representations…
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…
We study integrable Euler equations on the Lie algebra $\mathfrak{gl}(3,\mathbb{R})$ by interpreting them as evolutions on the space of hexagons inscribed in a real cubic curve.
We show how Feynman diagrams may be evaluated to take advantage of recent developments in the application of Cutkosky rules to the calculation of one-loop amplitudes. A sample calculation of gg->gH, previously calculated by Ellis et al., is…
Multidimensional contractions of irreducible representations of the Cayley-Klein unitary algebras in the Gel'fand-Zetlin basis are considered. Contracted over different parameters, algebras can turn out to be isomorphic. In this case method…
Probabilistic relaxations of graph cuts offer a differentiable alternative to spectral clustering, enabling end-to-end and online learning without eigendecompositions, yet prior work centered on RatioCut and lacked general guarantees and…
Within the program of finding axiomatizations for various parts of computability logic, it was proved earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting's intuitionistic calculus. That sort…