ISSN: 0029-4527

Journal Home

Journal Guideline

Notre Dame Journal of Formal Logic Q2 Unclaimed

Duke University Press United States

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

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

Type: Journal

Type of Copyright:

Languages:

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Logic (Q2)

Price

2040 €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

0,581

SJR Impact factor

33

H Index

21

Total Docs (Last Year)

93

Total Docs (3 years)

442

Total Refs

57

Total Cites (3 years)

93

Citable Docs (3 years)

0.65

Cites/Doc (2 years)

21.05

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

Early Intervention in Psychiatry Q2
Journal of Neural Transmission Q2
Acta Neuropsychiatrica Q2
Learning and Memory Q2
International Journal of Hyperthermia Q2

Compare this journals

Aims and Scope

Best articles by citations

A constructivism based on classical truth.

Isomorphisms of finite cylindric set algebras of characteristic zero.

Types in Abstract Elementary Classes

The substitution interpretation and the expressive power of intensional logics.

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

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

On Interpretations of Arithmetic and Set Theory

There Are No Maximal Low D.C.E. Degrees

Are we finite?

A Simple Embedding of T into Double S5

Nonclassical syllogistic inference and the method of resolution.

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

SHOW MORE ARTICLES

Equivalence of Syllogisms

Realizing Levels of the Hyperarithmetic Hierarchy as Degree Spectra of Relations on Computable Structures

Argument deletion without events.

The dual Cantor-Bernstein theorem and the partition principle.

Ultrasheaves and Double Negation

What evidence is there that 2^65536 is a natural number?

Frege's Proof of Referentiality

Remarks on strong nonstructure theorems.

A Note on Generic Projective Planes

Embedding and Coding below a 1-Generic Degree

Significant parts and identity of artifacts.

The elementary theory of the natural lattice is finitely axiomatizable.