Informational semantics, non-deterministic matrices and feasible deduction

DOI10.1016/J.ENTCS.2014.06.004MaRDI QIDQ281148zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Semantics and proof-theory of depth bounded Boolean logics
• An informational view of classical logic
• Tractable depth-bounded logics and the problem of logical omniscience
• The enduring scandal of deduction. Is propositional logic really uninformative?
• scientific article; zbMATH DE number 7599926

Cites work

• scientific article; zbMATH DE number 6699702 (Why is no real title available?)
• scientific article; zbMATH DE number 3659568 (Why is no real title available?)
• scientific article; zbMATH DE number 1765698 (Why is no real title available?)
• scientific article; zbMATH DE number 1395652 (Why is no real title available?)
• scientific article; zbMATH DE number 3399180 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A non-deterministic view on non-classical negations
• Advances in Artificial Intelligence – SBIA 2004
• Anytime clausal reasoning
• Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control
• Classical natural deduction
• Conceptions of truth in intuitionism
• Cut and pay
• Cut-elimination and quantification in canonical systems
• Logics in Artificial Intelligence
• Non-deterministic Multiple-valued Structures
• Semantics and proof-theory of depth bounded Boolean logics
• Tableau methods for substructural logics
• The Taming of the Cut. Classical Refutations with Analytic Cut
• The enduring scandal of deduction. Is propositional logic really uninformative?
• The universe of propositional approximations
• Tractable depth-bounded logics and the problem of logical omniscience

Cited in

(5)

• Semantics and proof-theory of depth bounded Boolean logics
• The enduring scandal of deduction. Is propositional logic really uninformative?
• An informational view of classical logic
• Basic Constructive Connectives, Determinism and Matrix-Based Semantics
• A multi-agent depth bounded Boolean logic

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)