Article
Licensed
Unlicensed
Requires Authentication
Some properties of the inertia groups of Boolean bijunctive functions and an inductive method of generating such functions
-
A.V. Tarasov
Published/Copyright:
February 2, 2016
Abstract
The class of bijunctive Boolean functions consists of the functions representable by the 2-CNF. The problem of enumeration of such function of arbitrary number of variables has not been solved. In the paper, we consider properties of inertia groups ofbijunctive functions in several groups and give an inductive method of generating all distinct representatives of the classes of geometric equivalence of bijunctive functions. By this method we calculate the numbers of bijunctive functions of 5, 6, and 7 variables.
Published Online: 2016-2-2
Published in Print: 2002-6-1
© 2016 by Walter de Gruyter Berlin/Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Editorial
- On inherited properties of restricted Boolean functions
- Some properties of the inertia groups of Boolean bijunctive functions and an inductive method of generating such functions
- On complexity of representation of multiple-valued logic functions as polarised polynomials
- On the periodicity of the sequence of states of an automaton corresponding to a given initial state and a given periodic input sequence
- On the analysis of fuzzy information graphs
- Lattices of Ω-foliated formations
- A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic
- On some conditions for absence of a giant component in the generalised allocation scheme
- On 2-regular graphs whose girth is one less than the maximum
- Forthcoming Papers
- Contents
Articles in the same Issue
- Editorial
- On inherited properties of restricted Boolean functions
- Some properties of the inertia groups of Boolean bijunctive functions and an inductive method of generating such functions
- On complexity of representation of multiple-valued logic functions as polarised polynomials
- On the periodicity of the sequence of states of an automaton corresponding to a given initial state and a given periodic input sequence
- On the analysis of fuzzy information graphs
- Lattices of Ω-foliated formations
- A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic
- On some conditions for absence of a giant component in the generalised allocation scheme
- On 2-regular graphs whose girth is one less than the maximum
- Forthcoming Papers
- Contents
