Related papers: Paraconsistent Existential Graphs Gamma Peirce Sys…
Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…
Let $G$ be a graph with degree sequence $d_1\geq \ldots \geq d_n$. Slater proposed $s\ell(G)=\min\{ s: (d_1+1)+\cdots+(d_s+1)\geq n\}$ as a lower bound on the domination number $\gamma(G)$ of $G$. We show that deciding the equality of…
LP$^{\supset,\mathsf{F}}$ is a three-valued paraconsistent propositional logic which is essentially the same as J3. It has most properties that have been proposed as desirable properties of a reasonable paraconsistent propositional logic.…
Let X be a non-empty finite set and alpha a symmetric bilinear form on a real finite dimensional vector space E. We say that a set GG={U_i | i in X} of linear lines in E is an isometric sheaf, if there exist generators u_i of the lines U_i,…
We introduce a persistent commutative algebra for studying the algebraic and combinatorial evolution of edge ideals of graphs and hypergraphs under filtration. Building on the Persistent Stanley--Reisner Theory (PSRT), we develop the notion…
In this paper, we analyze timed systems with data structures, using a rich interplay of logic and properties of graphs. We start by describing behaviors of timed systems using graphs with timing constraints. Such a graph is called…
Graphs are a powerful tool for representing and analyzing unstructured, non-Euclidean data ubiquitous in the healthcare domain. Two prominent examples are molecule property prediction and brain connectome analysis. Importantly, recent works…
A graph $\Gamma$ is said to be symmetric if its automorphism group $\rm Aut(\Gamma)$ acts transitively on the arc set of $\Gamma$. In this paper, we show that if $\Gamma$ is a finite connected heptavalent symmetric graph with solvable…
Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…
The Gruenberg--Kegel graph (or the prime graph) $\Gamma(G)$ of a finite group $G$ is defined as follows. The vertex set of $\Gamma(G)$ is the set of all prime divisors of the order of $G$. Two distinct primes $r$ and $s$ regarded as…
This paper presents a characterization of edge-transitive graphs which are four regular and have girth four. This class consists of four infinite families plus four exceptional graphs.
Let $\Gamma$ be a countable abelian group. An (abstract) $\Gamma$-system $\mathrm{X}$ - that is, an (abstract) probability space equipped with an (abstract) probability-preserving action of $\Gamma$ - is said to be a Conze-Lesigne system if…
This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…
Goedel's explicit thesis was that his undecidable formula GUS is a well-formed, well-defined formal sentence in any formalisation of Intuitive Arithmetic IA in which the axioms and rules of inference are recursively definable. His implicit…
Logical reasoning over Knowledge Graphs (KGs) is a fundamental technique that can provide efficient querying mechanism over large and incomplete databases. Current approaches employ spatial geometries such as boxes to learn query…
We describe symbolic constructions for listing and enumerating graphs having the same induced edge label sequence. We settle in the affirmative R. Whitty's [W08] conjectured existence of determinantal constructions for listing and…
A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…
From any directed graph $E$ one can construct the graph inverse semigroup $G(E)$, whose elements, roughly speaking, correspond to paths in $E$. Wang and Luo showed that the congruence lattice $L(G(E))$ of $G(E)$ is upper-semimodular for…
We demonstrate that theories $\text{Z}^-$, $\text{ZF}^-$, $\text{ZFC}^-$ (minus means the absence of the Power Set axiom) and $\text{PA}_2$, $\text{PA}_2^-$ (minus means the absence of the Countable Choice schema) are equiconsistent to each…
Gradual semantics (GS) have demonstrated great potential in argumentation, in particular for deploying quantitative bipolar argumentation frameworks (QBAFs) in a number of real-world settings, from judgmental forecasting to explainable AI.…