The cardinality of functionally complete algebras on a three element set
✍ Scribed by J. Pantović; R. Tošić; G. Vojvodić
- Publisher
- Springer
- Year
- 1997
- Tongue
- English
- Weight
- 137 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0002-5240
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract A set of propositional connectives is said to be __functionally complete__ if all propositional formulae can be expressed using only connectives from that set. In this paper we give sufficient and necessary conditions for a one‐element set of propositional connectives to be functionally
An independent set or stable set of a graph G V, E is a subset S of the Ž . vertices set V in which no two are adjacent. Let G be the number of vertices in Ž . a stable set of maximum cardinality; G is called the stability number of G. Stability numbers of a graph have been well studied, but little
We provide a solution to the important problem of constructing complete independent sets of Euclidean and affine invariants for algebraic curves. We first simplify algebraic curves through polynomial decompositions and then use some classical geometric results to construct functionally independent s