Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.
EDBT 2026 Demo / reviewers in the wild / expert

David R. Bélanger

dblp:00/7229 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
2since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5 · 5 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Computational complexity · 50% Logic in computer science · 50%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity › learning theory
learnability		 0.712023
Learnability and positive equivalence relations · Inf. Comput. 2023
YearPublicationVenuePosition
2023 Learnability and positive equivalence relations
David R. Bélanger, Ziyuan Gao, Sanjay Jain 0001, Wei Li 0050, Frank Stephan 0001
 Inf. Comput.1
2021 Learnability and Positive Equivalence Relations
David R. Bélanger, Ziyuan Gao, Sanjay Jain 0001, Wei Li 0050, Frank Stephan 0001
 LATA1
2015 WKL0 and induction principles in model theory
David R. Bélanger
 Ann. Pure Appl. Log.1
2014 Reverse Mathematics of First-order Theories with Finitely Many Models
abstract
Abstract We examine the reverse-mathematical strength of several theorems in classical and effective model theory concerning first-order theories and their number of models. We prove that, among these, most are equivalent to one of the familiar systems RCA0, WKL0, or ACA0. We are led to a purely model-theoretic statement that implies WKL0 but refutes ACA0 over RCA0.
David R. Bélanger
 J. Symb. Log.1
2009 Structures of Some Strong Reducibilities
David R. Bélanger
 CiE1