scientific article; zbMATH DE number 3819690

MaRDI QIDQ3666825zbMATH OpenFDO

Authors Daniele Mundici

Publication date 1980

zbMATH Keywords

uncertaintyrelativitycomputer performancebounded quantifier arithmeticcomplexity of Craig's interpolationphysical limitations of computational processesunfeasibility of computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20) Interpolation, preservation, definability (03C40)

Cited in

(1)

• A lower bound for the complexity of Craig's interpolants in sentential logic

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