7 found
Order:
  1.  9
    Reverse mathematics, young diagrams, and the ascending chain condition.Kostas Hatzikiriakou & Stephen G. Simpson - 2017 - Journal of Symbolic Logic 82 (2):576-589.
    LetSbe the group of finitely supported permutations of a countably infinite set. Let$K[S]$be the group algebra ofSover a fieldKof characteristic 0. According to a theorem of Formanek and Lawrence,$K[S]$satisfies the ascending chain condition for two-sided ideals. We study the reverse mathematics of this theorem, proving its equivalence over$RC{A_0}$ to the statement that${\omega ^\omega }$is well ordered. Our equivalence proof proceeds via the statement that the Young diagrams form a well partial ordering.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  2.  28
    Algebraic disguises ofΣ 1 0 induction.Kostas Hatzikiriakou - 1989 - Archive for Mathematical Logic 29 (1):47-51.
  3.  18
    Countable valued fields in weak subsystems of second-order arithmetic.Kostas Hatzikiriakou & Stephen G. Simpson - 1989 - Annals of Pure and Applied Logic 41 (1):27-32.
  4.  19
    A note on ordinal numbers and rings of formal power series.Kostas Hatzikiriakou - 1994 - Archive for Mathematical Logic 33 (4):261-263.
  5.  11
    Minimal prime ideals and arithmetic comprehension.Kostas Hatzikiriakou - 1991 - Journal of Symbolic Logic 56 (1):67-70.
  6.  12
    WKL0 and Stone's separation theorem for convex sets.Kostas Hatzikiriakou - 1996 - Annals of Pure and Applied Logic 77 (3):245-249.
    The Stone's Separation Theorem is equivalent to Weak König's Lemma.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  9
    WKL< sub> 0 and Stone's separation theorem for convex sets.Kostas Hatzikiriakou - 1996 - Annals of Pure and Applied Logic 77 (3):245-249.
    The Stone's Separation Theorem is equivalent to Weak König's Lemma.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation