Complete systems of monadic predicates for post classes (Q2362859)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6745662
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complete systems of monadic predicates for post classes |
scientific article; zbMATH DE number 6745662 |
Statements
Complete systems of monadic predicates for post classes (English)
0 references
14 July 2017
0 references
In this paper, a completeness theorem is proved for a system of predicates over an arbitrary system of Boolean functions.
0 references
monadic predicate
0 references
monadic function
0 references
complete system of predicates
0 references
closed classes of Boolean functions
0 references
0.8225510716438293
0 references
0.8148043155670166
0 references
