Faculty

Institution

Unit

Venue

Damir Dzhafarov

Associate Professor

University of Connecticut

Affiliations

College of Liberal Arts and Sciences

Mathematics

Damir Dzhafarov is currently serving as a College Of Liberal Arts And Sciences Associate Professor at University of Connecticut.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Damir Dzhafarov

University of Connecticut

Associate Professor

You can click a keyword to filter the displayed items

applied mathematics mathematics computational complexity computability theory mathematical logic computer science computational complexity theory theory of computation reverse mathematics formal methods mathematical analysis logical formalism algorithmic information theory linguistics applied logic strong reductions cohesive avoidance weihrauch degrees classificatory sorites philosophy of religion graph theory number theory logic in computer science internal medicine symptom management medical history integrative medicine clinical investigation analytic number theory order theory information theory formal theory formal mathematical reasoning classical logic mathematical psychology history of logic philosophy of logic rule induction lower bounds clinical disease general internal medicine evidence-based medicine clinical populations theoretical issues uniform relationships cone avoidance combinatorial principles polarized ramsey computable mathias finite intersection principle strong computable reducibility linear orders uniform content computable domination comparative sorites foundation of mathematics computational logic automated reasoning philosophy of mathematics mathematics education computational model theory

Notable Scholarly Works

Notable Federal Grants

Collaborators

Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective. Memoirs of the American Mathematical Society (2024)

Paul-Elliot Anglès d’AuriacPeter CholakDamir DzhafarovBenoît MoninLudovic Patey

computational complexityapplied mathematicsmathematicscomputability theorycomputability-theoretic perspective

On the First-Order Parts of Problems in the Weihrauch Degrees. Computability (2024)

Damir D. DzhafarovReed SolomonKeita Yokoyama

first-order partsapplied mathematicstheory of computationcomputability theoryweihrauch degrees

Reverse Mathematics. Springer eBooks (2024)

John Stillwell

reverse mathematicscomputational complexitypure mathematicsmathematics

The Ginsburg–Sands Theorem and Computability Theory. Advances in Mathematics (2024)

Heidi BenhamAndrew DeLapoDamir D. DzhafarovReed SolomonJava Darleen Villano

ginsburg-sands theoremcomputability theorymathematics

Analysis and Topology. Theory and applications of computability (2022)

Damir D. DzhafarovCarl Mummert

computational complexity theorytopologycomputational complexitycomputability theoryalgorithmic information theorymathematical analysistheory of computationapplied mathematics

Computability Theory. Theory and applications of computability (2022)

Damir D. DzhafarovCarl Mummert

computer sciencecomputational complexitycomputability theory

Forcing. Theory and applications of computability (2022)

Damir D. DzhafarovCarl Mummert

Induction and Bounding. Theory and applications of computability (2022)

Damir D. DzhafarovCarl Mummert

computer sciencelower boundscomputational complexity theoryrule inductioncomputational complexitycomputability theorytheoretical computer sciencetheory of computationapplied mathematicsmachine learning

Instance–Solution Problems. Theory and applications of computability (2022)

Damir D. DzhafarovCarl Mummert

computer scienceapplied mathematicsinstance-solution problemstheoretical computer sciencecomputability theory

Other Combinatorial Principles. Theory and applications of computability (2022)

Damir D. DzhafarovCarl Mummert

combinatoricsapplied mathematicscomputational complexity theory

1
2
3
4
5
6
10 / page

Damir Dzhafarov

Associate Professor

University of Connecticut

Affiliations

College of Liberal Arts and Sciences

Mathematics

Damir Dzhafarov is currently serving as a College Of Liberal Arts And Sciences Associate Professor at University of Connecticut.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Damir Dzhafarov

University of Connecticut

Associate Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective. Memoirs of the American Mathematical Society (2024)

Paul-Elliot Anglès d’AuriacPeter CholakDamir DzhafarovBenoît MoninLudovic Patey

computational complexityapplied mathematicsmathematicscomputability theorycomputability-theoretic perspective

On the First-Order Parts of Problems in the Weihrauch Degrees. Computability (2024)

Damir D. DzhafarovReed SolomonKeita Yokoyama

first-order partsapplied mathematicstheory of computationcomputability theoryweihrauch degrees

Reverse Mathematics. Springer eBooks (2024)

John Stillwell

reverse mathematicscomputational complexitypure mathematicsmathematics

The Ginsburg–Sands Theorem and Computability Theory. Advances in Mathematics (2024)

Heidi BenhamAndrew DeLapoDamir D. DzhafarovReed SolomonJava Darleen Villano

ginsburg-sands theoremcomputability theorymathematics

Analysis and Topology. Theory and applications of computability (2022)

Damir D. DzhafarovCarl Mummert

computational complexity theorytopologycomputational complexitycomputability theoryalgorithmic information theorymathematical analysistheory of computationapplied mathematics

Computability Theory. Theory and applications of computability (2022)

Damir D. DzhafarovCarl Mummert

computer sciencecomputational complexitycomputability theory

Forcing. Theory and applications of computability (2022)

Damir D. DzhafarovCarl Mummert

Induction and Bounding. Theory and applications of computability (2022)

Damir D. DzhafarovCarl Mummert

Instance–Solution Problems. Theory and applications of computability (2022)

Damir D. DzhafarovCarl Mummert

computer scienceapplied mathematicsinstance-solution problemstheoretical computer sciencecomputability theory

Other Combinatorial Principles. Theory and applications of computability (2022)

Damir D. DzhafarovCarl Mummert

combinatoricsapplied mathematicscomputational complexity theory

1
2
3
4
5
6
10 / page

Similar Faculty Members

Gregory L. McColm

Institution

University of South Florida

mathematical logic

mathematics education

Matthew Harrison-Trainor

Institution

University of Illinois Chicago

mathematical logic

computability theory

Peter Cholak

Institution

University of Notre Dame

extremal set theory

discrete algorithm

Antonio Montalban

Institution

University of California, Berkeley

mathematics

applied mathematics

Yiannis N. Moschovakis

Institution

University of California, Los Angeles

philosophy of language

philosophical logic

Harvey Friedman

Institution

Ohio State University

philosophy

general system

Valentina S. Harizanov

Institution

George Washington University

computable model theory

mathematical logic

Theodore A. Slaman

Institution

University of California, Berkeley

partial computations

logic in computer science

Kenneth W. Regan

Institution

University at Buffalo

logic programming

mathematical logic

Ernest Schimmerling

Institution

Carnegie Mellon University

philosophical inquiry

philosophy of science

Similar Faculty Members

Gregory L. McColm

Institution

University of South Florida

mathematical logic

mathematics education

Matthew Harrison-Trainor

Institution

University of Illinois Chicago

mathematical logic

computability theory

Peter Cholak

Institution

University of Notre Dame

extremal set theory

discrete algorithm

Antonio Montalban

Institution

University of California, Berkeley

mathematics

applied mathematics

Yiannis N. Moschovakis

Institution

University of California, Los Angeles

philosophy of language

philosophical logic

Harvey Friedman

Institution

Ohio State University

philosophy

general system

Valentina S. Harizanov

Institution

George Washington University

computable model theory

mathematical logic

Theodore A. Slaman

Institution

University of California, Berkeley

partial computations

logic in computer science

Kenneth W. Regan

Institution

University at Buffalo

logic programming

mathematical logic

Ernest Schimmerling

Institution

Carnegie Mellon University

philosophical inquiry

philosophy of science