# Search results

Electronic Notes in Theoretical Computer Science > 2015 > 312 > Complete > 107-124

Bulletin of the Section of Logic > 2022 > 51 > 2 > 197-205

Bulletin of the Section of Logic > 2020 > 49 > 3 > 213-230

Fundamenta Informaticae > 2019 > Vol. 170, nr 1-3 > 139--176

Bulletin of the Section of Logic > 2019 > 48 > 2 > 81-97

Logic and Logical Philosophy > 2019 > 28 > 2 > 223–257

Journal of Philosophical Logic > 2019 > 48 > 5 > 867-884

Logica Universalis > 2018 > 12 > 3-4 > 423-460

**LP**. As a result, one has natural deduction systems for all the logics obtainable...

Logic and Logical Philosophy > 2018 > 27 > 3 > 351-373

Studia Logica > 2019 > 107 > 1 > 1-5

Roczniki Filozoficzne > 2018 > 66 > 2 > 149-171

Logica Universalis > 2018 > 12 > 1-2 > 83-100

*k*-valued ($$k\geqslant 3$$ k⩾3 ) logics as well as for all Dual Post’s

*k*-valued logics.

Logic and Logical Philosophy > 2018 > 27 > 1 > 53–66

Logic and Logical Philosophy > 2018 > 27 > 1 > 67–84

Studia Logica > 2019 > 107 > 1 > 109-144

*reductio ad absurdum*rule ( $$\mathsf {raa}$$ raa ) in classical natural deduction. This technique is connected with two normalization strategies for classical logic, due to Prawitz and Seldin, respectively. We introduce a variant of Seldin’s strategy for the postponement of $$\mathsf {raa}$$ raa , which induces a negative translation (a variant...

Logic and Logical Philosophy > 2017 > 26 > 2 > 163–196