Subtractive logic

DOI10.1016/S0304-3975(99)00124-3MaRDI QIDQ5940919zbMATH OpenOpenAlexFDO

Publication date 20 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(99)00124-3

Cartesian closed categories duality extension of intuitionistic logic subtractive logic symmetrical categorical propositional calculus

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Categorical logic, topoi (03G30) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Review text

Subtractive logic gets its name from the addition of a ``minus binary connective -- to the language of intuitionistic propositional calculus (IPC, with connective symbols \(\top\) (``true), \(\bot\) (``false), \(\wedge\) (``and), \(\vee\) (``or), and \(\Rightarrow\) (``implies)). The intended reading for \(p-q\) is ``\(p\), but not \(q\), and the symbols \(\top\), \(\wedge\), and \(\Rightarrow\) are respectively ``dual to \(\bot\), \(\vee\), and \(-\).NEWLINENEWLINENEWLINEThe logic of this propositional language arises from the underlying axiomatics of Cartesian closed categories whose category-opposites are also Cartesian closed. \(\top\) and \(\bot\) correspond respectively to the terminal and initial objects; \(\wedge\) and \(\vee\) correspond respectively to the product and coproduct; and \(\Rightarrow\) and \(-\) correspond respectively to the exponent and co-exponent. This symmetrical categorical propositional calculus (SCPC) can be given by a system of axioms and rules, and is shown to be equivalent to the subtractive propositional calculus of \textit{C. Rauszer} [``Semi-Boolean algebras and their applications to intuitionistic logic with dual operations, Fundam. Math. 83, 219-249 (1974; Zbl 0298.02064)]. The author extends the work of Rauszer with some new facts about subtractive logic, especially non-definability results. He goves on to show that SCPC has a Kripke-style semantics extending that for IPC, and uses this to prove that SCPC is a conservative extension of IPC.NEWLINENEWLINENEWLINEIn the latter half of the paper, subtractive predicate logic is examined, and found to be a non-conservative extension of intuitionistic predicate logic. A Gentzen-style sequent calculus for this logic is also studied.

Recommendations

Cites work

Cited in

(23)

This page was built for publication: Subtractive logic

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