Annals of Pure and Applied Logic

Papers
(The TQCC of Annals of Pure and Applied 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-05-01 to 2025-05-01.)
ArticleCitations
Editorial Board12
Editorial9
Quantifier elimination for o-minimal structures expanded by a valuational cut9
Two-cardinal ideal operators and indescribability8
The definability of E in self-iterable mice7
The number of axioms7
Universal proof theory: Feasible admissibility in intuitionistic modal logics7
Infinitary action logic with exponentiation6
An undecidability result for the asymptotic theory of p-adic fields6
Capturing sets of ordinals by normal ultrapowers6
A characterization of Σ16
Can you take Komjath's inaccessible away?6
Model theory of adeles I6
Editorial Board6
Foundations of iterated star maps and their use in combinatorics5
The isomorphism relation of theories with S-DOP in the generalised Baire spaces5
Dp-finite fields I(B): Positive characteristic5
On Farkas' lemma and related propositions in BISH5
Zero-dimensional σ-homogeneous spaces5
Criteria for exact saturation and singular compactness5
Editorial Board5
Metric spaces are universal for bi-interpretation with metric structures4
Semiconic idempotent logic I: Structure and local deduction theorems4
Finitary unification in locally tabular modal logics characterized4
Editorial Board4
Choice and independence of premise rules in intuitionistic set theory4
Games and Scott sentences for positive distances between metric structures4
Forcing the Π34
Editorial Board4
More about the cofinality and the covering of the ideal of strong measure zero sets4
Games with finitely generated structures3
Editorial Board3
A Lipschitz determinacy principle equivalent to weak König lemma3
Peano arithmetic, games and descent recursion3
Editorial Board3
Editorial Board3
A formalised theorem in the partition calculus3
From axioms to synthetic inference rules via focusing3
Absoluteness for the theory of the inner model constructed from finitely many cofinality quantifiers3
Failure of the Blok–Esakia Theorem in the monadic setting3
Editorial Board3
Classification of ℵ0-categorical C-minimal pure C-sets3
Generalized independence3
On categorical structures arising from implicative algebras: From topology to assemblies3
Dense metrizability3
Computable Scott sentences and the weak Whitehead problem for finitely presented groups3
The ghosts of forgotten things: A study on size after forgetting2
Eggleston's dichotomy for characterized subgroups and the role of ideals2
Universal graphs and functions on ω12
Comparing notions of presentability in Polish spaces and Polish groups2
Huge reflection2
Positive definability patterns2
Constructive strong regularity and the extension property of a compactification2
A note on μ-stabilizers in ACVF2
Forcing with copies of the Rado and Henson graphs2
Topological dynamics and NIP fields2
Elimination of quantifiers for a theory of real closed rings2
Bilinear spaces over a fixed field are simple unstable2
Constructive Ackermann's interpretation2
Investigations of isotropy and homogeneity of spacetime in first-order logic2
Strong reducibilities and set theory2
Cardinality of wellordered disjoint unions of quotients of smooth equivalence relations2
Pure Σ2-elementarity beyond the core2
SOP1, SOP2, and antichain tree property2
Projective well orders and coanalytic witnesses2
Model-completeness and decidability of the additive structure of integers expanded with a function for a Beatty sequence2
Finite undecidability in PAC and PRC fields2
Editorial Board2
Two applications of topology to model theory2
Editorial Board2
Editorial Board2
On the ideal J[κ]2
Editorial Board2
Constructing the constructible universe constructively2
On the structure of Borel ideals in-between the ideals ED and Fin ⊗ Fin in th2
Non-stationary support iterations of Prikry forcings and restrictions of ultrapower embeddings to the ground model2
Induced and higher-dimensional stable independence2
Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals2
Elementary analytic functions in VT2
Taming Koepke's Zoo II: Register machines2
On middle box products and paracompact cardinals2
Probing the quantitative–qualitative divide in probabilistic reasoning2
Continuous L-domains in logical form2
Strong standard completeness theorems for S5-modal Łukasiewicz logics2
Concerning Keisler measures over ultraproducts1
Forcing a □(κ)-like principle to hold at a weakly compact cardinal1
Editorial Board1
The fluted fragment with transitive relations1
The Löwenheim-Skolem theorem for Gödel logic1
Cohen-like first order structures1
Modal logics over lattices1
Generalisations of stationarity, closed and unboundedness, and of Jensen's □1
B-frame duality1
First-order reasoning and efficient semi-algebraic proofs1
Finiteness classes arising from Ramsey-theoretic statements in set theory without choice1
Definable MAD families and forcing axioms1
Probability propagation rules for Aristotelian syllogisms1
Editorial Board1
Set theoretical analogues of the Barwise-Schlipf theorem1
Editorial Board1
The formal verification of the ctm approach to forcing1
Laver forcing and converging sequences1
Fundamental group in o-minimal structures with definable Skolem functions1
On the geometric equivalence of algebras1
A new model construction by making a detour via intuitionistic theories III: Ultrafinitistic proofs of conservations of 1
Strong minimal pairs in the enumeration degrees1
The spectrum of independence, II1
Computably and punctually universal spaces1
Editorial Board1
Countable products and countable direct sums of compact metrizable spaces in the absence of the Axiom of Choice1
Extension of C∞ functions in polynomially bounded o-minimal structure1
The comparison lemma1
Some remarks on the Open Coloring Axiom1
Forcing axioms and the uniformization-property1
Computable Stone spaces1
Towards logical foundations for probabilistic computation1
Bi-intermediate logics of trees and co-trees1
Social welfare relations and irregular sets1
The Hart-Shelah example, in stronger logics1
Fresh function spectra1
On the relationship between mutual and tight stationarity1
Coherence in inquisitive first-order logic1
Corrigendum and addendum to: “L-algebras and three main non-classical logics” [Ann. Pure Appl. Log. 173 (7) (2022) 103121]1
Strong ergodicity phenomena for Bernoulli shifts of bounded algebraic dimension1
Separating weak α-change and α-change genericity1
Iterated team semantics for a hierarchy of informational types1
Admissible extensions of subtheories of second order arithmetic1
Using ultrapowers to compare continuous structures1
Four cardinals and their relations in ZF1
Non-forking and preservation of NIP and dp-rank1
Kunen the expositor1
Editorial1
The differential of probabilistic entailment1
On minimal flows and definable amenability in some distal NIP theories1
Mathias like criterion for the extender based Prikry forcing1
μ-clubs of P(λ): Paradise in heaven1
Editorial Board1
Abelian group actions and hypersmooth equivalence relations1
Editorial Board1
Generic multiplicative endomorphism of a field1
Adequate predimension inequalities in differential fields1
Bi-colored expansions of geometric theories1
Some simple theories from a Boolean algebra point of view1
Denseness results in the theory of algebraic fields1
The Borel complexity of von Neumann equivalence1
On existential definitions of c.e. subsets of rings of functions of characteristic 01
Forcing axioms via ground model interpretations1
Admissible rules for six intuitionistic modal logics1
Arithmetical completeness theorems for monotonic modal logics1
Some properties of precompletely and positively numbered sets1
Measurable cardinals and choiceless axioms1
Theories of Frege structure equivalent to Feferman's system T1
Non-density in punctual computability1
Cohen preservation and independence1
Vector spaces with a dense-codense generic submodule1
A complete axiomatization of infinitary first-order intuitionistic logic over 1
Computational complexity of hybrid interval temporal logics1
Towards characterizing the >ω2-fickle recursively enumerable Turing degrees1
The fixed-point property for represented spaces1
0.047316789627075