Add to ORKGAbstract. We give a finite axiomatisation to representable ordered domain algebras and show that finite algebras are representable on finite bases. 1
Abstract. We show that no finite set of first-order axioms can define the class of repre-sentable se...
In this thesis we are considering finite dimensional algebras. We prove that any basic and indecompo...
An algebra is a set of elements equipped with some finitary operations represented by a selected set...
The family of domain algebras provide an elegant formal system for automated reasoning about program...
The family of domain algebras provide an elegant formal system for automated reasoning about program...
AbstractThe family of domain algebras provide an elegant formal system for automated reasoning about...
We are going to characterize finite lattices which can be represented by orders on some finite sets....
We apply the well known equivalence between meet-completions of posets and standard closure operator...
We give complete, finite quasiequational axiomatisations for algebras of unary partial functions und...
Finite Fields and their Applications, vol. 8, pp. 369-396, 2002. The notion of an order domain is ge...
We prove that the finite representation property holds for representation by partial functions for t...
We show that the two-sorted algebra of Booleans and naturals with conjunction, addition and inequali...
A class of algebras has the finite embeddability property (FEP, for short) if every finite partial s...
We show that the two-sorted algebra of Booleans and naturals with conjunction, addition and inequali...
Relational semigroups with domain and range are a useful tool for modelling nondeterministic program...
Abstract. We show that no finite set of first-order axioms can define the class of repre-sentable se...
In this thesis we are considering finite dimensional algebras. We prove that any basic and indecompo...
An algebra is a set of elements equipped with some finitary operations represented by a selected set...
The family of domain algebras provide an elegant formal system for automated reasoning about program...
The family of domain algebras provide an elegant formal system for automated reasoning about program...
AbstractThe family of domain algebras provide an elegant formal system for automated reasoning about...
We are going to characterize finite lattices which can be represented by orders on some finite sets....
We apply the well known equivalence between meet-completions of posets and standard closure operator...
We give complete, finite quasiequational axiomatisations for algebras of unary partial functions und...
Finite Fields and their Applications, vol. 8, pp. 369-396, 2002. The notion of an order domain is ge...
We prove that the finite representation property holds for representation by partial functions for t...
We show that the two-sorted algebra of Booleans and naturals with conjunction, addition and inequali...
A class of algebras has the finite embeddability property (FEP, for short) if every finite partial s...
We show that the two-sorted algebra of Booleans and naturals with conjunction, addition and inequali...
Relational semigroups with domain and range are a useful tool for modelling nondeterministic program...
Abstract. We show that no finite set of first-order axioms can define the class of repre-sentable se...
In this thesis we are considering finite dimensional algebras. We prove that any basic and indecompo...
An algebra is a set of elements equipped with some finitary operations represented by a selected set...