ISSN: 0022-4812

Journal Guideline

Journal of Symbolic Logic Q1 Unclaimed

Cambridge University Press United Kingdom

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

Journal of Symbolic Logic is a journal indexed in SJR in Philosophy and Logic with an H index of 46. It has a price of 1626,56 €. It has an SJR impact factor of 0,742 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 0,742.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Categories: Logic (Q1) Philosophy (Q1)

Price

1626,56 €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

0,742

SJR Impact factor

46

H Index

117

Total Docs (Last Year)

228

Total Docs (3 years)

2823

Total Refs

167

Total Cites (3 years)

228

Citable Docs (3 years)

0.7

Cites/Doc (2 years)

24.13

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

Psychological Bulletin Q1
Journal of Econometrics Q1
Psychological Methods Q1
The Philosophical Review Q1
Psychological Review Q1

Compare this journals

Aims and Scope

Best articles by citations

On systems containing Aristotle's thesis

An informal exposition of proofs of Godel's theorems and Church's theorem

Hans G. Herzberger. The truth-conditional consistency of natural languages. The journal of philosophy, vol. 64 (1967), pp. 29-35.

Hans Hermes. Zur Geschichte der mathematischen Logik und Grundlagenforschung in den letzten funfundsiebzig Jahren. Jahresbericht der Deutschen Mathematiker-Vereinigung, vol. 68 (1966), pp. 75-96.

Erwin Engeler. A reduction-principle for infinite formulas. Mathematische Annalen, vol. 151 (1963), pp. 296-301.

The unsolvability of the Godel class with identity

The optimality of induction as an axiomatization of arithmetic

A P-MINIMAL STRUCTURE WITHOUT DEFINABLE SKOLEM FUNCTIONS

Ann Yasuhara. A remark on Post normal systems. Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 167-171.

Fred J. Sansone. On order-preserving extensions to regressive isols. The Michigan mathematical journal, vol. 13 (1966), pp. 353-355.

Some calculi with strong negation primitive

Joachim Jungius. Logica Hamburgensis. Edited by Rudolf W. Meyer. J. J. Augustin, Hamburg1957, XXXIX + 673 pp.

SHOW MORE ARTICLES

Double-exponential inseparability of Robinson subsystem Q+

S. A. Cook and Hao Wang. Characterizations of ordinal numbers in set theory. Mathematische Annalen, vol. 164 (1966), pp. 1-25.

Cardinal characteristics on graphs

Invariant measures on groups satisfying various chain conditions

Benign cost functions and lowness properties

G. Fuhrken. Skolem-type normal forms for first-order languages with a generalized quantifier. Fundamenta mathematicae, vol. 54 (1964), pp. 291-302. - R. L. Vaught. The completeness of logic with the added quantifier "there are uncountably many."Funda

G. H. R. Parkinson. Introduction. Leibniz, Logical papers, A selection translated and edited with an introduction by G. H. R. Parkinson, Clarendon Press, Oxford1966, pp. ix-Ixv. - Gottfried Wilhelm Leibniz. From Of the art of combination (1666). Engl

Tsutomu Hosoi. Algebraic proof of the separation theorem on classical propositional calculus. Proceedings of the Japan Academy, vol. 42 (1966), pp. 67-69. - Tsutomu Hosoi. Algebraic proof of the separation theorem on Dummett's LC. Proceedings of the

Tsutomu Hosoi. The separation theorem on the classical system. Journal of the Faculty of Science, University of Tokyo, section I, Mathematics, astronomy, physics, chemistry, vol. 12 part 2 (1966), pp. 223-230.

Roman Sikorski. On extensions and products of Boolean algebras. Fundamenta mathematicae, vol. 53 no. 1 (1963), pp. 99-116.

The club principle and the distributivity number

Computability of Fra?Øsse limits