Results 1  10
of
123
Combining of Circuits
, 2002
"... this paper. 1. COMBINING OF MANY SORTED SIGNATURES Let S be a many sorted signature. A gate of S is an element of the operation symbols of S ..."
Abstract

Cited by 93 (25 self)
 Add to MetaCart
this paper. 1. COMBINING OF MANY SORTED SIGNATURES Let S be a many sorted signature. A gate of S is an element of the operation symbols of S
Homomorphisms of many sorted algebras
 Journal of Formalized Mathematics
, 1994
"... ..."
(Show Context)
Subalgebras of many sorted algebra. Lattice of subalgebras
 Journal of Formalized Mathematics
, 1994
"... notation and terminology for this paper. ..."
(Show Context)
Many sorted quotient algebra
 Journal of Formalized Mathematics
, 1994
"... Summary. This article introduces the construction of a many sorted quotient algebra. A few preliminary notions such as a many sorted relation, a many sorted equivalence relation, a many sorted congruence and the set of all classes of a many sorted relation are also formulated. ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
(Show Context)
Summary. This article introduces the construction of a many sorted quotient algebra. A few preliminary notions such as a many sorted relation, a many sorted equivalence relation, a many sorted congruence and the set of all classes of a many sorted relation are also formulated.
Vertex Sequences Induced by Chains
, 1996
"... In the three preliminary sections to the article we define two operations on finite sequences which seem to be of general interest. The first is the cut operation that extracts a contiguous chunk of a finite sequence from a position to a position. The second operation is a glueing catenation that ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
In the three preliminary sections to the article we define two operations on finite sequences which seem to be of general interest. The first is the cut operation that extracts a contiguous chunk of a finite sequence from a position to a position. The second operation is a glueing catenation that given two finite sequences catenates them with removal of the first element of the second sequence. The main topic of the article is to define an operation which for a given chain in a graph returns the sequence of vertices through which the chain passes. We define the exact conditions when such an operation is uniquely definable. This is done with the help of the so called twovalued alternating finite sequences. We also prove theorems about the existence of simple chains which are subchains of a given chain. In order to do this we define the notion of a finite subsequence of a typed finite sequence.
Minimal Signature for Partial Algebra
 Journal of Formalized Mathematics
, 1995
"... this paper. ..."
(Show Context)