English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The motivation for this paper comes out of our experience with teachingnatural deduction (ND) and with the way this formal system is implemented bythe \textsc{Coq} proof assistant, namely by means of so-called tactics, whichare heuristics that transform a goal formula into a sequence of subgoals whoseprovability implies that of the original formula. We aim at capturing some ofthese tactics into a system of ND for minimal logic. Our goal is twofold:formal and didactic. The former delivers a formal system with its underlyingheuristics to build proofs, which in turn serves our latter purpose, that ofmaking an ideal system for the teaching of ND at an undergraduate level in acomputer science program.

How to prove it in Natural Deduction: A Tactical Approach