On the complexity of the Leibniz hierarchy (Q1740630): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Assertional logics, truth-equational logics, and the hierarchies of abstract algebraic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3365834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of consequence operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraizable logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4029628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic semantics for deductive systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced products of logical matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protoalgebraic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some characterization theorems for infinitary universal Horn logic without equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3185647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Update to ``A survey of abstract algebraic logic'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lattice of interpretability types of varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Mal'cev-type theorems in universal algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: FINDING TYPE SETS IS NP-HARD / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of finite algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE POSET OF ALL LOGICS I: INTERPRETATIONS AND LATTICE STRUCTURE / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shape of congruence lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational glimpse at the Leibniz and Frege hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A STUDY OF TRUTH PREDICATES IN MATRIX SEMANTICS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correspondences between gentzen and hilbert systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5441554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A perspective on the algebra of logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order algebraizable logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Mal'cev conditions / rank
 
Normal rank

Latest revision as of 02:41, 19 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of the Leibniz hierarchy
scientific article

    Statements

    On the complexity of the Leibniz hierarchy (English)
    0 references
    2 May 2019
    0 references
    abstract algebraic logic
    0 references
    Leibniz hierarchy
    0 references
    algebraizable logic
    0 references
    protoalgebraic logic
    0 references
    complexity theory
    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