A partial operation f on a finite set A is called Sheffer if the partial algebra 〈A, f〉 is complete, i.e. if all partial operations on A are compositions of f (or definable in terms of f). In this paper we describe all partial Sheffer operations for |A| = 2 and all binary Sheffer operations for |A| = 3
peer reviewedA partial function f on a k-element set Ek is a partial Sheffer function if every parti...
We give a complete classification of the factorial functions of Eulerian binomial posets. The factor...
AbstractWe give a complete classification of the factorial functions of Eulerian binomial posets. Th...
A partial operation f on a finite set A is called Sheffer if the partial algebra 〈A, f〉 is complete,...
WOS: 000412175300001In this study, a term operation Sheffer stroke is presented in a given basic alg...
summary:We introduce the concept of Sheffer operation in ortholattices and, more generally, in latti...
peer reviewedA partial function f on a κ-element set Eκ is a partial Sheffer function if every parti...
peer reviewedA partial function f on a κ-element set Eκ is a partial Sheffer function if every parti...
Selected papers of International Conference on Life and Engineering Sciences (ICOLES 2018), Kyrenia,...
The studies have established the possibility of reducing computational complexity, higher productivi...
The studies have established the possibility of reducing computational complexity, higher productivi...
peer reviewedWe determine the minimal covering of maximal partial clones in 4-valued logic. That mea...
AbstractNecessary and sufficient conditions for a one variable function to be the main diagonal of a...
A short Sheffer stroke identity is shown to be a single axiom for Boolean algebra. The axiom has len...
This paper deals with a new interpretation of a special functional characterisation of Sheffer strok...
peer reviewedA partial function f on a k-element set Ek is a partial Sheffer function if every parti...
We give a complete classification of the factorial functions of Eulerian binomial posets. The factor...
AbstractWe give a complete classification of the factorial functions of Eulerian binomial posets. Th...
A partial operation f on a finite set A is called Sheffer if the partial algebra 〈A, f〉 is complete,...
WOS: 000412175300001In this study, a term operation Sheffer stroke is presented in a given basic alg...
summary:We introduce the concept of Sheffer operation in ortholattices and, more generally, in latti...
peer reviewedA partial function f on a κ-element set Eκ is a partial Sheffer function if every parti...
peer reviewedA partial function f on a κ-element set Eκ is a partial Sheffer function if every parti...
Selected papers of International Conference on Life and Engineering Sciences (ICOLES 2018), Kyrenia,...
The studies have established the possibility of reducing computational complexity, higher productivi...
The studies have established the possibility of reducing computational complexity, higher productivi...
peer reviewedWe determine the minimal covering of maximal partial clones in 4-valued logic. That mea...
AbstractNecessary and sufficient conditions for a one variable function to be the main diagonal of a...
A short Sheffer stroke identity is shown to be a single axiom for Boolean algebra. The axiom has len...
This paper deals with a new interpretation of a special functional characterisation of Sheffer strok...
peer reviewedA partial function f on a k-element set Ek is a partial Sheffer function if every parti...
We give a complete classification of the factorial functions of Eulerian binomial posets. The factor...
AbstractWe give a complete classification of the factorial functions of Eulerian binomial posets. Th...
DOI
Add to ORKG