scientific article; zbMATH DE number 1765698
From MaRDI portal
Publication:4539639
zbMath0988.03011MaRDI QIDQ4539639
Publication date: 10 July 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2083/20830529
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cut-elimination and normal-form theorems (03F05) Classical propositional logic (03B05) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items (43)
Informational semantics, non-deterministic matrices and feasible deduction ⋮ On all strong Kleene generalizations of classical logic ⋮ Analytic tableaux for non-deterministic semantics ⋮ Two decision procedures for da Costa's \(C_n\) Logics based on restricted Nmatrix semantics ⋮ An Analytic Propositional Proof System on Graphs ⋮ Hypersequent rules with restricted contexts for propositional modal logics ⋮ Semantics and proof-theory of depth bounded Boolean logics ⋮ Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics ⋮ Finite non-deterministic semantics for some modal systems ⋮ What is a logic translation? ⋮ RUSSELLIAN DEFINITE DESCRIPTION THEORY—A PROOF THEORETIC APPROACH ⋮ Cut elimination in coalgebraic logics ⋮ Quasi-canonical systems and their semantics ⋮ Canonical signed calculi with multi-ary quantifiers ⋮ From Inconsistency to Incompatibility ⋮ An informational view of classical logic ⋮ A novel approach to equality ⋮ Logical multilateralism ⋮ Non-transitive correspondence analysis ⋮ Weakly Free Multialgebras ⋮ A Category of Ordered Algebras Equivalent to the Category of Multialgebras ⋮ Tree-like proof systems for finitely-many valued non-deterministic consequence relations ⋮ Sufficient conditions for cut elimination with complexity analysis ⋮ A Model-Theoretic Analysis of Fidel-Structures for mbC ⋮ Kripke Semantics for Basic Sequent Systems ⋮ Cut Elimination for Shallow Modal Logics ⋮ Strict Canonical Constructive Systems ⋮ On negation: Pure local rules ⋮ Processing Information from a Set of Sources ⋮ Non-deterministic semantics for logics with a consistency operator ⋮ Proof systems for reasoning about computation errors ⋮ Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism ⋮ Paraconsistency and the need for infinite semantics ⋮ Swap structures semantics for Ivlev-like modal logics ⋮ Non-deterministic logic of informal provability has no finite characterization ⋮ Three-Valued Logic for Reasoning about Covering-Based Rough Sets ⋮ Free Definite Description Theory – Sequent Calculi and Cut Elimination ⋮ Effective semantics for the modal logics K and KT via non-deterministic matrices ⋮ Degree-Preserving Gödel Logics with an Involution: Intermediate Logics and (Ideal) Paraconsistency ⋮ Finite-valued semantics for canonical labelled calculi ⋮ A non-deterministic view on non-classical negations ⋮ Towards a semantic characterization of cut-elimination ⋮ Cut-elimination and quantification in canonical systems
This page was built for publication:
