The computability, definability, and proof theory of Artinian rings
type: Item
instance of: scholarly article
title: The computability, definability, and proof theory of Artinian rings
zbMATH Open document ID: 1454.03016
author: Chris J. Conidis
published in: Advances in Mathematics
publication date: 2018-12-04T00:00:00Z
Mathematics Subject Classification ID: 03B30
Mathematics Subject Classification ID: 03F35
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 13E10
zbMATH DE Number: 6988557
zbMATH Keywords: computability theory
zbMATH Keywords: reverse mathematics
zbMATH Keywords: proof theory
zbMATH Keywords: definability
zbMATH Keywords: Artinian ring
MaRDI profile type: Publication
full work available at URL: j.aim.2018.10.036
OpenAlex ID: W2898898042
cites work: Q5563439
cites work: Rekursive Algebren mit Kettenbedingungen
cites work: Word problems and recursively enumerable degrees at unsolvability. A first paper on Thue systems
cites work: Chain conditions in computable rings
cites work: The decision problem for exponential diophantine equations
cites work: Algorithmic Randomness and Complexity
cites work: Ideals in computable rings
cites work: Q4485838
cites work: Q4317713
cites work: Q4111536
cites work: Countable algebra and set existence axioms
cites work: Addendum to ``Countable algebra and set existence axioms''
cites work: Effective procedures in field theory
cites work: Q4138726
cites work: Low upper bounds of ideals
cites work: Q2734153
cites work: Q5287502
cites work: Q3992465
cites work: Open Questions in Reverse Mathematics
cites work: Q3611832
cites work: Recursive Unsolvability of a problem of Thue
cites work: Q3395521
cites work: Σ_{𝑛}-bounding and Δ_{𝑛}-induction
cites work: Q4040892
cites work: Turing Computability
cites work: Q4934287
cites work: The word problem in semi-groups with cancellation
Wikidata QID: Q129024316
DOI: 10.1016/J.AIM.2018.10.036
description: scientific article; zbMATH DE number 6988557