Related papers: Fregean Flows
"[M]athematicians care no more for logic than logicians for mathematics." Augustus de Morgan, 1868. Proofs are traditionally syntactic, inductively generated objects. This paper presents an abstract mathematical formulation of propositional…
Linear Logic was introduced by Girard as a resource-sensitive refinement of classical logic. It turned out that full propositional Linear Logic is undecidable (Lincoln, Mitchell, Scedrov, and Shankar) and, hence, it is more expressive than…
We give a simple, direct proof of the backward uniqueness of solutions to a class of second-order geometric evolution equations including the Ricci and cross-curvature flows. The proof, based on a classical argument of Agmon-Nirenberg, uses…
We address the problem of reasoning on graph transformations featuring actions such as \emph{addition} and \emph{deletion} of nodes and edges, node \emph{merging} and \emph{cloning}, node or edge \emph{labelling} and edge…
(Maher 2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the…
Recent advances in the integration of deep learning with automated theorem proving have centered around the representation of logical formulae as inputs to deep learning systems. In particular, there has been a growing interest in adapting…
The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
We address the issue why the phase diagrams for quasi-one-dimensional systems are rather simple, while the renormalization group equations behind the scene are non-linear and messy looking. The puzzle is answered in two steps -- we first…
Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…
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…
This paper introduces a new method to build linear flows, by taking the exponential of a linear transformation. This linear transformation does not need to be invertible itself, and the exponential has the following desirable properties: it…
A classical result in Differential Geometry states that the flows of two smooth vector fields commute if and only if their Lie Bracket vanishes. In this work, we extend this result to a more general setting where one of the vector fields is…
We propose a categorical framework to reason about scientific explanations: descriptions of a phenomenon meant to translate it into simpler terms, or into a context that has been already understood. Our motivating examples come from systems…
Given a graph $G$ with only even degrees let $\varepsilon(G)$ denote the number of Eulerian orientations, and let $h(G)$ denote the number of half graphs, that is, subgraphs $F$ such that $d_F(v)=d_G(v)/2$ for each vertex $v$. Recently,…
We analyse the expressiveness of the two-valued semantics of abstract argumentation frameworks, normal logic programs and abstract dialectical frameworks. By expressiveness we mean the ability to encode a desired set of two-valued…
After 20 years of Triple Graph Grammars (TGGs) and numerous actively maintained implementations, there is now a need for challenging examples and success stories to show that TGGs can be used for real-world bidirectional model…
The literature on word-representable graphs is quite rich, and a number of variations of the original definition have been proposed over the years. We are initiating a systematic study of such variations based on formal languages. In our…
We show that the dual graph of the triangulation of the flow polytope of the zigzag graph adorned with the length-reverse-length framing is a subgraph of a grid graph. Through M\'esz\'aros, Morales, and Striker's bijection between simplices…
Cycles of attacking arguments pose non-trivial issues in Dung style argumentation theory, apparent behavioural difference between odd and even length cycles being a notable one. While a few methods were proposed for treating them, to - in…