Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Class groups of integral group rings - MaRDI portal

Class groups of integral group rings

From MaRDI portal
Publication:5659493

DOI10.1090/S0002-9947-1972-0304470-6zbMath0247.00014MaRDI QIDQ5659493

No author found.

Publication date: 1972

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)




Related Items

Two theorems on degrees of models of true arithmeticOrdered Groups: A Case Study in Reverse Mathematics2000 Annual Meeting of the Association for Symbolic LogicReverse Mathematics: The Playground of LogicA Survey of Mučnik and Medvedev DegreesWhich set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?Transfering saturation, the finite cover property, and stabilityOpen Questions in Reverse MathematicsΠ01-classes and Rado's selection principleOn the number of automorphisms of uncountable modelsDegree spectra of prime modelsDegrees of unsolvability of continuous functionsEuropean Summer Meeting of the Association for Symbolic Logic, (Logic Colloquium '87), Granada, Spain, 1987On recursion theory in 1Degrees coded in jumps of orderingsEffective versions of Ramsey's Theorem: Avoiding the cone above 0′Degree theoretic definitions of the low2 recursively enumerable setsOn the strength of Ramsey's theorem for pairsProjective class groups of symmetric and alternating groupsJump inversions inside effectively closed sets and applications to randomnessΠ10 classes and strong degree spectra of relationsComparing the Medvedev and Turing degrees of Π01 classesEncodability of Kleene's OExpansions of models and turing degreesForcing in Proof TheoryThe importance of Π10 classes in effective randomnessCOMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTIONReverse mathematics, computability, and partitions of treesFinding paths through narrow and wide treesPartition Theorems and Computability TheoryMass Problems and RandomnessDegrees of rigidity for Souslin treesLow upper bounds of idealsRamsey's theorem and cone avoidanceMeeting of the Association for Symbolic Logic, New York, 1979European Summer Meeting of the Association for Symbolic Logic, Leeds, 1979Complexity, decidability and completenessEnumerations of the Kolmogorov functionPromptness does not imply superlow cuppabilityThe strength of the rainbow Ramsey Theoremd-computable categoricity for algebraic fieldsTwo-dimensional partial orderings: Recursive model theoryOn the ranked points of a Π10 setUniform almost everywhere dominationCalibrating RandomnessOn the projective class group of arithmetic groupsΠ10 classes with complex elementsThe Baire category theorem in weak subsystems of second-order arithmeticRainbow Ramsey Theorem for Triples is Strictly Weaker than the Arithmetical Comprehension AxiomΠ10 classes and Boolean combinations of recursively enumerable setsModel companions of distributive p-algebras



Cites Work