The following pages link to (Q4539639):
Displaying 49 items.
- Informational semantics, non-deterministic matrices and feasible deduction (Q281148) (← links)
- On all strong Kleene generalizations of classical logic (Q295922) (← links)
- Hypersequent rules with restricted contexts for propositional modal logics (Q344801) (← links)
- Semantics and proof-theory of depth bounded Boolean logics (Q385021) (← links)
- Canonical signed calculi with multi-ary quantifiers (Q408550) (← links)
- Cut elimination in coalgebraic logics (Q618171) (← links)
- A non-deterministic view on non-classical negations (Q813081) (← links)
- Towards a semantic characterization of cut-elimination (Q817704) (← links)
- Cut-elimination and quantification in canonical systems (Q817707) (← links)
- An informational view of classical logic (Q897935) (← links)
- Non-deterministic semantics for logics with a consistency operator (Q997049) (← links)
- Proof systems for reasoning about computation errors (Q1015487) (← links)
- On negation: Pure local rules (Q1775871) (← links)
- What is a logic translation? (Q1931306) (← links)
- Non-deterministic logic of informal provability has no finite characterization (Q2071578) (← links)
- Effective semantics for the modal logics K and KT via non-deterministic matrices (Q2104537) (← links)
- Analytic tableaux for non-deterministic semantics (Q2142063) (← links)
- Two decision procedures for da Costa's \(C_n\) Logics based on restricted Nmatrix semantics (Q2144181) (← links)
- Tree-like proof systems for finitely-many valued non-deterministic consequence relations (Q2228348) (← links)
- Paraconsistency and the need for infinite semantics (Q2317507) (← links)
- Swap structures semantics for Ivlev-like modal logics (Q2317515) (← links)
- Finite-valued semantics for canonical labelled calculi (Q2351396) (← links)
- Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
- Gentzen-like systems for partial propositional calculi. I. II (Q2534156) (← links)
- Kripke Semantics for Basic Sequent Systems (Q3010359) (← links)
- Cut Elimination for Shallow Modal Logics (Q3010370) (← links)
- A Model-Theoretic Analysis of Fidel-Structures for mbC (Q3305664) (← links)
- Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism (Q3392939) (← links)
- Strict Canonical Constructive Systems (Q3585998) (← links)
- Processing Information from a Set of Sources (Q3600567) (← links)
- Canonical Gentzen-Type Calculi with (n,k)-ary Quantifiers (Q3613413) (← links)
- Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics (Q4583342) (← links)
- Finite non-deterministic semantics for some modal systems (Q4586135) (← links)
- Free Definite Description Theory – Sequent Calculi and Cut Elimination (Q5006839) (← links)
- Degree-Preserving Gödel Logics with an Involution: Intermediate Logics and (Ideal) Paraconsistency (Q5020166) (← links)
- An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
- Three-Valued Logic for Reasoning about Covering-Based Rough Sets (Q5245184) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492875) (← links)
- RUSSELLIAN DEFINITE DESCRIPTION THEORY—A PROOF THEORETIC APPROACH (Q6041350) (← links)
- Quasi-canonical systems and their semantics (Q6088602) (← links)
- From Inconsistency to Incompatibility (Q6107289) (← links)
- A novel approach to equality (Q6142508) (← links)
- Logical multilateralism (Q6145030) (← links)
- Non-transitive correspondence analysis (Q6156626) (← links)
- From Belnap-Dunn four-valued logic to six-valued logics of evidence and truth (Q6562366) (← links)
- The logicality of equality (Q6612870) (← links)
- On non-deterministic functional completeness (Q6623946) (← links)
- Non-deterministic logic of generalized classical truth values (Q6623947) (← links)
- Tableau systems for some Ivlev-like (quantified) modal logics (Q6623948) (← links)
