Annals of Pure and Applied Logic
Annals of Pure and Applied Logic is a journal indexed in SJR in Logic with an H index of 53. It has a price of 2454 €. It has an SJR impact factor of 0,908 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 0,908.
Metrics
Scimago and CountryOfPapers database fields
SJR Impact
0,908
H-index
53
Docs (year)
83
Docs 3y
232
Total refs
2522
Cites 3y
189
Citable 3y
230
Cites/Doc 2y
0.76
Ref/Doc
30.39
Immediate OA
2454 €
Embargoed OA
NPD
Non OA / Submission
0 €
Name good journals. Call out predatory ones.
Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.
Researcher reviews
Best articles by citations
Complexity of reals in inner models of set theory
View moreWhat is the world of mathematics?
View moreEditorial
View moreDual realizability in symmetric logic
View moreDeterministic automata simulation, universality and minimality
View moreDescent and duality
View moreDefinitional equivalence and algebraizability of generalized logical systems
View moreDecidable Kripke models of intuitionistic theories
View moreDecidability without mathematics
View moreContraction-elimination for implicational logics
View moreComputational inductive definability
View moreComputational complexity of the semantics of some natural language constructions
View moreComputational complexity of quantifier-free negationless theory of field of rational numbers
View moreA constructive game semantics for the language of linear logic
View moreClassification theory through stationary logic
View moreCharacterization of realizable space complexities
View moreBounded arithmetic, proof complexity and two papers of Parikh
View moreApproximation methods in inductive inference
View moreAn intensional fixed point theory over first order arithmetic
View moreA(nother) characterization of intuitionistic propositional logic
View moreA simple propositional S5 tableau system
View moreA necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
View moreA model and its subset: the uncountable case
View moreA general condition for collapse results
View more