Countable algebra and set existence axioms (Q1063593): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures for real and <i>p</i>‐adic fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorie Der Numerierungen III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of predicative analysis, II: Representations of ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective procedures in field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Summands of Separable Abelian Groups: Dedicated to Paul Turán on his 60th Birthday / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey's theorem and recursion theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: ∏ 0 1 Classes and Degrees of Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3269140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective content of field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable Algebra, General Theory and Theory of Computable Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constructive theory of countable abelian p-groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the role of Ramsey quantifiers in first order arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions in Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skolem's solution to a problem of Frobenius / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5789039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5795154 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0168-0072(83)90012-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1522998756 / rank
 
Normal rank

Latest revision as of 08:26, 30 July 2024

scientific article
Language Label Description Also known as
English
Countable algebra and set existence axioms
scientific article

    Statements

    Countable algebra and set existence axioms (English)
    0 references
    0 references
    0 references
    0 references
    1983
    0 references
    Which set existence axioms are needed to prove the theorems of ordinary mathematics ? This question was raised by Harvey Friedman at the ICM in 1974, and the authors turn to it here in the field of algebra. The procedure is to encode the structures (say, Abelian groups) and statements about them (say, ''every (countable) Abelian group has a torsion subgroup'') within second order number theory (hence the restriction to countable algebra). The encoding is, in this case, less artificial than in cases considered earlier (say, analysis). The authors encounter again the theme of Reverse Mathematics: there are five subsystems of second order number theory ranging, in increasing strength, from \(RCA_ 0\) (recursive comprehension), which is needed to make sense of the encoding, to \(\Pi^ 1_ 1\)-CA\({}_ 0\) \((\Pi^ 1_ 1\)- comprehension); and, if a theorem of ordinary mathematics is proved in the weakest possible subsystem, the statement of the theorem turns out to be provably equivalent to that subsystem over the next weaker subsystem. (The above statement about the torsion subgroup turns out to be equivalent to arithmetical comprehension over \(RCA_ 0.)\) In an introduction the authors explain the relationship between their work and computable algebra and constructive algebra.
    0 references
    second-order arithmetic
    0 references
    encoding of structures
    0 references
    Reverse Mathematics
    0 references
    comprehension
    0 references
    weakest possible subsystem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references