Informational semantics, non-deterministic matrices and feasible deduction

DOI10.1016/J.ENTCS.2014.06.004zbMATH Open1335.03061OpenAlexW2053323297WikidataQ113317871 ScholiaQ113317871MaRDI QIDQ281148FDOQ281148

Marcello D'Agostino

Publication date: 10 May 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2014.06.004

zbMATH Keywords

computational complexitynatural deductionclassical propositional logicinformational semanticsnondeterministic matricessemantic tableaux

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity of proofs (03F20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conceptions of truth in intuitionism
• Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control
• Advances in Artificial Intelligence – SBIA 2004
• Anytime clausal reasoning
• The universe of propositional approximations
• Tableau methods for substructural logics
• Non-deterministic Multiple-valued Structures
• Semantics and proof-theory of depth bounded Boolean logics
• The Taming of the Cut. Classical Refutations with Analytic Cut
• Logics in Artificial Intelligence
• A non-deterministic view on non-classical negations
• Cut-elimination and quantification in canonical systems
• The enduring scandal of deduction. Is propositional logic really uninformative?
• Cut and pay

Cited In (3)

• An informational view of classical logic
• A multi-agent depth bounded Boolean logic
• Basic Constructive Connectives, Determinism and Matrix-Based Semantics

This page was built for publication: Informational semantics, non-deterministic matrices and feasible deduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281148)