David R. Solomon
Professor/Mathematics

Contact:

Are you David R. Solomon?

How to update your information.
Scholarly Contributions

45 Scholarly Contributions

Poster/Presentation ✕
45
Poster/Presentations
13
Journal Articles
7
Conference Proceedings
Computability, randomness and generosity
David R Solomon , (2021). Computability, randomness and generosity, SIGMA seminar
Research Type: Poster/Presentation
Weakly cop-win graphs and dominating orders
David R Solomon , (2021). Weakly cop-win graphs and dominating orders, Computability theory and effective mathematics, AMS Special Session
Research Type: Poster/Presentation
Effectiveness aspects of Hindman's Theorem
David R Solomon , (2020). Effectiveness aspects of Hindman's Theorem, Computability Seminar, MSRI (online)
Research Type: Poster/Presentation
Low for isomorphism degrees, exact pairs and computable traceability
David R Solomon , (2020). Low for isomorphism degrees, exact pairs and computable traceability, Connecticut Logic Seminar
Research Type: Poster/Presentation
Hilbert's First Problem
David R Solomon , (2019). Hilbert's First Problem, UConn Math Club
Research Type: Poster/Presentation
Relatively decidable theories
David R Solomon , (2019). Relatively decidable theories, Special Session on Computability Theory, Canadian Mathematical Society, Canada
Research Type: Poster/Presentation
Computable traceability, exact pairs and lowness for isomorphism
David R Solomon , (2019). Computable traceability, exact pairs and lowness for isomorphism, Workshop on Computability Theory, AMS Special Session
Research Type: Poster/Presentation
Revisiting Remmel's analysis of computable categoricity for linear orders
David R Solomon , (2019). Revisiting Remmel's analysis of computable categoricity for linear orders, 2019 Joint Mathematics Meeting
Research Type: Poster/Presentation
The random graph
David R Solomon , (2019). The random graph, UConn Math Club
Research Type: Poster/Presentation
Preparing for graduate school
David R Solomon , (2019). Preparing for graduate school, REU Sigma seminar
Research Type: Poster/Presentation
Partial results on the complexity of roots of polynomials over Hahn fields and Puiseux fields
David R Solomon , (2018). Partial results on the complexity of roots of polynomials over Hahn fields and Puiseux fields, Oberwolfach meeting on Computability Theory, Germany
Research Type: Poster/Presentation
Model completeness and relative decidability of countable structures
David R Solomon , (2018). Model completeness and relative decidability of countable structures, Connecticut Logic Seminar
Research Type: Poster/Presentation
Ordered abelian groups and Hahn's theorem
David R Solomon , (2017). Ordered abelian groups and Hahn's theorem, Connecticut Logic Seminar
Research Type: Poster/Presentation
Reverse mathematics, effectiveness and the Dual Ramsey theorem
David R Solomon , (2017). Reverse mathematics, effectiveness and the Dual Ramsey theorem, 2017 Annual Association for Symbolic Logic Meeting
Research Type: Poster/Presentation
Ordered abelian groups, generalized series and integer parts
David R Solomon , (2017). Ordered abelian groups, generalized series and integer parts, Aspects of Computation, Singapore
Research Type: Poster/Presentation
Baire codes for Borel sets in reverse mathematics
David R Solomon , (2017). Baire codes for Borel sets in reverse mathematics, Midwest Computability Seminar
Research Type: Poster/Presentation
Strong computable reducibility and versions of Ramsey's Theorem
David R Solomon , (2016). Strong computable reducibility and versions of Ramsey's Theorem, Southeast Logic Symposium 2016
Research Type: Poster/Presentation
Defining functions by transfinite recursion
David R Solomon , (2016). Defining functions by transfinite recursion, UConn Math Club
Research Type: Poster/Presentation
Minimal wit-degrees cannot have c.e. Turing degree
David R Solomon , (2016). Minimal wit-degrees cannot have c.e. Turing degree, Connecticut Logic Seminar
Research Type: Poster/Presentation
Finding order in randomness: Ramsey style regularity theorems
David R Solomon , (2016). Finding order in randomness: Ramsey style regularity theorems, Wellesley College Math Department Colloquium
Research Type: Poster/Presentation
Stability in reverse mathematics and computable reductions
David R Solomon , (2016). Stability in reverse mathematics and computable reductions, Computability in Europe 2016, France
Research Type: Poster/Presentation
Effectiveness and the Dual Ramsey Theorem
David R Solomon , (2016). Effectiveness and the Dual Ramsey Theorem, American Math Society Meeting, Saint Thomas University
Research Type: Poster/Presentation
The uniform content of ADS
David R Solomon, Jacob Daniel Suggs, Damir Dzhafarov, Eric P. Astor , (2016). The uniform content of ADS, 2016 North American Annual Meeting of the Association for Symbolic Logic, North America
Research Type: Poster/Presentation
Weihrauch reducibility and Ramsey theorems
David R Solomon , (2016). Weihrauch reducibility and Ramsey theorems, CUNY Logic Workshop
Research Type: Poster/Presentation
Logic and the random graph
David R Solomon , (2015). Logic and the random graph, Sigma seminar
Research Type: Poster/Presentation
Revisiting EM and ADS
David R Solomon , (2015). Revisiting EM and ADS, CT Logic Seminar
Research Type: Poster/Presentation
RT^1_k, SRT^2_l and sc-reducibility
David R Solomon , (2015). RT^1_k, SRT^2_l and sc-reducibility, AMS Sectional Meeting, Loyola University
Research Type: Poster/Presentation
Strong computable reductions and Ramsey's Theorem
David R Solomon , (2015). Strong computable reductions and Ramsey's Theorem, CT Logic Seminar
Research Type: Poster/Presentation
Computable ordered abelian groups and generalized series
David R Solomon , (2015). Computable ordered abelian groups and generalized series, AMS Special Session, Georgetown University
Research Type: Poster/Presentation
Ramsey's Theorem and infinite traceable graphs
David R Solomon , (2014). Ramsey's Theorem and infinite traceable graphs, New England Recursion and Definability Seminar
Research Type: Poster/Presentation
Computability in Cantor Space and in Orderings of Abelian Groups
David R Solomon , (2014). Computability in Cantor Space and in Orderings of Abelian Groups, Joint Math Meeting special session
Research Type: Poster/Presentation
Reverse math and the Dual Ramsey Theorem
David R Solomon , (2014). Reverse math and the Dual Ramsey Theorem, CT Logic Seminar
Research Type: Poster/Presentation
Separating CAC and ADS in reverse mathematics
David R Solomon , (2013). Separating CAC and ADS in reverse mathematics, Connecticut Logic Seminar
Research Type: Poster/Presentation
Examples of low for isomorphism degrees
David R Solomon , (2013). Examples of low for isomorphism degrees, BIRS 5 day workshop: Computable Model Theory
Research Type: Poster/Presentation
Set theory, orders of infinity and the independence of the Continuum Hypothesis
David R Solomon , (2013). Set theory, orders of infinity and the independence of the Continuum Hypothesis, REU Sigma Seminar
Research Type: Poster/Presentation
Ramsey style theorems and subsystems of second order arithmetic
David R Solomon , (2013). Ramsey style theorems and subsystems of second order arithmetic, UConn Logic Group
Research Type: Poster/Presentation
Turing degrees of orders on torsion free abelian groups
David R Solomon , (2012). Turing degrees of orders on torsion free abelian groups, Connecticut Logic Seminar
Research Type: Poster/Presentation
Jump degrees for torsion free abelian groups
David R Solomon, Alexander G Melnikov, Brooke M Andersen, Asher M Kach , (2012). Jump degrees for torsion free abelian groups, American Mathematical Society 2012 Spring Eastern Sectional Meeting
Research Type: Poster/Presentation
Reverse mathematics and combinatorics
David R Solomon , (2012). Reverse mathematics and combinatorics, CCSU Math Department Colloquium
Research Type: Poster/Presentation
Ramsey theory and regularity properties
David R Solomon , (2012). Ramsey theory and regularity properties, ECE Math Instructors Workshop
Research Type: Poster/Presentation
Counterexamples in Reverse Mathematics Using Iterated Forcing
Henry Towsner, David R Solomon, Manuel Lerman , (2012). Counterexamples in Reverse Mathematics Using Iterated Forcing, Cornell Logic Seminar
Research Type: Poster/Presentation
Nonstandard analysis
David R Solomon , (2012). Nonstandard analysis, UConn Math Club
Research Type: Poster/Presentation
Degree structures and computational complexity
David R Solomon , (2012). Degree structures and computational complexity, Sigma Seminar
Research Type: Poster/Presentation
Reverse mathematics: An introduction
David R Solomon , (2011). Reverse mathematics: An introduction, UConn Logic Group
Research Type: Poster/Presentation
Introduction to Ramsey Theory
David R Solomon , (2011). Introduction to Ramsey Theory, SIGMA Seminar
Research Type: Poster/Presentation