verified SJR 0,689 · Q1 • database Scopus / SJR & Web of Science indexed

United States · Springer New York

workspace_premium Q1 — Philosophy lock_open Open Access Unclaimed

Archive for Mathematical Logic

Archive for Mathematical Logic is a journal indexed in SJR in Philosophy and Logic with an H index of 33. It has a price of 2190 €. It has an SJR impact factor of 0,689 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 0,689.

ISSN: 0933-5846

Editorial: Springer New York

Category: Philosophy

Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Portal NPD menu_book Guidelines NPD

schedule Datos CoP · solo campos en BD

SJR Impact Factor trending_up

0,689 Q1

H-index 33

Tasa de Aceptación pie_chart

35%

Fuente Acceptance_Rate

Tiempo a publicación hourglass_top

NPD

Campo Sin dato

Coste de Publicación (APC) payments

2.190 € Open Access

Ruta Non-OA 0 €

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

0,689

H-index

Docs (year)

Docs 3y

146

Total refs

1175

Cites 3y

Citable 3y

145

Cites/Doc 2y

0.46

Ref/Doc

19.26

Immediate OA

2190 €

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.

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID * * Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Analytic combinatory calculi and the elimination of transitivity

Weaker variants of infinite time Turing machines

Dependent choice as a termination principle

Completeness theorem for propositional probabilistic models whose measures have only finite ranges

Completeness of indexed ?-calculus

Compact representations of BL-algebras

Combinatorics of first order structures and propositional proof systems

Coding lemmata in L

Bounded truth table does not reduce the one-query tautologies to a random oracle

Bounded forcing axioms as principles of generic absoluteness

Birkhoff variety theorem and fuzzy logic

Barwise's information frames and modal logics

SHOW MORE ARTICLES

Antichains of perfect and splitting trees

A comparison of two systems of ordinal notations

An intuitionistic proof of Kruskal?s theorem

Adjoining cofinitary permutations (II)

Adding Skolem functions to simple theories

Absorbing the structural rules in the sequent calculus with additional atomic rules

A small ultrafilter number at smaller cardinals

A proof-theoretic analysis of collection

A notion of rank in set theory without choice

A note on end extensions

A note on a theorem of Kanovei

A jump inversion theorem for the enumeration jump

FAQS

In Country of Papers you can find SJR impact factor and other metrics to help you decide on a Journal.