Write in a clean editor, then format for Bulletin of Symbolic Logic in one click — DocuGuru applies the official Cambridge University Press template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
Bulletin of Symbolic Logic is a peer-reviewed journal published by Cambridge University Press, covering Logic, Reasoning, and Knowledge, Computability, Logic, AI Algorithms, Advanced Algebra and Logic.
| Publisher | Cambridge University Press |
|---|---|
| Reference style | Numbered Numbered — [1], [2] in the text [1] A. Smith, B. Jones, and C. Lee, A representative article title, Bulletin of Symbolic Logic 12 (2023) 45–58.
Formats any DOI in the closest standard style — Bulletin of Symbolic Logic has no published style definition, so this is an approximation. No sign-up. |
| Publishes research in | Logic, Reasoning, and Knowledge Computability, Logic, AI Algorithms Advanced Algebra and Logic Advanced Topology and Set Theory Diverse Scientific and Economic Studies |
| ISSN | 1079-8986 |
| Citation impact (2-yr) | 0.28 |
| h-index | 60 |
| i10-index | 254 |
| Total citations | 13,554 |
| Top institutions publishing here | Carnegie Mellon University |
| Journal website | journals.cambridge.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Abstract We introduce a logic BI in which a multiplicative (or linear) and an additive (or intuitionistic) implication live side-by-side. The propositional version of BI arises from an analysis of the proof-theoretic relationship between conjunction and implication; it can be viewed as a merging of intuitionistic logic and multiplicative intuitionistic linear logic. The naturality of…
Abstract In 1933 Gödel introduced a calculus of provability (also known as modal logic S4 ) and left open the question of its exact intended semantics. In this paper we give a solution to this problem. We find the logic LP of propositions and proofs and show that Gödel's provability calculus is nothing but the…
Abstract We identify the computational complexity of the satisfiability problem for FO 2 , the fragment of first-order logic consisting of all relational first-order sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity of its decision problem has not been pinpointed so…
Abstract We consider the informal concept of “computability” or “effective calculability” and two of the formalisms commonly used to define it, “( Turing ) computability ” and “( general ) recursiveness ”. We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were…
PART I. PERSPECTIVE CHAPTER 1. WHAT IS SO INTERESTING ABOUT MATHEMATICS (FOR PHILOSOPHER)? ATTRACTION - OF OPPOSITES? PHILOSOPHY AND MATHEMATICS: CHICKEN OR EGG? NATURALISM AND MATHEMATICS CHAPTER 2. A POTPOURRI OF QUESTIONS AND ATTEMPTED ANSWERS NECESSITY AND A PRIORI KNOWLEDGE GLOBAL MATTERS: OBJECTS AND OBJECTIVITY THE MATHEMATICAL AND THE PHYSICAL LOCAL MATERS: THEOREMS, THEORIES, AND…
