Article
Licensed
Unlicensed
Requires Authentication
The closure operator with the equality predicate branching on the set of partial Boolean functions
-
S. S. Marchenkov
Published/Copyright:
September 30, 2008
Abstract
On the set 
of partial Boolean functions, we consider the closure operator with the equality predicate branching. We prove that each closed class with respect to this operator is generated in by the set of all its functions depending on at most two variables. In the paper, all maximal and submaximal classes in and all closed classes generated by one one-place or two-place function are presented.
This research was supported by the Russian Foundation for Basis Research, grant 06–01–00438.
Received: 2006-01-03
Published Online: 2008-09-30
Published in Print: 2008-October
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
Articles in the same Issue
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
