Order:
  1.  6
    The Complexity of Radicals and Socles of Modules.Huishan Wu - 2020 - Notre Dame Journal of Formal Logic 61 (1):141-153.
    This paper studies two dual notions in module theory—namely, radicals and socles—from the standpoint of reverse mathematics. We first consider radicals of Z-modules, where the radical of a Z-module M is defined as the intersection of pM={px:x∈M} with p taken from all primes. It shows that ACA0 is equivalent to the existence of radicals of Z-modules over RCA0. We then study socles of modules over commutative rings with identity. The socle of an R-module M is the largest semisimple submodule of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  2.  14
    Ring structure theorems and arithmetic comprehension.Huishan Wu - 2020 - Archive for Mathematical Logic 60 (1-2):145-160.
    Schur’s Lemma says that the endomorphism ring of a simple left R-module is a division ring. It plays a fundamental role to prove classical ring structure theorems like the Jacobson Density Theorem and the Wedderburn–Artin Theorem. We first define the endomorphism ring of simple left R-modules by their Π10\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Pi ^{0}_{1}$$\end{document} subsets and show that Schur’s Lemma is provable in RCA0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm RCA_{0}$$\end{document}. A ring (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  18
    Structure of semisimple rings in reverse and computable mathematics.Huishan Wu - 2023 - Archive for Mathematical Logic 62 (7):1083-1100.
    This paper studies the structure of semisimple rings using techniques of reverse mathematics, where a ring is left semisimple if the left regular module is a finite direct sum of simple submodules. The structure theorem of left semisimple rings, also called Wedderburn-Artin Theorem, is a famous theorem in noncommutative algebra, says that a ring is left semisimple if and only if it is isomorphic to a finite direct product of matrix rings over division rings. We provide a proof for the (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  11
    Bounded-low sets and the high/low hierarchy.Huishan Wu - 2020 - Archive for Mathematical Logic 59 (7-8):925-938.
    Anderson and Csima defined a bounded jump operator for bounded-Turing reduction, and studied its basic properties. Anderson et al. constructed a low bounded-high set and conjectured that such sets cannot be computably enumerable. Ng and Yu proved that bounded-high c.e. sets are Turing complete, thus answered the conjecture positively. Wu and Wu showed that bounded-low sets can be superhigh by constructing a Turing complete bounded-low c.e. set. In this paper, we continue the study of the comparison between the bounded-jump and (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  3
    Effective aspects of Jacobson radicals of rings.Huishan Wu - 2021 - Mathematical Logic Quarterly 67 (4):489-505.
    This paper studies effective aspects of Jacobson radicals of rings and their applications from the viewpoint of reverse mathematics. First, we propose four radicals of rings, showing that the first order (resp., second order) left and right Jacobson radical coincide in (resp., ). Second, we study Jacobson radicals in left (resp., right) local rings and show that the second order left and right Jacobson radical of left (resp., right) local rings coincide within. Third, we apply our results about Jacobson radicals (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  9
    Orders on computable rings.Huishan Wu - 2020 - Mathematical Logic Quarterly 66 (2):126-135.
    The Artin‐Schreier theorem says that every formally real field has orders. Friedman, Simpson and Smith showed in [6] that the Artin‐Schreier theorem is equivalent to over. We first prove that the generalization of the Artin‐Schreier theorem to noncommutative rings is equivalent to over. In the theory of orderings on rings, following an idea of Serre, we often show the existence of orders on formally real rings by extending pre‐orders to orders, where Zorn's lemma is used. We then prove that “pre‐orders (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  11
    Reverse mathematics and semisimple rings.Huishan Wu - 2022 - Archive for Mathematical Logic 61 (5):769-793.
    This paper studies various equivalent characterizations of left semisimple rings from the standpoint of reverse mathematics. We first show that \ is equivalent to the statement that any left module over a left semisimple ring is semisimple over \. We then study characterizations of left semisimple rings in terms of projective modules as well as injective modules, and obtain the following results: \ is equivalent to the statement that any left module over a left semisimple ring is projective over \; (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  8.  20
    The computational complexity of module socles.Huishan Wu - 2022 - Annals of Pure and Applied Logic 173 (5):103089.
  9.  6
    The Complexity of Decomposability of Computable Rings.Huishan Wu - 2023 - Notre Dame Journal of Formal Logic 64 (1):1-14.
    This article studies the complexity of decomposability of rings from the perspective of computability. Based on the equivalence between the decomposition of rings and that of the identity of rings, we propose four kinds of rings, namely, weakly decomposable rings, decomposable rings, weakly block decomposable rings, and block decomposable rings. Let R be the index set of computable rings. We study the complexity of subclasses of computable rings, showing that the index set of computable weakly decomposable rings is m-complete Σ10 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark