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 2022-06-01 to 2026-06-01.)
ArticleCitations
Quantifier elimination for o-minimal structures expanded by a valuational cut12
Two-cardinal ideal operators and indescribability12
The definability of E in self-iterable mice9
Editorial8
Universal proof theory: Feasible admissibility in intuitionistic modal logics7
Foundations of iterated star maps and their use in combinatorics7
Editorial Board7
Amorphous sets and dual Dedekind finiteness7
Zero-dimensional σ-homogeneous spaces6
Uncountable homogeneous structures6
Universally Sacks-indestructible combinatorial families of reals6
An undecidability result for the asymptotic theory of p-adic fields6
Capturing sets of ordinals by normal ultrapowers6
Editorial Board6
Transposition of variables is hard to axiomatize5
Editorial Board5
Forcing the Π35
Computable Scott sentences and the weak Whitehead problem for finitely presented groups5
Unified inverse correspondence for LE-logics5
Can you take Komjath's inaccessible away?5
Classifying different criteria for learning algebraic structures5
Construction schemes: Transferring structures from ω to ω14
Metric spaces are universal for bi-interpretation with metric structures4
Games and Scott sentences for positive distances between metric structures4
Semiconic idempotent logic I: Structure and local deduction theorems4
Groups elementarily equivalent to metabelian Baumslag – Solitar groups and regular bi-interpretability4
Editorial Board4
More about the cofinality and the covering of the ideal of strong measure zero sets4
Cardinal characteristics on bounded generalised Baire spaces3
Eggleston's dichotomy for characterized subgroups and the role of ideals3
Editorial Board3
Editorial Board3
Editorial Board3
Strong standard completeness theorems for S5-modal Łukasiewicz logics3
Absoluteness for the theory of the inner model constructed from finitely many cofinality quantifiers3
Strong reducibilities and set theory3
Failure of the Blok–Esakia Theorem in the monadic setting3
Good projective witnesses3
Classification of ℵ0-categorical C-minimal pure C-sets3
Choice and independence of premise rules in intuitionistic set theory3
Generalized independence3
Peano arithmetic, games and descent recursion3
A Lipschitz determinacy principle equivalent to weak König lemma3
Dense metrizability3
Editorial Board3
Free p-algebras revisited: An algebraic investigation of implication-free intuitionism3
Completeness in local positive logic3
A formalised theorem in the partition calculus3
On categorical structures arising from implicative algebras: From topology to assemblies3
Bi-intermediate logics of trees and co-trees2
A complete axiomatization of infinitary first-order intuitionistic logic over 2
Constructive strong regularity and the extension property of a compactification2
Editorial Board2
Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals2
An explicit Kuznetsov-Muravitsky enrichment2
The unstable formula theorem revisited via algorithms2
Elementary analytic functions in VT2
On middle box products and paracompact cardinals2
Probing the quantitative–qualitative divide in probabilistic reasoning2
Investigations of isotropy and homogeneity of spacetime in first-order logic2
The ghosts of forgotten things: A study on size after forgetting2
General real-valued theories with the Schröder-Bernstein property are stable2
Model-completeness and decidability of the additive structure of integers expanded with a function for a Beatty sequence2
Huge reflection2
A finitary Kronecker's lemma and large deviations in the strong law of large numbers on Banach spaces2
Induced and higher-dimensional stable independence2
Bilinear spaces over a fixed field are simple unstable2
Maximal sets without choice2
Generic torsion-free groups and Rubin actions2
Indestructible supercompactness and level by level inequivalence2
Positive definability patterns2
Finite undecidability in PAC and PRC fields2
Editorial Board2
Borel sets without perfectly many overlapping translations, III2
Elimination of quantifiers for a theory of real closed rings2
Some more results on relativized Chaitin's Ω2
Non-stationary support iterations of Prikry forcings and restrictions of ultrapower embeddings to the ground model2
SOP1, SOP2, and antichain tree property2
First-order reasoning and efficient semi-algebraic proofs2
Forcing with copies of the Rado and Henson graphs2
Constructing the constructible universe constructively2
Projective well orders and coanalytic witnesses2
Green points in the reals2
Set theoretical analogues of the Barwise-Schlipf theorem2
On cardinal invariants related to Rosenthal families and large-scale topology2
A note on μ-stabilizers in ACVF2
Editorial Board2
Algebraic independence of the solutions of the classical Lotka-Volterra system2
Comparing notions of presentability in Polish spaces and Polish groups2
Theories of Frege structure equivalent to Feferman's system T1
The spectrum of independence, II1
Laver forcing and converging sequences1
Measurable cardinals and choiceless axioms1
Cohen-like first order structures1
Vector spaces with a dense-codense generic submodule1
Corrigendum and addendum to: “L-algebras and three main non-classical logics” [Ann. Pure Appl. Log. 173 (7) (2022) 103121]1
Strong minimal pairs in the enumeration degrees1
On the geometric equivalence of algebras1
Fresh function spectra1
Editorial Board1
Editorial Board1
Social welfare relations and irregular sets1
Some simple theories from a Boolean algebra point of view1
Editorial Board1
Countable products and countable direct sums of compact metrizable spaces in the absence of the Axiom of Choice1
Alternating (In)Dependence-Friendly Logic1
Towards characterizing the >ω2-fickle recursively enumerable Turing degrees1
Unreachability of Γ+,1
Admissible extensions of subtheories of second order arithmetic1
Four cardinals and their relations in ZF1
Generic multiplicative endomorphism of a field1
A new model construction by making a detour via intuitionistic theories III: Ultrafinitistic proofs of conservations of 1
Twin procedures, two kinds of variable binding, and two kinds of computation1
Using ultrapowers to compare continuous structures1
Cohen preservation and independence1
Computable Stone spaces1
Probability propagation rules for Aristotelian syllogisms1
μ-clubs of P(λ): Paradise in heaven1
The formal verification of the ctm approach to forcing1
The singleton degrees of the Σ21
Abelian group actions and hypersmooth equivalence relations1
Approachable free subsets and fine structure derived scales1
Editorial Board1
Iterated team semantics for a hierarchy of informational types1
Mutually embeddable models of ZFC1
The relational quotient completion1
A complete invariant system for noetherian BL-algebras and more general L-algebras1
Editorial1
The DeMorganization of a locale1
Admissible rules for six intuitionistic modal logics1
Strong ergodicity phenomena for Bernoulli shifts of bounded algebraic dimension1
Modal logics over lattices1
Editorial Board1
On definable Skolem functions and trichotomy1
Isolated d.c.e. degrees and Σ1 induction1
Coherence in inquisitive first-order logic1
Separating weak α-change and α-change genericity1
The computational content of multidimensional discontinuity1
Concerning Keisler measures over ultraproducts1
Proof-theoretic investigation of λβ-reduction in the simply typed λ-calculus1
Forcing axioms via ground model interpretations1
Computably and punctually universal spaces1
Thick sets and the Central Set Theorem1
Arithmetical completeness theorems for monotonic modal logics1
B-frame duality1
Owings-like theorems for infinitely many colours or finite monochromatic sets1
The Löwenheim-Skolem theorem for Gödel logic1
On minimal flows and definable amenability in some distal NIP theories1
The power of the Binary Value Principle1
Some remarks on weak one-basedness1
Towards logical foundations for probabilistic computation1
The comparison lemma1
Computational complexity of hybrid interval temporal logics1
Kunen the expositor1
Generalisations of stationarity, closed and unboundedness, and of Jensen's □1
Forcing axioms and the uniformization-property1
Some properties of precompletely and positively numbered sets1
Bi-colored expansions of geometric theories1
0.18575382232666