Informational semantics, non-deterministic matrices and feasible deduction

DOI10.1016/j.entcs.2014.06.004zbMath1335.03061OpenAlexW2053323297WikidataQ113317871 ScholiaQ113317871MaRDI QIDQ281148

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)

Related Items (2)

An informational view of classical logic ⋮ A multi-agent depth bounded Boolean logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantics and proof-theory of depth bounded Boolean logics
• 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
• Anytime clausal reasoning
• The universe of propositional approximations
• Non-deterministic Multiple-valued Structures
• Conceptions of truth in intuitionism
• The Taming of the Cut. Classical Refutations with Analytic Cut
• Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control
• Advances in Artificial Intelligence – SBIA 2004
• Logics in Artificial Intelligence

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