Journal list Promote Sponsor
verified SJR 0,908 · Q1 • database Scopus / SJR & Web of Science indexed
Annals of Pure and Applied Logic
Netherlands · Elsevier B.V.
workspace_premium Q1 — Logic lock Subscription

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.

ISSN: 0168-0072
Publisher: Elsevier B.V.
Category: Logic
Indexation: verifiedScopus / SJR verifiedWeb of Science
open_in_new Portal NPD menu_book Guidelines NPD
schedule CountryOfPapers database fields
SJR Impact Factor trending_up
0,908 Q1
H-index 53
Acceptance rate pie_chart
31%
Source Acceptance_Rate
Time to publication hourglass_top
NPD
Field NPD
Publication cost (APC) payments
2.454 € Subscription
Non-OA path 0 €

Metrics

Scimago and CountryOfPapers database fields

Scopus / SJR Web of Science

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 €

shield Researcher voice

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.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims
rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.
User
* Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Complexity of reals in inner models of set theory

View more

What is the world of mathematics?

View more

Editorial

View more

Dual realizability in symmetric logic

View more

Deterministic automata simulation, universality and minimality

View more

Descent and duality

View more

Definitional equivalence and algebraizability of generalized logical systems

View more

Decidable Kripke models of intuitionistic theories

View more

Decidability without mathematics

View more

Contraction-elimination for implicational logics

View more

Computational inductive definability

View more

Computational complexity of the semantics of some natural language constructions

View more
SHOW MORE ARTICLES

Computational complexity of quantifier-free negationless theory of field of rational numbers

View more

A constructive game semantics for the language of linear logic

View more

Classification theory through stationary logic

View more

Characterization of realizable space complexities

View more

Bounded arithmetic, proof complexity and two papers of Parikh

View more

Approximation methods in inductive inference

View more

An intensional fixed point theory over first order arithmetic

View more

A(nother) characterization of intuitionistic propositional logic

View more

A simple propositional S5 tableau system

View more

A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees

View more

A model and its subset: the uncountable case

View more

A general condition for collapse results

View more

FAQs