The goal of this paper is to propose correspondence analysis as a technique for generating the so-called erotetic (i.e. pertaining to the logic of questions) 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 (the only exception being the rule of cut), invertible rules for...
A class of axiomatic theories with arbitrary quantifier alternations is identified and a conversion ...
The purpose of this paper is to give an exposition of material dealing with constructive logic, type...
"Theorem proving modulo" is a way to remove computational arguments from proofs by reasoni...
The goal of this paper is to propose correspondence analysis as a technique for generating the so-ca...
Kooi and Tamminga's correspondence analysis is a technique for designing proof systems, mostly, natu...
Whilst results from Structural Proof Theory can be couched in many formalisms, it is the sequent cal...
This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary...
Abstract. It is well-known that intuitionistic and classical provability can be character-ized by th...
AbstractWe investigate semantics for classical proof based on the sequent calculus. We show that the...
The present article aims at establishing formal connections between correspondence phenomena, well k...
We investigate semantics for classical proof based on the sequent calculus. We show that the proposi...
43 pages; comparison with v3: precise discussion of how to understand coinductive syntax mathematica...
This work tackles issues lying at the intersection of question theory and reason-ing theory, leading...
In several applications of sequent calculi going beyond pure logic, an introduction of suitably defi...
Although logic and proof theory have been successfully used as a framework for the specification of ...
A class of axiomatic theories with arbitrary quantifier alternations is identified and a conversion ...
The purpose of this paper is to give an exposition of material dealing with constructive logic, type...
"Theorem proving modulo" is a way to remove computational arguments from proofs by reasoni...
The goal of this paper is to propose correspondence analysis as a technique for generating the so-ca...
Kooi and Tamminga's correspondence analysis is a technique for designing proof systems, mostly, natu...
Whilst results from Structural Proof Theory can be couched in many formalisms, it is the sequent cal...
This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary...
Abstract. It is well-known that intuitionistic and classical provability can be character-ized by th...
AbstractWe investigate semantics for classical proof based on the sequent calculus. We show that the...
The present article aims at establishing formal connections between correspondence phenomena, well k...
We investigate semantics for classical proof based on the sequent calculus. We show that the proposi...
43 pages; comparison with v3: precise discussion of how to understand coinductive syntax mathematica...
This work tackles issues lying at the intersection of question theory and reason-ing theory, leading...
In several applications of sequent calculi going beyond pure logic, an introduction of suitably defi...
Although logic and proof theory have been successfully used as a framework for the specification of ...
A class of axiomatic theories with arbitrary quantifier alternations is identified and a conversion ...
The purpose of this paper is to give an exposition of material dealing with constructive logic, type...
"Theorem proving modulo" is a way to remove computational arguments from proofs by reasoni...