verified SJR 0,493 · Q2 • database Scopus / SJR & Web of Science indexed

United States · Duke University Press

workspace_premium Q2 — Logic lock Subscription Unclaimed

Notre Dame Journal of Formal Logic

Notre Dame Journal of Formal Logic is a journal indexed in SJR in Logic with an H index of 35. It has a price of 2040 €. It has an SJR impact factor of 0,493 and it has a best quartile of Q2. It has an SJR impact factor of 0,493.

ISSN: 0029-4527

Editorial: Duke University Press

Category: Logic

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,493 Q2

H-index 35

Tasa de Aceptación pie_chart

36%

Fuente Acceptance_Rate

Tiempo a publicación hourglass_top

NPD

Campo Sin dato

Coste de Publicación (APC) payments

2.040 € Subscription

Ruta Non-OA 0 €

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

0,493

H-index

Docs (year)

Docs 3y

Total refs

531

Cites 3y

Citable 3y

Cites/Doc 2y

0.45

Ref/Doc

25.29

Immediate OA

2040 €

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

A tableau style proof system for two paraconsistent logics.

Zermelo, reductionism, and the philosophy of mathematics.

Closed categories and categorical grammar.

BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas.

Book Review: Kurt G'del. Collected Works , Volumes IV and V

Book Review: Kit Fine. The Limits of Abstraction

Book Review: Geraldine Brady. From Peirce to Skolem:\ \ A Neglected Chapter in the History of Logic

Argument deletion without events.

Are we finite?

Apodeictic ecthesis.

An equivalent of the axiom of choice in finite models of the powerset axiom.

An arithmetical completeness theorem for pre-permutations.

SHOW MORE ARTICLES

A variable-free logic for mass terms.

'Good' defined in terms of 'better'.

A structurally complete fragment of relevant logic.

A single axiom for the mereological notion of proper part.

A Simple Embedding of T into Double S5

A parity-based Frege proof for the symmetric pigeonhole principle.

A Note on Generic Projective Planes

A note on a problem concerning the axiomatic foundations of mereology.

A functional partial semantics for intensional logic.

A Diophantine definition of rational integers over some rings of algebraic numbers.

A constructivism based on classical truth.

A Characterization of Permutation Models in Terms of Forcing

FAQS

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