Complete systems of monadic predicates for post classes

DOI10.3103/S0027132216040057MaRDI QIDQ2362859zbMATH OpenOpenAlexFDO

Authors Svetlana V. Bykovskaya

Publication date 14 July 2017

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s0027132216040057

zbMATH Keywords

closed classes of Boolean functionscomplete system of predicatesmonadic functionmonadic predicate

Mathematics Subject Classification ID

Basic properties of first-order languages and structures (03C07) Boolean functions (06E30)

Review text

In this paper, a completeness theorem is proved for a system of predicates over an arbitrary system of Boolean functions.

Recommendations

• On a family of precomplete classes of recursive functions and predicates
• Completeness criteria for some classes of unary monotone functions in \(P_k\)
• scientific article; zbMATH DE number 4134025
• scientific article; zbMATH DE number 4134026
• scientific article; zbMATH DE number 5005932

Cited in

(3)

• On a family of precomplete classes of recursive functions and predicates
• A completeness theorem in the class of quasimonotonic functions
• Completeness criteria for some classes of unary monotone functions in \(P_k\)

This page was built for publication: Complete systems of monadic predicates for post classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2362859)