On the complexity of the Leibniz hierarchy
type: Item
instance of: scholarly article
title: On the complexity of the Leibniz hierarchy
published in: Annals of Pure and Applied Logic
publication date: 2019-05-02T00:00:00Z
full work available at URL: https://arxiv.org/abs/1908.00924
Mathematics Subject Classification ID: 03G27
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03C05
Mathematics Subject Classification ID: 08B05
zbMATH DE Number: 7049925
zbMATH Keywords: abstract algebraic logic
zbMATH Keywords: Leibniz hierarchy
zbMATH Keywords: algebraizable logic
zbMATH Keywords: protoalgebraic logic
zbMATH Keywords: complexity theory
author: Tommaso Moraschini
Wikidata QID: Q123260237
MaRDI profile type: Publication
OpenAlex ID: W2920555127
cites work: Assertional logics, truth-equational logics, and the hierarchies of abstract algebraic logic
cites work: Computational Complexity
cites work: Q3093852
cites work: COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
cites work: Q3365834
cites work: Equivalence of consequence operations
cites work: Algebraizable logics
cites work: Q4029628
cites work: Algebraic semantics for deductive systems
cites work: Reduced products of logical matrices
cites work: Protoalgebraic logics
cites work: Some characterization theorems for infinitary universal Horn logic without equality
cites work: Q3185647
cites work: Q4715441
cites work: Update to ``A survey of abstract algebraic logic''
cites work: ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
cites work: The lattice of interpretability types of varieties
cites work: Two Mal'cev-type theorems in universal algebra
cites work: On the Computational Complexity of Algorithms
cites work: FINDING TYPE SETS IS NP-HARD
cites work: The structure of finite algebras
cites work: THE POSET OF ALL LOGICS I: INTERPRETATIONS AND LATTICE STRUCTURE
cites work: The shape of congruence lattices
cites work: Q3751631
cites work: A computational glimpse at the Leibniz and Frege hierarchies
cites work: A STUDY OF TRUTH PREDICATES IN MATRIX SEMANTICS
cites work: Q4298260
cites work: Correspondences between gentzen and hilbert systems
cites work: Q5441554
cites work: A perspective on the algebra of logic
cites work: Order algebraizable logics
cites work: Characterizing Mal'cev conditions
DOI: 10.1016/J.APAL.2019.02.003
Recommended article: Logical Approaches to Computational Barriers
Recommended article: On a complexity hierarchy between L and NL
Recommended article: A computational glimpse at the Leibniz and Frege hierarchies
Recommended article: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Recommended article: Sur la complexité du principe de Tarski-Seidenberg
Recommended article: The complexity of Tarski's fixed point theorem
Recommended article: Leibniz complexity of Nash functions on differentiations
Recommended article: Complexity of the Lambek calculus and its fragments
Recommended article: Complexity of some problems in positive and related calculi
description: scientific article; zbMATH DE number 7049925