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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,197

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

The Complexity of Radicals and Socles of Modules.Huishan Wu - 2020 - Notre Dame Journal of Formal Logic 61 (1):141-153.
Tractability and the computational mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Routledge. pp. 339-353.
Deissler Rank Complexity of Powers of Indecomposable Injective Modules.R. Chartrand & T. Kucera - 1994 - Notre Dame Journal of Formal Logic 35 (3):398-402.
Complexity and postmodernism: understanding complex systems.Paul Cilliers - 1998 - New York: Routledge.
Computation models for parameterized complexity.Marco Cesati & Miriam Dilanni - 1997 - Mathematical Logic Quarterly 43 (2):179-202.
The Computational Complexity of Quantified Reciprocals.Jakub Szymanik - 2009 - In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.
Introduction to Circuit Complexity: A Uniform Approach.Heribert Vollmer - 1999 - Springer Verlag.
Computational model theory: an overview.M. Vardi - 1998 - Logic Journal of the IGPL 6 (4):601-624.
Computational complexity and Godel's incompleteness theorem.Gregory J. Chaitin - 1970 - [Rio de Janeiro,: Centro Técnico Científico, Pontifícia Universidade Católica do Rio de Janeiro. Edited by Gregory J. Chaitin.
Logic and Computational Complexity International Workshop Lcc '94, Indianapolis, in, Usa, October 13-16, 1994 : Selected Papers'.Daniel Leivant - 1995 - Springer Verlag.
Deterministic chaos and computational complexity: The case of methodological complexity reductions. [REVIEW]Theodor Leiber - 1999 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 30 (1):87-101.
The computational complexity of logical theories.Jeanne Ferrante - 1979 - New York: Springer Verlag. Edited by Charles W. Rackoff.
Computational complexity of some Ramsey quantifiers in finite models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
Computational complexity analysis can help, but first we need a theory.Todd Wareham, Iris van Rooij & Moritz Müller - 2008 - Behavioral and Brain Sciences 31 (4):399-400.
Universality, Invariance, and the Foundations of Computational Complexity in the light of the Quantum Computer.Michael Cuffaro - 2018 - In Hansson Sven Ove (ed.), Technology and Mathematics: Philosophical and Historical Investigations. Cham, Switzerland: Springer Verlag. pp. 253-282.

Analytics

Added to PP
2022-04-07

Downloads
21 (#740,927)

6 months
11 (#243,798)

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