The complexity of explicit definitions
From MaRDI portal
Cited in
(5)- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
- Fixed-point extensions of first-order logic
- Effective interpolation and preservation in guarded logics
- A lower bound for the complexity of Craig's interpolants in sentential logic
- Progression of decomposed local-effect action theories
This page was built for publication: The complexity of explicit definitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1237065)