scientific article; zbMATH DE number 3799636
From MaRDI portal
Publication:4744264
zbMATH Open0507.03025MaRDI QIDQ4744264FDOQ4744264
Authors: Daniele Mundici 
Publication date: 1982
Title of this publication is not available (Why is that?)
transitive closureCraig interpolationcircuit depthcircuit sizeNPpropositional calculusuniform and non- uniform complexity
Analysis of algorithms and problem complexity (68Q25) Complexity of proofs (03F20) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (6)
- Interpolation systems for ground proofs in automated deduction: a survey
- Natural limitations of decision procedures for arithmetic with bounded quantifiers
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF
- A lower bound for the complexity of Craig's interpolants in sentential logic
- Progression of decomposed local-effect action theories
- Finite-Variable Logics Do Not Have Weak Beth Definability Property
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4744264)
