The computational complexity of module socles

Annals of Pure and Applied Logic 173 (5):103089 (2022)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2022.103089

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On the computational complexity of the theory of Abelian groups.Libo Lo - 1988 - Annals of Pure and Applied Logic 37 (3):205-248.
Computational complexity of hybrid interval temporal logics.Przemysław Andrzej Wałęga - 2023 - Annals of Pure and Applied Logic 174 (1):103165.
Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity.Daniel Leivant - 1999 - Annals of Pure and Applied Logic 96 (1-3):209-229.
On the computational complexity of integral equations.Ker-I. Ko - 1992 - Annals of Pure and Applied Logic 58 (3):201-228.
The Complexity of Radicals and Socles of Modules.Huishan Wu - 2020 - Notre Dame Journal of Formal Logic 61 (1):141-153.
A computational glimpse at the Leibniz and Frege hierarchies.Tommaso Moraschini - 2018 - Annals of Pure and Applied Logic 169 (1):1-20.
Splitting into degrees with low computational strength.Rod Downey & Keng Meng Ng - 2018 - Annals of Pure and Applied Logic 169 (8):803-834.
The computational strength of matchings in countable graphs.Stephen Flood, Matthew Jura, Oscar Levin & Tyler Markkanen - 2022 - Annals of Pure and Applied Logic 173 (8):103133.
Lower complexity bounds in justification logic.Samuel R. Buss & Roman Kuznets - 2012 - Annals of Pure and Applied Logic 163 (7):888-905.
On the complexity of the Leibniz hierarchy.Tommaso Moraschini - 2019 - Annals of Pure and Applied Logic 170 (7):805-824.

Analytics

Added to PP
2022-04-07

Downloads
32 (#709,290)

6 months
9 (#495,347)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The Complexity of Radicals and Socles of Modules.Huishan Wu - 2020 - Notre Dame Journal of Formal Logic 61 (1):141-153.
Computable Abelian groups.Alexander G. Melnikov - 2014 - Bulletin of Symbolic Logic 20 (3):315-356,.
Recursively enumerable vector spaces.G. Metakides - 1977 - Annals of Mathematical Logic 11 (2):147.
Effective content of field theory.G. Metakides - 1979 - Annals of Mathematical Logic 17 (3):289.

Add more references