Semantics and proof-theory of depth bounded Boolean logics

DOI10.1016/j.tcs.2013.02.014zbMath1315.03107OpenAlexW1977750248MaRDI QIDQ385021

Marcello D'Agostino, Marcelo Finger, Dov M. 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

natural deductiontractabilityautomated deductionBoolean logic

Mathematics Subject Classification ID

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

Related Items

Informational semantics, non-deterministic matrices and feasible deduction, A modal view on resource-bounded propositional logics, The problem of \(\Pi_{2}\)-cut-introduction, Depth-bounded belief functions, An informational view of classical logic, Classical logic, argument and dialectic, Normality, non-contamination and logical depth in classical natural deduction

Cites Work

• Natural deduction, hybrid systems and modal 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
• First order Stålmarck. Universal lemmas through branch merges
• Anytime clausal reasoning
• Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
• Untersuchungen über das logische Schliessen. I
• The universe of propositional approximations
• The scandal of deduction. Hintikka on the information yield of deductive inferences
• The new logic
• On Inversion Principles
• Natural 3-valued logics—characterization and proof theory
• 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
• A First Order Extension of Stålmarck’s Method
• Logics in Artificial Intelligence
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item