Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Chris J. Conidis
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
The Complexity of Module Radicals
2021
Chris J. Conidis
+
PDF
Chat
Transfinitely valued Euclidean domains have arbitrary indecomposable order type
2019
Chris J. Conidis
Pace P. Nielsen
Vandy Tombs
+
The computability, definability, and proof theory of Artinian rings
2018
Chris J. Conidis
+
Transfinitely valued Euclidean domains have arbitrary indecomposable order type
2017
Chris J. Conidis
Pace P. Nielsen
Vandy Tombs
+
Transfinitely valued Euclidean domains have arbitrary indecomposable order type
2017
Chris J. Conidis
Pace P. Nielsen
Vandy Tombs
+
Infinite dimensional proper subspaces of computable vector spaces
2014
Chris J. Conidis
+
PDF
Chat
Random reals, the rainbow Ramsey theorem, and arithmetic conservation
2013
Chris J. Conidis
Theodore A. Slaman
+
Galvin’s “Racing Pawns” Game, Internal Hyperarithmetic Comprehension, and the Law of Excluded Middle
2013
Chris J. Conidis
Noam Greenberg
Daniel Turetsky
+
PDF
Chat
Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
2012
Chris J. Conidis
+
A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one
2012
Chris J. Conidis
+
A measure-theoretic proof of Turing incomparability
2010
Chris J. Conidis
+
PDF
Chat
Chain conditions in computable rings
2010
Chris J. Conidis
+
On the complexity of radicals in noncommutative rings
2009
Chris J. Conidis
+
PDF
Chat
Effective packing dimension of $\Pi ^0_1$-classes
2008
Chris J. Conidis
+
Tensor operators and constructing indecomposable representations of semidirect product groups
2003
Chris J. Conidis
Joe Repka
Common Coauthors
Coauthor
Papers Together
Pace P. Nielsen
3
Vandy Tombs
3
Noam Greenberg
1
Theodore A. Slaman
1
Daniel Turetsky
1
Joe Repka
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
Subsystems of Second Order Arithmetic
1999
Stephen G. Simpson
7
+
Addendum to “countable algebra and set existence axioms”
1985
Harvey M. Friedman
Stephen G. Simpson
Rick L. Smith
5
+
Countable algebra and set existence axioms11Research partially supported by NSF grants MCS-79-23743, MCS-78-02558, and MCS 8107867. Simpson's research was also supported by an Alfred P. Sloan Research Fellowship.
1983
Harvey M. Friedman
Stephen G. Simpson
Rick L. Smith
5
+
Introduction To Commutative Algebra
2018
Michael Atiyah
5
+
Ideals in computable rings
2007
Rodney G. Downey
Steffen Lempp
Joseph R. Mileti
5
+
Commutative Ring Theory
1987
H. Matsumura
4
+
Introduction to Commutative Algebra.
1970
D. J. Lewis
B. R. McDonald
M. F. Atiyah
I. G. Macdonald
4
+
PDF
Chat
Grundzüge einer arithmetischen Theorie der algebraischen Grössen
1882
LĂ©opold Kronecker
4
+
PDF
Chat
Chain conditions in computable rings
2010
Chris J. Conidis
3
+
Metamathematics of First-Order Arithmetic
1993
Petr Hájek
Pavel Pudlák
3
+
INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
2006
Antonio Montalbán
3
+
PDF
Chat
A First Course in Noncommutative Rings
2001
T. Y. Lam
3
+
Grundzüge einer arithmetischen Theorie der algebraischen Grössen. (Abdruck einer Festschrift zu Herrn E. E. Kummers Doctor-Jubiläum, 10. September 1881.).
1882
LĂ©opold Kronecker
3
+
Die Frage der endlich vielen Schritte in der Theorie der Polynomideale
1926
Grete Hermann
2
+
PDF
Chat
The dimensions of individual strings and sequences
2003
Jack H. Lutz
2
+
On the complexity of radicals in noncommutative rings
2009
Chris J. Conidis
2
+
PDF
Chat
On the Strength of Ramsey's Theorem
1995
David Seetapun
Theodore A. Slaman
2
+
Subspaces of computable vector spaces
2007
Rodney G. Downey
Denis R. Hirschfeldt
Asher M. Kach
Steffen Lempp
Joseph R. Mileti
Antonio Montalbán
2
+
PDF
Chat
Fractal Geometry: Mathematical Foundations and Applications.
1990
K. J. Falconer
2
+
PDF
Chat
The Euclidean algorithm
1949
Th. Motzkin
2
+
PDF
Chat
Computable algebra, general theory and theory of computable fields.
1960
Michael O. Rabin
2
+
PDF
Chat
A first course in noncommutative rings
1992
Tsit Yuen Lam
2
+
PDF
Chat
On the strength of Ramsey's theorem for pairs
2001
Peter Cholak
Carl G. Jockusch
Theodore A. Slaman
2
+
PDF
Chat
A Note on Euclidean Order Types
2014
Pete L. Clark
2
+
Algebra, Vol. 1
1967
L. RĂ©dei
2
+
Initial segments of models of Peano's axioms
1977
Laurence Kirby
J. B. Paris
2
+
A <i>r</i>-maximal vector space not contained in any maximal vector space
1978
Jeffrey B. Remmel
1
+
Computable algebra and group embeddings
1981
Gilbert Baumslag
Frank B. Cannonito
Charles F. Miller
1
+
Grundzüge einer arithmetischen Theorie der algebraische Grössen.
1882
L. Kronecker
1
+
PDF
Chat
THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
2008
Itay Neeman
1
+
Using random sets as oracles
2007
Denis R. Hirschfeldt
André Nies
Frank Stephan
1
+
Controlling the dependence degree of a recursively enumerable vector space
1978
Richard A. Shore
1
+
PDF
Chat
The atomic model theorem and type omitting
2009
Denis R. Hirschfeldt
Richard A. Shore
Theodore A. Slaman
1
+
PDF
Chat
Î 1 0 Classes, Peano Arithmetic, Randomness, and Computable Domination
2010
David Diamondstone
Damir D. Dzhafarov
Robert I. Soare
1
+
DEGREES OF UNSOLVABILITY
1964
R. L. Goodstein
1
+
Ordered Groups: A Case Study in Reverse Mathematics
1999
Reed Solomon
1
+
PDF
Chat
Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension
2010
Joseph S. Miller
1
+
Measure theory and weak König's lemma
1990
Xiaokang Yu
Stephen G. Simpson
1
+
PDF
Chat
Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups
1984
Dennis Sullivan
1
+
About Euclidean rings
1971
Samuel Pierre
1
+
Effectively categorical abelian groups
2012
Rodney G. Downey
Alexander Melnikov
1
+
The Baire category theorem in weak subsystems of second-order arithmetic
1993
Douglas K. Brown
Stephen G. Simpson
1
+
Algebra
1991
B. L. van der Waerden
1
+
PDF
Chat
Effective packing dimension of $\Pi ^0_1$-classes
2008
Chris J. Conidis
1
+
Construction of indecomposable representations of inhomogeneous Lie groups
1989
Vittorio Cantoni
1
+
The definition of random sequences
1966
Per Martin-Löf
1
+
Reverse Mathematics: The Playground of Logic
2010
Richard A. Shore
1
+
A Kolmogorov complexity characterization of constructive Hausdorff dimension
2002
Elvira Mayordomo
1
+
Models of Peano Arithmetic
1991
Richard Kaye
1
+
Rings and Categories of Modules
1992
Frank W. Anderson
Kent R. Fuller
1