On constructive connectives and systems
From MaRDI portal
Abstract: Canonical inference rules and canonical systems are defined in the framework of non-strict single-conclusion sequent systems, in which the succeedents of sequents can be empty. Important properties of this framework are investigated, and a general non-deterministic Kripke-style semantics is provided. This general semantics is then used to provide a constructive (and very natural), sufficient and necessary coherence criterion for the validity of the strong cut-elimination theorem in such a system. These results suggest new syntactic and semantic characterizations of basic constructive connectives.
Recommendations
Cited in
(8)- Finite-valued semantics for canonical labelled calculi
- Kripke Semantics for Basic Sequent Systems
- Basic Constructive Connectives, Determinism and Matrix-Based Semantics
- scientific article; zbMATH DE number 5298331 (Why is no real title available?)
- Strict canonical constructive systems
- Canonical constructive systems
- Non-deterministic connectives in propositional Gödel logic
- scientific article; zbMATH DE number 3323743 (Why is no real title available?)
This page was built for publication: On constructive connectives and systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3081447)
