Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658)

From MaRDI portal
scientific article; zbMATH DE number 7413811
Language Label Description Also known as
English
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*
scientific article; zbMATH DE number 7413811

    Statements

    Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (English)
    0 references
    0 references
    0 references
    0 references
    25 October 2021
    0 references
    satisfiability problem
    0 references
    computable set theory
    0 references
    Boolean set theory
    0 references
    expressibility
    0 references
    NP-completeness
    0 references
    proof verification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references