Semantics and proof-theory of depth bounded Boolean logics

DOI10.1016/J.TCS.2013.02.014MaRDI QIDQ385021zbMATH OpenOpenAlexFDO

Authors Marcello D'Agostino, Marcelo Finger, Dov Gabbay

Publication date 29 November 2013

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2013.02.014

zbMATH Keywords

automated deductionnatural deductiontractabilityBoolean logic

Mathematics Subject Classification ID

Classical propositional logic (03B05) Proof theory in general (including proof-theoretic semantics) (03F03) Mechanization of proofs and logical operations (03B35)

Recommendations

• Informational semantics, non-deterministic matrices and feasible deduction
• scientific article; zbMATH DE number 7599926
• Tractable depth-bounded logics and the problem of logical omniscience
• Advances in Artificial Intelligence – SBIA 2004
• Depth-Bounded Approximations of Probability

Cites work

• scientific article; zbMATH DE number 3659568 (Why is no real title available?)
• scientific article; zbMATH DE number 3557754 (Why is no real title available?)
• scientific article; zbMATH DE number 3583767 (Why is no real title available?)
• scientific article; zbMATH DE number 1028816 (Why is no real title available?)
• scientific article; zbMATH DE number 1765698 (Why is no real title available?)
• scientific article; zbMATH DE number 834573 (Why is no real title available?)
• scientific article; zbMATH DE number 3333259 (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 First Order Extension of Stålmarck’s Method
• 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
• Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
• Classical natural deduction
• Cut and pay
• Cut-elimination and quantification in canonical systems
• First order Stålmarck. Universal lemmas through branch merges
• Logics in Artificial Intelligence
• Natural 3-valued logics—characterization and proof theory
• Natural deduction, hybrid systems and modal logics
• On Inversion Principles
• Tableau methods for classical propositional logic
• Tableaux and related methods
• The Taming of the Cut. Classical Refutations with Analytic Cut
• The complexity of theorem-proving procedures
• The enduring scandal of deduction. Is propositional logic really uninformative?
• The new logic
• The scandal of deduction. Hintikka on the information yield of deductive inferences
• The universe of propositional approximations
• Tractable depth-bounded logics and the problem of logical omniscience
• Untersuchungen über das logische Schliessen. I

Cited in

(11)

• Succinctness of Order-Invariant Logics on Depth-Bounded Structures
• Normality, non-contamination and logical depth in classical natural deduction
• Tractable depth-bounded logics and the problem of logical omniscience
• On linear rewriting systems for Boolean logic and some applications to proof theory
• Informational semantics, non-deterministic matrices and feasible deduction
• A hyperintensional logic of non-prime evidence
• An informational view of classical logic
• The problem of \(\Pi_{2}\)-cut-introduction
• Depth-bounded belief functions
• Classical logic, argument and dialectic
• A modal view on resource-bounded propositional logics

This page was built for publication: Semantics and proof-theory of depth bounded Boolean logics

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