• Documents
  • Authors
  • Tables

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Products of Many Sorted Algebras (1994)

by Beata Madras
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 54
Next 10 →

Combining of Circuits

by Yatsuka Nakamura, Grzegorz Bancerek , 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

by Małgorzata Korolkiewicz - Journal of Formalized Mathematics , 1994
"... ..."
Abstract - Cited by 66 (1 self) - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...unctions also have been shown. MML Identifier: MSUALG_3. WWW: http://mizar.org/JFM/Vol6/msualg_3.html The articles [11], [15], [16], [6], [8], [7], [4], [2], [14], [1], [3], [12], [9], [13], [5], and =-=[10]-=- provide the notation and terminology for this paper. 1. PRELIMINARIES For simplicity, we use the following convention: S is a non void non empty many sorted signature, U1, U2 are algebras over S, o i...

Many sorted quotient algebra

by Małgorzata Korolkiewicz - 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
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.
(Show Context)

Citation Context

...relation are also formulated. MML Identifier: MSUALG_4. WWW: http://mizar.org/JFM/Vol6/msualg_4.html The articles [10], [14], [15], [3], [16], [5], [9], [4], [2], [1], [13], [11], [7], [12], [6], and =-=[8]-=- provide the notation and terminology for this paper. 1. MANY SORTED RELATION In this paper S denotes a non void non empty many sorted signature, U1 denotes an algebra over S, o denotes an operation s...

More on products of many sorted algebras

by Mariusz Giero - Formalized Mathematics , 1996
"... ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...iversity - Bia̷lystok More on Products of Many Sorted Algebras Mariusz Giero Warsaw University Bia̷lystok Summary. This article is continuation of an article defining products of many sorted algebras =-=[12]-=-. Some properties of notions such as commute, Frege, Args() are shown in this article. Notions of constant of operations in many sorted algebras and projection of products of family of many sorted alg...

Definitions and basic properties of boolean and union of many sorted sets

by Artur Kornilowicz - Journal of Formalized Mathematics , 1995
"... ..."
Abstract - Cited by 9 (3 self) - Add to MetaCart
Abstract not found

Certain Facts about Families of Subsets of Many Sorted Sets

by Artur Kornilowicz , 2002
"... this paper. 1. Preliminaries For simplicity, we follow the rules: I, G, H, i are sets, A, B, M are many sorted sets indexed by I, s 1 , s 2 , s 3 are families of subsets of I, v, w are subsets of I, and F is a many sorted function indexed by I ..."
Abstract - Cited by 9 (4 self) - Add to MetaCart
this paper. 1. Preliminaries For simplicity, we follow the rules: I, G, H, i are sets, A, B, M are many sorted sets indexed by I, s 1 , s 2 , s 3 are families of subsets of I, v, w are subsets of I, and F is a many sorted function indexed by I

On the composition of macro instructions of standard computers

by Artur Korniłowicz - Formalized Mathematics
"... ..."
Abstract - Cited by 7 (6 self) - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...ttp://mizar.org/JFM/Vol12/amistd_2.html The articles [21], [27], [3], [4], [18], [14], [28], [9], [10], [20], [22], [8], [13], [23], [2], [5], [1], [6], [12], [11], [17], [7], [16], [24], [19], [25], =-=[15]-=-, and [26] provide the notation and terminology for this paper. 1. PRELIMINARIES We adopt the following rules: k, m are natural numbers, x, X are sets, and N is a set with non empty elements. Let f be...

The Equational Characterization of Continuous Lattices

by M. Zynel , 2003
"... The class of continuous lattices can be characterized by infinitary equations. Therefore, it is closed under the formation of subalgebras and homomorphic images. Following the terminology of [18] we introduce a continuous lattice subframe to be a sublattice closed under the formation of arbitrary i ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
The class of continuous lattices can be characterized by infinitary equations. Therefore, it is closed under the formation of subalgebras and homomorphic images. Following the terminology of [18] we introduce a continuous lattice subframe to be a sublattice closed under the formation of arbitrary infs and directed sups. This notion corresponds with a subalgebra of a continuous lattice in [16]. The class of completely distributive lattices is also introduced in the paper. Such lattices are complete and satisfy the most restrictive type of the general distributivity law. Obviously each completely distributive lattice is a Heyting algebra. It was hard to find the best Mizar implementation of the complete distributivity equational condition (denoted by CD in [16]). The powerful and well developed Many Sorted Theory gives the most convenient way of this formalization. A set double indexed by K, introduced in the paper, corresponds with a family {x j,k: j ∈ J,k ∈ K ( j)}. It is defined to be a suitable many sorted function. Two special functors: Sups and Infs as counterparts of Sup and Inf respectively, introduced in [33], are also defined. Originally the equation in Definition 2.4 of [16, p. 58] looks as follows: j∈J k∈K ( j)x j,k = � � f ∈M j∈Jx j, f ( j), where M is the set of functions defined on J with values f(j) ∈ K ( j).

Institution of many sorted algebras. Part I: Signature reduct of an algebra

by Grzegorz Bancerek - Journal of Formalized Mathematics , 1996
"... Summary. In the paper the notation necessary to construct the institution of many ..."
Abstract - Cited by 7 (7 self) - Add to MetaCart
Summary. In the paper the notation necessary to construct the institution of many
(Show Context)

Citation Context

...s introduced. MML Identifier: INSTALG1. WWW: http://mizar.org/JFM/Vol8/instalg1.html The articles [21], [14], [24], [25], [11], [8], [15], [1], [16], [2], [3], [9], [6], [22], [23], [13], [12], [10], =-=[19]-=-, [18], [5], [20], [4], [17], and [7] provide the notation and terminology for this paper. The following proposition is true 1. PRELIMINARIES (2) 1 Let S be a non empty non void many sorted signature,...

Some basic properties of many sorted sets

by Artur Korni̷lowicz - Formalized Mathematics , 1996
"... ..."
Abstract - Cited by 7 (3 self) - Add to MetaCart
Abstract not found
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University