OOIR: Observatory of International Research

Papers

(The TQCC of Archive for Mathematical Logic is 1. 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 2021-11-01 to 2025-11-01.)

Article	Citations
Implicit recursion-theoretic characterizations of counting classes	5
The Nikodym property and filters on $$\omega $$	5
Correction: Symétrons et K-boucles $$\omega$$-stables	5
Equivalence of generics	4
Independent families and some notions of finiteness	4
The structure of $$\kappa $$-maximal cofinitary groups	4
Generalization of Shapiro’s theorem to higher arities and noninjective notations	4
Nondefinability results with entire functions of finite order in polynomially bounded o-minimal structures	3
Approximate categoricity in continuous logic	3
Filter pairs and natural extensions of logics	3
Variations on the Feferman-Vaught theorem, with applications to $$\prod _p \mathbb {F}_p$$	3
Relativized Galois groups of first order theories over a hyperimaginary	3
Algebraic semantics for weak subintuitionistic logic WF	3
Antichains of copies of ultrahomogeneous structures	2
Conjunctions of exponential diophantine equations over $${\mathbb {Q}}$$	2
Correction to: Generalization of Shapiro’s theorem to higher arities and noninjective notations	2
The algebra of ordinary discourse. On the semantics of Cooper’s logic	2
Around accumulation points and maximal sequences of indiscernibles	2
Undecidability of indecomposable polynomial rings	2
On the isomorphism problem for some classes of computable algebraic structures	2
Computable approximations of a chainable continuum with a computable endpoint	2
L-domains as locally continuous sequent calculi	2
Complexity of $$\Sigma ^0_n$$-classifications for definable subsets	2
Disjunctive logic programs, answer sets, and the cut rule	2
Between Hilbert and Gentzen: four-valued consequence systems and structural reasoning	2

Reverse mathematics and semisimple rings	2
Monadic $$k\times j$$-rough Heyting algebras	2
Computable scott sentences for quasi–Hopfian finitely presented structures	2
Siblings of direct sums of chains	1
An alternative proof of the Hilbert-style axiomatization for the $$\{\wedge ,\vee \}$$-fragment of classical propositional logic	1
Tameness in generalized metric structures	1
Pathology of submeasures and $$F_{\sigma }$$ ideals	1
$$sQ_1$$-degrees of computably enumerable sets	1
Positive logics	1
On Hilbert’s “geometric” tenth problem for odd characteristic function fields	1
The construction principle and non homogeneity of uncountable relatively free groups	1
Countable homogeneous ordered bipartite graphs	1
Extending antichains in the poset $$\langle [\omega ]^{<\omega },\subseteq \rangle $$	1
Free subsets in internally approachable models	1
On two consequences of CH established by Sierpiński. II	1
Mathias and silver forcing parametrized by density	1
Slender trees and the approximation property	1
On the non-measurability of $$\omega $$-categorical Hrushovski constructions	1
Towards a homotopy domain theory	1
Random structures and automorphisms with a single orbit	1
Separablilty of metric measure spaces and choice axioms	1
Compositional truth with propositional tautologies and quantifier-free correctness	1
Essential hereditary undecidability	1
Combinatorial properties and dependent choice in symmetric extensions based on Lévy collapse	1
Turing degrees and randomness for continuous measures	1
Bounded forcing axioms and weak genericity	1
Preservation properties for products and sums of metric structures	1
Bounded symbiosis and upwards reflection	1
An algebraic investigation of Linear Logic	1
Spectral MV-algebras and equispectrality	1
Involutive Uninorm Logic with Fixed Point enjoys finite strong standard completeness	1
Restricted analytic valued fields with partial exponentiation	1
Models of $${{\textsf{ZFA}}}$$ in which every linearly ordered set can be well ordered	1
Degrees of relations on canonically ordered natural numbers and integers	1
A characterization of strongly computable finite factorization domains	1