Isomorphic formulae in classical propositional logic
From MaRDI portal
Abstract: Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This equality is motivated by generality of deductions. Characterizations are given for pairs of isomorphic formulae, which lead to decision procedures for this isomorphism.
Recommendations
Cites work
- A Brauerian representation of split preorders
- Alonzo Church's Contributions to Philosophy and Intensional Logic
- Cartesian isomorphisms are symmetric monoidal: A justification of linear logic
- Coherence in closed categories
- Generality of proofs and its Brauerian representation
- scientific article; zbMATH DE number 3051936 (Why is no real title available?)
- Identity of Proofs Based on Normalization and Generality
- Isomorphic objects in symmetric monoidal closed categories
- Models of deduction
- Remarks on isomorphisms in typed lambda calculi with empty and sum types
- Tarski's High School Identities
Cited in
(9)- Computational isomorphisms in classical logic
- Logics of synonymy
- scientific article; zbMATH DE number 65742 (Why is no real title available?)
- scientific article; zbMATH DE number 1231529 (Why is no real title available?)
- Isomorphic objects in symmetric monoidal closed categories
- Proof normalisation in a logic identifying isomorphic propositions
- An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF
- A note on synonymy in proof-theoretic semantics
- Inside classical logic: truth, contradictions, fractionality
This page was built for publication: Isomorphic formulae in classical propositional logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3117775)