The logic of information structures
From MaRDI portal
Publication:1310268
DOI10.1007/3-540-56734-8zbMath0788.03001OpenAlexW1595523092MaRDI QIDQ1310268
Publication date: 8 December 1993
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-56734-8
subsystemsnormalizationintuitionistic propositional logiccut-eliminationfunctional completenessrefutationinformation processingconstructive negationintuitionistic logicsmonoid models\(\lambda\)-term semanticsencoding of proofs
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (58)
Bunched sequential information ⋮ Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion ⋮ A positive information logic for inferential information ⋮ Linear and affine logics with temporal, spatial and epistemic operators ⋮ Notes on Craig interpolation for LJ with strong negation ⋮ Meeting strength in substructural logics ⋮ A `natural logic' inference system using the Lambek calculus ⋮ Semantics-based nonmonotonic inference ⋮ Partial up an down logic ⋮ DYNAMIC NEGATION AND NEGATIVE INFORMATION ⋮ Iterated team semantics for a hierarchy of informational types ⋮ Algebraic structures in categorial grammar ⋮ Paraconsistent constructive logic with strong negation as a contraction-free relevant logic ⋮ 40 years of FDE: an introductory overview ⋮ Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic ⋮ HYPE: a system of hyperintensional logic (with an application to semantic paradoxes) ⋮ The nature of entailment: an informational approach ⋮ Intuitionistic logic is a connexive logic ⋮ Falsification-aware calculi and semantics for normal modal logics including S4 and S5 ⋮ Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials ⋮ Normal modal substructural logics with strong negation ⋮ Logical consequence and the paradoxes ⋮ Rough Sets - Past, Present and Future: Some Notes ⋮ Informational semantics as a third alternative? ⋮ On Split Negation, Strong Negation, Information, Falsification, and Verification ⋮ Truth, Falsehood, Information and Beyond: The American Plan Generalized ⋮ An Invitation to New Essays on Belnap-Dunn Logic ⋮ Bilattice Logics and Demi-Negation ⋮ Modal and intuitionistic variants of extended Belnap-Dunn logic with classical negation ⋮ Inconsistency-tolerant description logic. II: A tableau algorithm for \(\mathcal{CALC}^{\mathsf C}\) ⋮ A mixed \(\lambda\)-calculus ⋮ Inconsistency-tolerant temporal reasoning with hierarchical information ⋮ Description logics with contraries, contradictories, and subcontraries ⋮ Paraconsistent computation tree logic ⋮ A variant of Thomason's first-order logic CF based on situations ⋮ Combining linear-time temporal logic with constructiveness and paraconsistency ⋮ A hierarchy of weak double negations ⋮ Game semantics for the Lambek-calculus: Capturing directionality and the absence of structural rules ⋮ Phase semantics and Petri net interpretation for resource-sensitive strong negation ⋮ Prawitz, Proofs, and Meaning ⋮ On the Methodology of Paraconsistent Logic ⋮ Why Paraconsistent Logics? ⋮ MODAL LOGIC WITHOUT CONTRACTION IN A METATHEORY WITHOUT CONTRACTION ⋮ Proof systems combining classical and paraconsistent negations ⋮ Connexive Conditional Logic. Part I ⋮ Constructive negation, implication, and co-implication ⋮ Bounded linear-time temporal logic: a proof-theoretic investigation ⋮ Proof theory of Nelson's paraconsistent logic: a uniform perspective ⋮ 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 ⋮ Generalized Elimination Inferences, Higher-Level Rules, and the Implications-as-Rules Interpretation of the Sequent Calculus ⋮ Proof analysis in modal logic ⋮ Gentzen-type methods for bilattice negation ⋮ The class of extensions of Nelson's paraconsistent logic ⋮ A first order nonmonotonic extension of constructive logic ⋮ Dual intuitionistic logic and a variety of negations: the logic of scientific research ⋮ Diamonds are a philosopher's best friends. The knowability paradox and modal epistemic relevance logic
This page was built for publication: The logic of information structures