Countable algebra and set existence axioms

From MaRDI portal
Publication:1063593

DOI10.1016/0168-0072(83)90012-XzbMath0575.03038OpenAlexW1522998756MaRDI QIDQ1063593

Rick L. Smith, Harvey M. Friedman, Stephen G. Simpson

Publication date: 1983

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(83)90012-x




Related Items

Ordered Groups: A Case Study in Reverse MathematicsA rank one cohesive setWhich set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?The computability, definability, and proof theory of Artinian ringsOpen Questions in Reverse MathematicsIterated trees and fragments of arithmeticThe role of parameters in bar rule and bar inductionA game-theoretic equivalence to the Hahn-Banach theoremAlgebraic disguises of \(\Sigma ^ 0_ 1\) inductionHerbrand analysesNichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite treesReverse mathematics and semisimple ringsHilbert's program and the omega-ruleOn the complexity of radicals in noncommutative ringsDegrees containing members of thin Π10 classes are dense and co-denseInfinite versions of some problems from finite complexity theoryStability theory and set existence axiomsThe complexity of radicals and socles of modulesDegrees of orders on torsion-free abelian groupsLifting proofs from countable to uncountable mathematicsPrimitive recursive reverse mathematicsInfinite dimensional proper subspaces of computable vector spacesStructure of semisimple rings in reverse and computable mathematicsEffective aspects of Jacobson radicals of ringsThe finite intersection principle and genericityOrders on computable ringsReverse Mathematics of MatroidsWeak comparability of well orderings and reverse mathematicsFixed point theory in weak second-order arithmeticComputability-theoretic and proof-theoretic aspects of partial and linear orderingsRing structure theorems and arithmetic comprehensionThe Dirac delta function in two settings of reverse mathematicsIdeals in computable ringsOrdinal numbers and the Hilbert basis theoremJump degrees of torsion-free abelian groupsCA0 and order types of countable ordered groupsProper divisibility in computable ringsInvariants, Boolean algebras and ACA₀⁺The complexity of primes in computable unique factorization domainsEffective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximationCountable thin \(\Pi^0_1\) classesMetric structures and probabilistic computationReverse mathematics and fully ordered groupsMind change complexity of inferring unbounded unions of restricted pattern languages from positive dataRanked structures and arithmetic transfinite recursionSet existence axioms for general (not necessarily countable) stability theoryConnected components of graphs and reverse mathematicsMinimal prime ideals and arithmetic comprehensionOn uniform relationships between combinatorial problemsChain conditions in computable ringsThe isomorphism problem for computable Abelian p-groups of bounded lengthOn the independence of core-equivalence results from Zermelo-Fraenkel set theoryWhich set existence axioms are needed to prove the separable Hahn-Banach theorem?European Summer Meeting of the Association for Symbolic Logic, Paris, 1985BOUNDS FOR INDEXES OF NILPOTENCY IN COMMUTATIVE RING THEORY: A PROOF MINING APPROACHCharacterizing von Neumann regular rings in reverse mathematicsOn the ranked points of a Π10 setAddendum to ``Countable algebra and set existence axiomsThe Baire category theorem in weak subsystems of second-order arithmeticGeneralizing classical and effective model theory in theories of operations and classesTHE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC



Cites Work