scientific article; zbMATH DE number 3074070
From MaRDI portal
Publication:5813184
zbMath0047.25102MaRDI QIDQ5813184
Publication date: 1952
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion ⋮ On deductive bases for paraconsistent answer set semantics ⋮ Modal multilattice logic ⋮ Gentzen-type sequent calculi for extended Belnap-Dunn logics with classical negation: a general framework ⋮ Paraconsistent double negations as classical and intuitionistic negations ⋮ Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant ⋮ Belnap Constants and Nelson Logic ⋮ Revisiting Explicit Negation in Answer Set Programming ⋮ Extending paraconsistent quantum logic: a single‐antecedent/succedent system approach ⋮ A labeled argumentation framework ⋮ Falsification-aware calculi and semantics for normal modal logics including S4 and S5 ⋮ Modal and intuitionistic variants of extended Belnap-Dunn logic with classical negation ⋮ Lattice logic, bilattice logic and paraconsistent quantum logic: a unified framework based on monosequent systems ⋮ Modal extension of ideal paraconsistent four-valued logic and its subsystem ⋮ Bi-Classical Connexive Logic and its Modal Extension: Cut-elimination, completeness and duality ⋮ Alternative multilattice logics: an approach based on monosequent and indexed monosequent calculi ⋮ Proof theory of Nelson's paraconsistent logic: a uniform perspective ⋮ Unnamed Item ⋮ Falsification-aware semantics and sequent calculi for classical logic ⋮ Embedding friendly first-order paradefinite and connexive logics ⋮ An extended paradefinite logic combining conflation, paraconsistent negation, classical negation, and classical implication: how to construct Nice Gentzen-type sequent calculi ⋮ Inference rules in Nelson's logics, admissibility and weak admissibility
This page was built for publication:
