The Golden Lion

2018 ◽  
pp. 108-124
Author(s):  
Graham Priest
Keyword(s):  
Simple Graph ◽  
Ultimate Reality ◽  
Graph Theoretic ◽  
Precise Sense

This chapter turns to Huayan Buddhism, and the thought of Fazang. Huayan has a distinctive view of the nature of the interpenetration between conventional and ultimate reality. The notion of interpenetration draws on both Indian and Daoist thought. The chapter shows how to make precise sense of the notion of interpenetration with some simple graph-theoretic techniques.

Temporal algebra

1998 ◽  
Vol 8 (3) ◽  
pp. 277-320 ◽  
Author(s):  
BURGHARD von KARGER
Keyword(s):  
Temporal Logic ◽  
Galois Connection ◽  
Simple Graph ◽  
Algebraic Reasoning ◽  
Temporal Logics ◽  
Complete Proof ◽  
Complete Lattices ◽  
Graph Theoretic ◽  
Time Logic ◽  
Temporal Algebra

We develop temporal logic from the theory of complete lattices, Galois connections and fixed points. In particular, we prove that all seventeen axioms of Manna and Pnueli's sound and complete proof system for linear temporal logic can be derived from just two postulates, namely that ([oplus ], &[ominus ]tilde;) is a Galois connection and that ([ominus ], [oplus ]) is a perfect Galois connection. We also obtain a similar result for the branching time logic CTL.A surprising insight is that most of the theory can be developed without the use of negation. In effect, we are studying intuitionistic temporal logic. Several examples of such structures occurring in computer science are given. Finally, we show temporal algebra at work in the derivation of a simple graph-theoretic algorithm.This paper is tutorial in style and there are no difficult technical results. To the experts in temporal logics, we hope to convey the simplicity and beauty of algebraic reasoning as opposed to the machine-orientedness of logical deduction. To those familiar with the calculational approach to programming, we want to show that their methods extend easily and smoothly to temporal reasoning. For anybody else, this text may serve as a gentle introduction to both areas.

On the complement of a graph associated with the set of all nonzero annihilating ideals of a commutative ring

2016 ◽  
Vol 08 (03) ◽  
pp. 1650043 ◽  
Author(s):  
S. Visweswaran ◽  
Patat Sarman
Keyword(s):  
Commutative Ring ◽  
Discrete Math ◽  
Commutative Rings ◽  
Simple Graph ◽  
Integral Domains ◽  
Ideal Formula ◽  
Graph Theoretic ◽  
Vertex Set

The rings considered in this paper are commutative with identity which are not integral domains. Recall that an ideal [Formula: see text] of a ring [Formula: see text] is called an annihilating ideal if there exists [Formula: see text] such that [Formula: see text]. As in [M. Behboodi and Z. Rakeei, The annihilating-ideal graph of commutative rings I, J. Algebra Appl. 10(4) (2011) 727–739], for any ring [Formula: see text], we denote by [Formula: see text] the set of all annihilating ideals of [Formula: see text] and by [Formula: see text] the set of all nonzero annihilating ideals of [Formula: see text]. Let [Formula: see text] be a ring. In [S. Visweswaran and H. D. Patel, A graph associated with the set of all nonzero annihilating ideals of a commutative ring, Discrete Math. Algorithm Appl. 6(4) (2014), Article ID: 1450047, 22pp], we introduced and studied the properties of a graph, denoted by [Formula: see text], which is an undirected simple graph whose vertex set is [Formula: see text] and distinct elements [Formula: see text] are joined by an edge in this graph if and only if [Formula: see text]. The aim of this paper is to study the interplay between the ring theoretic properties of a ring [Formula: see text] and the graph theoretic properties of [Formula: see text], where [Formula: see text] is the complement of [Formula: see text]. In this paper, we first determine when [Formula: see text] is connected and also determine its diameter when it is connected. We next discuss the girth of [Formula: see text] and study regarding the cliques of [Formula: see text]. Moreover, it is shown that [Formula: see text] is complemented if and only if [Formula: see text] is reduced.

INTERSECTION GRAPH OF SUBMODULES OF A MODULE

2012 ◽  
Vol 11 (01) ◽  
pp. 1250019 ◽  
Author(s):  
S. AKBARI ◽  
H. A. TAVALLAEE ◽  
S. KHALASHI GHEZELAHMAD
Keyword(s):  
Bipartite Graph ◽  
Chromatic Number ◽  
Clique Number ◽  
Simple Graph ◽  
Intersection Graph ◽  
Star Graph ◽  
Graph Theoretic ◽  
Nonzero Intersection ◽  
One To One

Let R be a ring with identity and M be a unitary left R-module. The intersection graph of an R-moduleM, denoted by G(M), is defined to be the undirected simple graph whose vertices are in one to one correspondence with all non-trivial submodules of M and two distinct vertices are adjacent if and only if the corresponding submodules of M have nonzero intersection. We investigate the interplay between the module-theoretic properties of M and the graph-theoretic properties of G(M). We characterize all modules for which the intersection graph of submodules is connected. Also the diameter and the girth of G(M) are determined. We study the clique number and the chromatic number of G(M). Among other results, it is shown that if G(M) is a bipartite graph, then G(M) is a star graph.

scholarly journals A Simple Graph-Theoretic Model for Selfish Restricted Scheduling

2005 ◽  
pp. 195-209 ◽  
Author(s):  
Robert Elsässer ◽  
Martin Gairing ◽  
Thomas Lücking ◽  
Marios Mavronicolas ◽  
Burkhard Monien
Keyword(s):  
Simple Graph ◽  
Theoretic Model ◽  
Graph Theoretic
Sign in / Sign up

Export Citation Format

Share Document