A lower bound for the complexity of Craig's interpolants in sentential logic
- 1 December 1983
- journal article
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 23 (1) , 27-36
- https://doi.org/10.1007/bf02023010
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Compactness=JEP in any logicFundamenta Mathematicae, 1983
- Compactness, interpolation and Friedman's third problemAnnals of Mathematical Logic, 1982
- Duality between logics and equivalence relationsTransactions of the American Mathematical Society, 1982
- Irreversibility, uncertainty, relativity and computer limitationsIl Nuovo Cimento B (1971-1996), 1981
- Robinson’s consistency theorem in soft model theoryTransactions of the American Mathematical Society, 1981
- Interpolation, compactness and JEP in soft model theoryArchive for Mathematical Logic, 1980
- The relative efficiency of propositional proof systemsThe Journal of Symbolic Logic, 1979
- The complexity of explicit definitionsAdvances in Mathematics, 1976
- The network complexity and the Turing machine complexity of finite functionsActa Informatica, 1976
- First-Order Logic. By R.M. Smullyan. Pp. 158. 75s. 1968. (Springer-Verlag-Berlin).The Mathematical Gazette, 1970