Journal of Mathematical Logic

Papers
(The TQCC of Journal of Mathematical Logic is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-11-01 to 2024-11-01.)
ArticleCitations
An unpublished theorem of Solovay on OD partitions of reals into two non-OD parts, revisited8
Inner models from extended logics: Part 15
Sigma-Prikry forcing II: Iteration Scheme5
Simultaneously vanishing higher derived limits without large cardinals5
From noncommutative diagrams to anti-elementary classes5
Logical metatheorems for accretive and (generalized) monotone set-valued operators5
Generic expansions by a reduct4
The Ramsey theory of Henson graphs4
The Biggest Five of Reverse Mathematics4
Maximal almost disjoint families, determinacy, and forcing3
The domination monoid in o-minimal theories3
Higher indescribability and derived topologies3
The two halves of disjunctive correctness3
Controlling cardinal characteristics without adding reals3
On the antichain tree property3
Canonical fragments of the strong reflection principle3
The weakness of the pigeonhole principle under hyperarithmetical reductions3
Structural reflection, shrewd cardinals and the size of the continuum3
Compactness and guessing principles in the Radin extensions2
A negative solution of Kuznetsov’s problem for varieties of bi-Heyting algebras2
Reduction games, provability and compactness2
Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics2
Hindman’s theorem in the hierarchy of choice principles2
Interpolative fusions2
Complexity of distances: Theory of generalized analytic equivalence relations2
On uniform definability of types over finite sets for NIP formulas2
Equivalence relations and determinacy2
Pseudofinite groups and VC-dimension2
Forcing the Σ31-separation property2
The large cardinal strength of weak Vopenka’s principle2
Iterability for (transfinite) stacks2
New jump operators on equivalence relations2
0.032438993453979