Truth table logic, with a survey of embeddability results

completeness theorem Glivenko's theorem normal derivations proof theory propositional natural deduction systems subsystem of intuitionistic relevant logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05)

Review text

The propositional natural deduction systems considered here have standard introduction rules [including (A\(\vdash \Lambda)\vdash \sim A]\) and less standard elimination rules always having conclusion \(\Lambda\), for example, A,\(\sim A/\Lambda\) or A\&B, (A\(\vdash \Lambda)\vdash \Lambda\) etc. Only normal derivations are considered satisfying the relevance condition (discharged assumption cannot be absent), and the normalization theorem is invalid. The main lemma in Kalmar's proof of the completeness theorem, but not the theorem itself, can be proved in the system. A version of Glivenko's theorem (\(\vdash A\) classically implies \(\vdash \sim \sim A\) in the system considered) is also established.

Recommendations

Cited in

(3)

This page was built for publication: Truth table logic, with a survey of embeddability results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912092)