Skip to main content

Part of the book series: Outstanding Contributions to Logic ((OCTR,volume 26))

Abstract

In this chapter, Kit Fine and Errol Martin provide a formal account of non-circular reasoning, i.e. of reasoning in which the conclusion of an argument is not somehow presupposed in its premises. Martin (along with R. Meyer) had previously shown that the implicational system \(\textbf{P}\!\mathbf {-W}\) does not contain any theorems of the form \(A \rightarrow A\). Fine and Martin then extend this result to systems that also contain conjunction.

This paper had its origin in some lectures that Kit Fine gave to the Automatic Reasoning Project at the Australian National University in 1990. Errol Martin reworked and simplified Fine’s proofs and the two then collaborated in seeing how the results might be extended to other systems. For a number of reasons, their work was never put in final form and it is largely thanks to Errol Martin that it has now been brought to fruition.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 129.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We might note that similar issues arise in the more recent discussion of ground, as in Fine (2012), for example.

  2. 2.

    Alternative syntactical approaches—which do not, however, extend \(\textbf{P}\!\mathbf {-W}\) with additional connectives—were presented by Kron in Aleksander Kron (1985), Komori in Komori (1993), Nagayama in Nagayama (1999), and Hirokawa, Komori, and Nagayama in Sachio Hirokawa et al. (2000).

  3. 3.

    Again, we may note that a related distinction between explanatory and non-explanatory arguments has been made in the literature on ground [as in Litland (2018)].

  4. 4.

    This is not an uncommon approach in the literature on sequent calculi. A general framework for such approaches is suggested in Sect. 33.4 of Fine (2016b).

  5. 5.

    This is therefore a departure from the idea that a circular argument is one in which the content of the conclusion is contained in the content of the premisses, where containment is understood along the lines of Angell (1977) and Fine (2016a).

  6. 6.

    See Church (1956), Sect. 11: In this abbreviated notation omitted parentheses are restored by a convention of association to the left, except that dot may replace a left parenthesis and the matching right parenthesis is restored at the end of the part of the formula in which the dot occurs. Thus, for example, \(A \rightarrow B \rightarrow \cdot C \rightarrow D\) abbreviates \(((A\rightarrow B) \rightarrow (C\rightarrow D))\).

  7. 7.

    The lemma is also a corollary of Kruskal’s Theorem, Kruskal (1960).

  8. 8.

    The style of the proof of this lemma is essentially that of the similar theorem for the merge proof system of Anderson and Belnap [see Anderson and Belnap (1975), Sect. 7.5]; only a sketch is given here.

References

  • Anderson, A. R., & Belnap, N. D., Jr. (1975). Entailment: The logic of relevance and necessity (Vol. 1). Princeton University Press.

    Google Scholar 

  • Angell, R. B. (1977). Three systems of first degree entailment (abstract). Journal of Symbolic Logic, 47, 147.

    Google Scholar 

  • Church, A. (1956). Introduction to mathematical logic. Princeton University Press.

    Google Scholar 

  • Fine, K. (2012). The pure logic of ground. Review of Symbolic Logic, 5(1), 1–25.

    Article  Google Scholar 

  • Fine, K. (2016). Angellic content. Journal of Philosophical Logic, 45(2), 199–226.

    Article  Google Scholar 

  • Fine, K. (2016). Williamson on Fine on Prior on the reduction of possibilist discourse. Canadian Journal of Philosophy, 46(4–5), 548–570.

    Article  Google Scholar 

  • Hirokawa, S., Komori, Y., & Nagayama, M. (2000). A lambda proof of the P-W theorem. Journal of Symbolic Logic, 65(4), 1841–1849, 12.

    Google Scholar 

  • Komori, Y. (1993). Syntactical investigations into \(BI\) logic and \(BB^{\prime }I\) logic. Studia Logica, 54, 397–416.

    Google Scholar 

  • Kron, A. (1985). A constructive proof of a theorem in relevance logic. Zeitschrift f. math. Logik und Grundlagen d. Math., 31, 423–430.

    Google Scholar 

  • Kruskal, J. B. (1960). Well-quasi-ordering, the tree theorem, and Vazsonyi’s conjecture. Transactions of the American Mathematical Society, 95, 210–225.

    Google Scholar 

  • Litland, J. E. (2018). Pure logic of iterated full ground. Review of Symbolic Logic, 11(3), 411–435.

    Google Scholar 

  • Martin, E. P. (1978). Solution to the P-W problem. Ph.D. thesis, Australian National University.

    Google Scholar 

  • Martin, E. P., & Meyer, R. K. (1982). Solution to the P-W problem. Journal of Symbolic Logic, 47, 869–887.

    Google Scholar 

  • Nagayama, M. (1999). A normalisation theorem for P-W. Bulletin of the Section of Logic, 28, 83–88.

    Google Scholar 

  • Powers, L. (1976). On P-W. The Relevance Logic Newsletter, 1, 131–142.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Errol Martin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Fine, K., Martin, E. (2023). Progressive Logic. In: Faroldi, F.L.G., Van De Putte, F. (eds) Kit Fine on Truthmakers, Relevance, and Non-classical Logic. Outstanding Contributions to Logic, vol 26. Springer, Cham. https://doi.org/10.1007/978-3-031-29415-0_33

Download citation

Publish with us

Policies and ethics