scientific article; zbMATH DE number 3827841

zbMATH Open0523.03027MaRDI QIDQ3674632FDOQ3674632

Daniele Mundici

Publication date: 1981

Title of this publication is not available (Why is that?)

zbMATH Keywords

length of an interpolation formulasimulation of Turing machine by Boolean sentences

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Interpolation, preservation, definability (03C40) Turing machines and related notions (03D10)

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