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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Changed label, description and/or aliases in en, and other parts
 
(6 intermediate revisions by 5 users not shown)
description / endescription / en
scientific article
scientific article; zbMATH DE number 7049925
Property / DOI
 
Property / DOI: 10.1016/j.apal.2019.02.003 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2920555127 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.APAL.2019.02.003 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / Recommended article: Logical Approaches to Computational Barriers / qualifier
 
Similarity Score: 0.8750644
Amount0.8750644
Unit1
Property / Recommended article: Logical Approaches to Computational Barriers / qualifier
 
Property / Recommended article
 
Property / Recommended article: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / Recommended article: Logical Approaches to Computational Barriers / qualifier
 
Similarity Score: 0.87323
Amount0.87323
Unit1
Property / Recommended article: Logical Approaches to Computational Barriers / qualifier
 
Property / Recommended article
 
Property / Recommended article: On a complexity hierarchy between L and NL / rank
 
Normal rank
Property / Recommended article: On a complexity hierarchy between L and NL / qualifier
 
Similarity Score: 0.8693022
Amount0.8693022
Unit1
Property / Recommended article: On a complexity hierarchy between L and NL / qualifier
 
Property / Recommended article
 
Property / Recommended article: A computational glimpse at the Leibniz and Frege hierarchies / rank
 
Normal rank
Property / Recommended article: A computational glimpse at the Leibniz and Frege hierarchies / qualifier
 
Similarity Score: 0.8672507
Amount0.8672507
Unit1
Property / Recommended article: A computational glimpse at the Leibniz and Frege hierarchies / qualifier
 
Property / Recommended article
 
Property / Recommended article: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / Recommended article: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / qualifier
 
Similarity Score: 0.86395466
Amount0.86395466
Unit1
Property / Recommended article: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / qualifier
 
Property / Recommended article
 
Property / Recommended article: Sur la complexité du principe de Tarski-Seidenberg / rank
 
Normal rank
Property / Recommended article: Sur la complexité du principe de Tarski-Seidenberg / qualifier
 
Similarity Score: 0.86195445
Amount0.86195445
Unit1
Property / Recommended article: Sur la complexité du principe de Tarski-Seidenberg / qualifier
 
Property / Recommended article
 
Property / Recommended article: The complexity of Tarski's fixed point theorem / rank
 
Normal rank
Property / Recommended article: The complexity of Tarski's fixed point theorem / qualifier
 
Similarity Score: 0.861449
Amount0.861449
Unit1
Property / Recommended article: The complexity of Tarski's fixed point theorem / qualifier
 
Property / Recommended article
 
Property / Recommended article: Leibniz complexity of Nash functions on differentiations / rank
 
Normal rank
Property / Recommended article: Leibniz complexity of Nash functions on differentiations / qualifier
 
Similarity Score: 0.8585148
Amount0.8585148
Unit1
Property / Recommended article: Leibniz complexity of Nash functions on differentiations / qualifier
 
Property / Recommended article
 
Property / Recommended article: Complexity of the Lambek calculus and its fragments / rank
 
Normal rank
Property / Recommended article: Complexity of the Lambek calculus and its fragments / qualifier
 
Similarity Score: 0.8556252
Amount0.8556252
Unit1
Property / Recommended article: Complexity of the Lambek calculus and its fragments / qualifier
 
Property / Recommended article
 
Property / Recommended article: Complexity of some problems in positive and related calculi / rank
 
Normal rank
Property / Recommended article: Complexity of some problems in positive and related calculi / qualifier
 
Similarity Score: 0.85445786
Amount0.85445786
Unit1
Property / Recommended article: Complexity of some problems in positive and related calculi / qualifier
 

Latest revision as of 13:50, 26 May 2025

scientific article; zbMATH DE number 7049925
Language Label Description Also known as
English
On the complexity of the Leibniz hierarchy
scientific article; zbMATH DE number 7049925

    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