The Method of Socratic Proofs Meets Correspondence Analysis

Bulletin of the Section of Logic 48 (2):99-116 (2019)
  Copy   BIBTEX

Abstract

The goal of this paper is to propose correspondence analysis as a technique for generating the so-called erotetic calculi which constitute the method of Socratic proofs by Andrzej Wiśniewski. As we explain in the paper, in order to successfully design an erotetic calculus one needs invertible sequent-calculus-style rules. For this reason, the proposed correspondence analysis resulting in invertible rules can constitute a new foundation for the method of Socratic proofs. Correspondence analysis is Kooi and Tamminga's technique for designing proof systems. In this paper it is used to consider sequent calculi with non-branching, invertible rules for the negation fragment of classical propositional logic and its extensions by binary Boolean functions.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2019-09-21

Downloads
31 (#731,185)

6 months
6 (#869,904)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Yaroslav Petrukhin
Moscow State University

Citations of this work

Non-transitive Correspondence Analysis.Yaroslav Petrukhin & Vasily Shangin - 2023 - Journal of Logic, Language and Information 32 (2):247-273.

Add more citations

References found in this work

The logic of paradox.Graham Priest - 1979 - Journal of Philosophical Logic 8 (1):219 - 241.
How a computer should think.Nuel Belnap - 1977 - In Gilbert Ryle (ed.), Contemporary aspects of philosophy. Boston: Oriel Press.
On notation for ordinal numbers.S. C. Kleene - 1938 - Journal of Symbolic Logic 3 (4):150-155.
A useful four-valued logic.N. D. Belnap - 1977 - In J. M. Dunn & G. Epstein (eds.), Modern Uses of Multiple-Valued Logic. D. Reidel.

View all 9 references / Add more references