Results 1 - 10
of
64
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)
Joining of decorated trees
- Journal of Formalized Mathematics
, 1993
"... Summary. This is the continuation of the sequence of articles on trees (see [2], [4], [5]). The main goal is to introduce joining operations on decorated trees corresponding with operations introduced in [5]. We will also introduce the operation of substitution. In the last section we dealt with tre ..."
Abstract
-
Cited by 56 (19 self)
- Add to MetaCart
(Show Context)
Summary. This is the continuation of the sequence of articles on trees (see [2], [4], [5]). The main goal is to introduce joining operations on decorated trees corresponding with operations introduced in [5]. We will also introduce the operation of substitution. In the last section we dealt with trees decorated by Cartesian product, i.e. we showed some lemmas on joining operations applied to such trees.
Sets and functions of trees and joining operations of trees
- Journal of Formalized Mathematics
, 1992
"... Summary. In the article we deal with sets of trees and functions yielding trees. So, we introduce the sets of all trees, all finite trees and of all trees decorated by elements from some set. Next, the functions and the finite sequences yielding (finite, decorated) trees are introduced. There are sh ..."
Abstract
-
Cited by 30 (15 self)
- Add to MetaCart
(Show Context)
Summary. In the article we deal with sets of trees and functions yielding trees. So, we introduce the sets of all trees, all finite trees and of all trees decorated by elements from some set. Next, the functions and the finite sequences yielding (finite, decorated) trees are introduced. There are shown some convenient but technical lemmas and clusters concerning with those concepts. In the fourth section we deal with trees decorated by Cartesian product and we introduce the concept of a tree called a substitution of structure of some finite tree. Finally, we introduce the operations of joining trees, i.e. for the finite sequence of trees we define the tree which is made by joining the trees from the sequence by common root. For one and two trees there are introduced the same operations.
Irreducible and Prime Elements
, 2003
"... In the paper open and order generating subsets are defined. Irreducible and prime elements are also defined. The article includes definitions and facts presented in ..."
Abstract
-
Cited by 16 (0 self)
- Add to MetaCart
In the paper open and order generating subsets are defined. Irreducible and prime elements are also defined. The article includes definitions and facts presented in
Terms over Many Sorted Universal Algebra
- Journal of Formalized Mathematics
, 1994
"... Pure terms (without constants)... ..."
(Show Context)
Extensions of Mappings on Generator Set
, 2001
"... this paper. 1. Preliminaries For simplicity, we adopt the following rules: S is a non void non empty many sorted signature, U 1 , U 2 , U 3 are non-empty algebras over S, I is a set, A is a many sorted set indexed by I , and B, C are non-empty many sorted sets indexed by I . The following four pr ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
this paper. 1. Preliminaries For simplicity, we adopt the following rules: S is a non void non empty many sorted signature, U 1 , U 2 , U 3 are non-empty algebras over S, I is a set, A is a many sorted set indexed by I , and B, C are non-empty many sorted sets indexed by I . The following four propositions are true: (1) For every binary relation R and for all sets X , Y such that X ` Y holds (R#Y ) ffi X = R ffi X: (2) Let A be a set, B, C be non empty sets, f be a function from A into B, g b
