CoChat
Sign Up
Cited by 215Logic, Reasoning, and KnowledgePhilosophy and Theoretical ScienceAdvanced Algebra and Logic

The DOI matches its Crossref record.

Display logic

Belnap, Nuel D.·1982·Journal of Philosophical Logic
DOI 10.1007/bf00284976
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1007/bf00284976

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Still being checked.

Research works printed but not linked: 29

  1. Anderson, A. R. and Belnap, N. D. Jr., ‘Modalities in Ackermann's “rigorous implication”,’ Journal of Symbolic Logic 24 (1959), 107–111. · DOI
  2. Anderson, A. R. and Belnap, N. D. Jr., Entailment, Princeton University Press, Princeton, N.J., 1975.
  3. Bacon, John B., ‘Being and existence: two ways of formal ontology’, Ph. D. thesis, Yale University, New Haven, 1966.
  4. Belnap, N. D. Jr. and Dunn, J. M., ‘Entailment and the disjunctive syllogism’, In Contemporary Philosophy. A New Survey, Martinus Nijhoff, The Hague, Boston, London, 1981, pp. 337–366.
  5. Belnap, Nuel D. Jr., Gupta, Anil, and Dunn, J. Michael, ‘A consecution calculus for positive relevant implication with necessity’, Journal of Philosophical Logic 9 (1980), 343–362. · DOI
  6. Curry, H. B., Foundations of Mathematical Logic, McGraw-Hill, New York, 1963.
  7. Curry, Haskell B. and Feys, Robert, Combinatory Logic, North-Holland, Amsterdam, 1958.
  8. Dunn, J. Michael, ‘A “Gentzen System” for positive relevant implication’, Journal of Symbolic Logic 38 (1973), 356–357.
  9. Dunn, J. Michael, ‘Consecution formulation of positive R with cotenability and t', Sect. 28.5 of Entailment, vol. 1, by A. R. Anderson and N. D. Belnap, Jr.
  10. Dunn, J. Michael, ‘Intuitive semantics for first-degree entailments and “coupled trees”’, Philosophical Studies 29 (1976), 149–168. · DOI
  11. Fine, K, ‘Failures of the interpolation theorem in quantified modal logic’, Journal of Symbolic Logic 44 (1979), 201–205. · DOI
  12. Fitch, Frederick, Symbolic Logic, The Ronald Press, New York, 1952.
  13. Gentzen, Gerhard, ‘Untersuchungen über das Logische Schliessen’, Mathematische Zeitschrift 39 (1934), 176–210, 405–431. English translation by M. E. Szabo [‘Investigations into logical deduction’] in The Collected Papers of Gerhard Gentzen, M. E. Szabo (ed.), North-Holland, Amsterdam, pp. 68–131. · DOI
  14. Hacking, Ian, ‘What is logic?’ The Journal of Philosophy 76 (1979), 285–318. · DOI
  15. Hughes, G. E. and Cresswell, M. J., An Introduction to Modal Logic, Methuen, London 1968.
  16. Kripke, Saul A, ‘Semantical analysis of modal logic II’, in the Theory of Models, Henkin, L. and Tarski, A. (eds.), North-Holland, Amsterdam, 1965.
  17. Lemmon, F. J., ‘New foundations for Lewis modal systems’, Journal of Symbolic Logic 22 (1957), 176–186. · DOI
  18. McRobbie, M. A., ‘A proof theoretic investigation of relevant and modal logics’, Ph. D. Thesis, Australion National University, 1979.
  19. McRobbie, M. A. and Belnap, N. D. Jr., ‘Relevant analytic tableaux’, Studia Logica 38 (1979), 187–200. · DOI
  20. Meyer, Robert K., ‘A general Gentzen system for implicational calculi’, The Relevance Logic Newsletter 1 (1976), 189–201.
  21. Meyer, Robert K. and Routley, Richard, ‘Algebraic analysis of entailment (I)’, Logique et analyse, n.s. 15 (1972), 407–428.
  22. Meyer, Robert K. and Routley, Richard, ‘Classical relevant logics’, Studia Logica 32 (1973), 51–66. · DOI
  23. Meyer, Robert K. and Routley, Richard, ‘Classical relevant logics II’, Studia Logica 33 (1974), 183–194. · DOI
  24. Minć, G. E. ‘Teorema ob u cstranimosti secenia dla relevanthyh logik’, in Issledovania po konst ruktivnoj matematike i matematiceskoj logike V, J. V. Matijasevic and O. A. Sisenko, (eds.), Izdatel 'stvo ‘Nauka’, 1972, pp. 90–97. English translation: ‘Cut-elimination theorem in relevant logics’, Journal of Soviet Mathematics 6 (1976), 422–428.
  25. Ohnishi, M. and Matsumoto, K., ‘A system for strict implication’, Proceedings of the Symposium on the Foundations of Mathematics, Katadu, Japan, 1962, pp. 98–108.
  26. Prior, A. N., Formal Logic, Oxford University Press, Oxford, 1955.
  27. Saarinen, Esa, ‘Backwards-Looking operators in tense logic and in natural language’, in Essays on Mathematical and Philosophical Logic, J.Hintikka, I.Niniluoto, and E.Saarinen (eds.), D. Reidel, Dordrecht, Holland, 1978, pp. 341–367.
  28. Sato, M., ‘A cut-free Gentzen-type system for the modal logic S5’, Journal of Symbolic Logic 45 (1980), 67–84. · DOI
  29. Zeman, J. Jay, Modal Logic: The Lewis-Modal Systems, Oxford University Press, Oxford, 1973.

Cited by

Sorted by citations

See all 215

Metadata

Authors
Belnap, N. D.
Affiliations
University of Pittsburgh (US)
Corresponding author
Belnap, Nuel D.
Venue
Journal of Philosophical Logic
Publisher
Springer Science and Business Media LLC
Published
1982-11
Volume
11
Issue
4
Pages
375-417
ISSN
  • 0022-3611 (ISSN-L)
  • 1573-0433
DOI
10.1007/bf00284976
OpenAlex
W4248156396
Cited by
215
References
0
Citations by year
2026: 6 · 2025: 6 · 2024: 9 · 2023: 8 · 2022: 5 · 2021: 7 · 2020: 6 · 2019: 9 · 2018: 7 · 2017: 9 · 2016: 16 · 2015: 8 · 2014: 11 · 2013: 8 · 2012: 4
FWCI
0.62
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
Journal of Philosophical Logic (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
  • Social Sciences › Arts and Humanities › Philosophy › Philosophy and Theoretical Science
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Algebra and Logic
Keywords
display logic, sequent calculus, proof theory

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review