functional completenessnormalizationrefutationcut-eliminationinformation processingconstructive negationintuitionistic propositional logicintuitionistic logicssubsystemsmonoid models\(\lambda\)-term semanticsencoding of proofs
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Cut-elimination and normal-form theorems (03F05) Logic in artificial intelligence (68T27) Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40)
Recommendations
Cited in
(71)- Intuitionistic logic is a connexive logic
- Logical information theory: new logical foundations for information theory
- An invitation to new essays on Belnap-Dunn logic
- Constructive negation, implication, and co-implication
- 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
- Logical consequence and the paradoxes
- Bounded linear-time temporal logic: a proof-theoretic investigation
- Combining linear-time temporal logic with constructiveness and paraconsistency
- Paraconsistent computation tree logic
- A `natural logic' inference system using the Lambek calculus
- scientific article; zbMATH DE number 5606348 (Why is no real title available?)
- Inconsistency-tolerant description logic. II: A tableau algorithm for \(\mathcal{CALC}^{\mathsf C}\)
- Dual intuitionistic logic and a variety of negations: the logic of scientific research
- The information in intuitionistic logic
- Prawitz, Proofs, and Meaning
- Rough Sets - Past, Present and Future: Some Notes
- A first order nonmonotonic extension of constructive logic
- Inconsistency-tolerant temporal reasoning with hierarchical information
- Normal modal substructural logics with strong negation
- On split negation, strong negation, information, falsification, and verification
- Truth, falsehood, information and beyond: the American plan generalized
- Algebraic structures in categorial grammar
- Substructural nuclear (image-based) logics and operational Kripke-style semantics
- The Logic of Information
- Falsification-aware calculi and semantics for normal modal logics including S4 and S5
- Partial up an down logic
- Proof analysis in modal logic
- Game semantics for the Lambek-calculus: Capturing directionality and the absence of structural rules
- A procedural interpretation of split negation
- A mixed \(\lambda\)-calculus
- HYPE: a system of hyperintensional logic (with an application to semantic paradoxes)
- Rules of explosion and excluded middle: constructing a unified single-succedent Gentzen-style framework for classical, paradefinite, paraconsistent, and paracomplete logics
- A note on synonymy in proof-theoretic semantics
- Semantics-based nonmonotonic inference
- Description logics with contraries, contradictories, and subcontraries
- Linear and affine logics with temporal, spatial and epistemic operators
- On Ivlev's semantics for modality
- scientific article; zbMATH DE number 221550 (Why is no real title available?)
- Proof systems combining classical and paraconsistent negations
- Inputs, Outputs, and Composition in the Logic of Information Flows
- On the Logic of Information Flow
- The nature of entailment: an informational approach
- DYNAMIC NEGATION AND NEGATIVE INFORMATION
- Reasoning about resources and information: a linear logic approach
- Informational semantics as a third alternative?
- Gentzen-type methods for bilattice negation
- A hierarchy of weak double negations
- On the methodology of paraconsistent logic
- A variant of Thomason's first-order logic CF based on situations
- Meeting strength in substructural logics
- Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials
- Bilattice logics and demi-negation
- Proof theory of Nelson's paraconsistent logic: a uniform perspective
- The class of extensions of Nelson's paraconsistent logic
- Connexive conditional logic. I
- Notes on Craig interpolation for LJ with strong negation
- Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic
- Iterated team semantics for a hierarchy of informational types
- Falsification-aware semantics and sequent calculi for classical logic
- Embedding friendly first-order paradefinite and connexive logics
- Why paraconsistent logics?
- 40 years of FDE: an introductory overview
- Diamonds are a philosopher's best friends. The knowability paradox and modal epistemic relevance logic
- Generalized Elimination Inferences, Higher-Level Rules, and the Implications-as-Rules Interpretation of the Sequent Calculus
- Modal and intuitionistic variants of extended Belnap-Dunn logic with classical negation
- An extended paradefinite logic combining conflation, paraconsistent negation, classical negation, and classical implication: how to construct Nice Gentzen-type sequent calculi
- Phase semantics and Petri net interpretation for resource-sensitive strong negation
- Modal logic without contraction in a metatheory without contraction
- Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
This page was built for publication: The logic of information structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1310268)
