Annals of Pure and Applied Logic

Papers
(The TQCC of Annals of Pure and Applied 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-04-01 to 2024-04-01.)
ArticleCitations
Pincherle's theorem in reverse mathematics and computability theory19
The theory of ceers computes true arithmetic12
A microscopic approach to Souslin-tree construction, Part II9
Completion of choice8
The full basis theorem does not imply analytic wellordering8
Reflection algebras and conservation results for theories of iterated truth8
Derivatives of normal functions in reverse mathematics8
Quantifier-free epistemic term-modal logic with assignment operator7
Epimorphism surjectivity in varieties of Heyting algebras6
Towards the entropy-limit conjecture6
Intuitionistic fixed point logic6
Characterizations of the weakly compact ideal on Pλ5
Continuous L-domains in logical form5
Join-completions of partially ordered algebras5
Dp-finite fields I(A): The infinitesimals5
Dp-finite fields I(B): Positive characteristic5
Infinitary action logic with exponentiation5
Computable irrational numbers with representations of surprising complexity5
Local collection and end-extensions of models of compositional truth5
Tukey order, calibres and the rationals5
Finiteness classes arising from Ramsey-theoretic statements in set theory without choice4
Quantum set theory: Transfer Principle and De Morgan's Laws4
Taming Koepke's Zoo II: Register machines4
L-algebras and three main non-classical logics4
Filter-linkedness and its effect on preservation of cardinal characteristics4
Small cardinals and small Efimov spaces4
Long games and σ-projective sets4
From axioms to synthetic inference rules via focusing4
Expander construction in VNC14
Superstability, noetherian rings and pure-semisimple rings4
Embedding causal team languages into predicate logic3
A topological zero-one law and elementary equivalence of finitely generated groups3
Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals3
Small models, large cardinals, and induced ideals3
Sets in Prikry and Magidor generic extensions3
Ax-Schanuel and strong minimality for the j-function3
Bilattice logic of epistemic actions and knowledge3
Completeness theorems for σ–additive probabilistic semantics3
Games with finitely generated structures3
Simple-like independence relations in abstract elementary classes3
Logics of intuitionistic Kripke-Platek set theory3
Computability of pseudo-cubes3
Probabilistic characterisation of models of first-order theories3
Weaker cousins of Ramsey's theorem over a weak base theory3
Admissibility of Π2-Inference Rules: interpolation, model completion, and contact algebras3
Independence over arbitrary sets in NSOP1 theories3
Mathias like criterion for the extender based Prikry forcing3
Embeddings between well-orderings: Computability-theoretic reductions3
Punctual definability on structures3
An approach to stochastic processes via non-classical logic3
Model theory of adeles I3
Intermediate models of Magidor-Radin forcing-Part II3
Separating families and order dimension of Turing degrees3
Computable Stone spaces3
On Kripke completeness of modal predicate logics around quantified K53
Krull dimension in set theory2
Reflection principles and second-order choice principles with urelements2
Reasoning with belief functions over Belnap–Dunn logic2
The FAN principle and weak König's lemma in herbrandized second-order arithmetic2
Diagonal supercompact Radin forcing2
A characterisation of elementary fibrations2
Infinitesimal analysis without the Axiom of Choice2
Herbrand's theorem as higher order recursion2
Hilbert-style axiomatization of first-degree entailment and a family of its extensions2
Is cut-free logic fit for unrestricted abstraction?2
On the ideal J[κ]2
Some remarks on the Open Coloring Axiom2
A characterization of generalized existential completions2
Non-stationary support iterations of Prikry forcings and restrictions of ultrapower embeddings to the ground model2
On the structure of certain valued fields2
Almost o-minimal structures and X-structures2
Non-forking and preservation of NIP and dp-rank2
Univalent polymorphism2
On expansions of (Z,+,0)2
Strongly compact cardinals and the continuum function2
Modal extension of ideal paraconsistent four-valued logic and its subsystem2
Beth definability and the Stone-Weierstrass Theorem2
Topological dynamics and NIP fields2
Algebraic properties of the first-order part of a problem2
The Gödel-McKinsey-Tarski embedding for infinitary intuitionistic logic and its extensions2
Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence2
Some constructions of ultrafilters over a measurable cardinal2
Open core and small groups in dense pairs of topological structures2
The spectrum of independence, II2
An undecidability result for the asymptotic theory of p-adic fields2
A forcing axiom for a non-special Aronszajn tree2
Cardinality of wellordered disjoint unions of quotients of smooth equivalence relations2
Bilinear spaces over a fixed field are simple unstable2
Frame definability in finitely valued modal logics2
Realisability for infinitary intuitionistic set theory2
On intermediate inquisitive and dependence logics: An algebraic study2
Preserving levels of projective determinacy by tree forcings2
|˜2
Fundamental group in o-minimal structures with definable Skolem functions2
Arithmetical completeness theorems for monotonic modal logics2
0.035224914550781