Related papers: Fregean Flows

Nondeterminism in scheduling is the cardinal reason for difficulty in proving correctness of concurrent programs. A powerful proof strategy was recently proposed [6] to show the correctness of such programs. The approach captured data-flow…

Let $\Gamma$ be a multigraph with for each vertex a cyclic order of the edges incident with it. For $n \geq 3$, let $D_{2n}$ be the dihedral group of order $2n$. Define $\mathbb{D} := \{(\begin{smallmatrix} 1 & a \\ 0 & 1 \end{smallmatrix})…

This paper introduces epistemic graphs as a generalization of the epistemic approach to probabilistic argumentation. In these graphs, an argument can be believed or disbelieved up to a given degree, thus providing a more fine--grained…

A $3$-dimensional nowhere-zero flow on a graph $G$ is a flow where each edge is assigned a $3$-dimensional vector with unit norm (which corresponds to the points of a $2$-dimensional unit sphere $S^2$). K. Jain posed two conjectures related…

This paper introduces equivariant hamiltonian flows, a method for learning expressive densities that are invariant with respect to a known Lie-algebra of local symmetry transformations while providing an equivariant representation of the…

In this short note we give an alternative proof of Glivenko's Theorem, stating that a formula $\phi$ is provable in classical propositional logic if and only if $\neg\neg\phi$ is provable in intuitionistic propositional logic. We work in…

We study the correspondence between Bayesian Networks and graphical representation of proofs in linear logic. The goal of this paper is threefold: to develop a proof-theoretical account of Bayesian inference (in the spirit of the…

In this article we develop a new version of the intuitionist existential graphs presented by Arnol Oostra [4]. The deductive rules presented in this article have the same meaning as those described in the work of Yuri Poveda [5], because…

A computational flow is a pair consisting of a sequence of computational problems of a certain sort and a sequence of computational reductions among them. In this paper we will develop a theory for these computational flows and we will use…

We propose a graph-based extension of Boolean logic called Boolean Graph Logic (BGL). Construing formula trees as the cotrees of cographs, we may state semantic notions such as evaluation and entailment in purely graph-theoretic terms,…

Graphical flows add further structure to normalizing flows by encoding non-trivial variable dependencies. Previous graphical flow models have focused primarily on a single flow direction: the normalizing direction for density estimation, or…

We consider the following inference problem: Given a set of edge-flow signals observed on a graph, lift the graph to a cell complex, such that the observed edge-flow signals can be represented as a sparse combination of gradient and curl…

We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…

Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…

A function $f:N\rightarrow N$ is sublinear, if \[\lim_{x\rightarrow +\infty}\frac{f(x)}{x}=0.\] If $A$ is an Abelian group, $G$ is a graph and $\phi$ is an $A$-flow in $G$, then let $N(\phi)$ be the nullity of $\phi$, that is, the set of…

The aim of this paper is to give a condition to topological conjugacy of invariant flows in an Lie group $G$ which its Lie algebra $\mathfrak{g}$ is associative algebra or semisimple. In fact, we show that if two dynamical system on $G$ are…

I give a short proof of the following algebraic statement: if a vertex algebra is simple, then its underlying Lie conformal algebra is either abelian, or it is an irreducible central extension of a simple Lie conformal algebra.

We considers how a particular kind of graph corresponds to multiplicative intuitionistic linear logic formula. The main feature of the graphical notation is that it absorbs certain symmetries between conjunction and implication. We look at…

In his brilliant but sketchy paper on the strucure of quotient varieties of affine actions of reductive algebraic groups over C, Amnon Neeman introduced a gradiant flow with remarkable properties. The purpose of this paper is to study…

Let $\mathbf{x}=(x,y)$. A projective 2-dimensional flow is a solution to a 2-dimensional projective translation equation (PrTE) $(1-z)\phi(\mathbf{x})=\phi(\phi(\mathbf{x}z)(1-z)/z)$, $\phi:\mathbb{C}^{2}\mapsto\mathbb{C}^{2}$. Previously…