Complexity of interpolation and related problems in positive calculi

Journal of Symbolic Logic

Volumn 67, Issue 1, 2002, Pages 397-407

  Maksimova, Larisa ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036002895     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1190150051     Document Type: Article

References (22)

1. A. Chagrov and M. ZAkhARyAscHev, Modal logics, Clarendon Press, Oxford, 1997.
2. W. Craig, Three uses of Herbrand-Gentzen theorem in relating model theory, this JournaL, vol. 22 (1957), pp. 269-285.
3. M. J. Fisher and R. E. LadnEr, Propositional dynamic logic of regular programs, Journal of Computer and Systems Sciences, vol. 18 (1979), pp. 194-211.
4. J. Y. HaLpErn and Y. Moses, A guide to completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence, vol. 54 (1992), pp. 319-379.
5. T. Hosoi and H. Ono, Intermediate propositional logics. A survey, Journal of Tsuda College, vol. 5 (1973), pp. 67-82.
6. D. S. Johnson, A catalog of complexity classes, Handbook of theoretical computer science (J. van Leeuwen, editor), vol. A, Elsevier, 1990, pp. 67-161.
7. G. KrEisEL, Explicit definability in intuitionistic logic, this Journal, vol. 25 (1960), pp. 389-390.
8. A. V KuznEtsov, Some properties of the lattice of varieties of pseudo-boolean algebras, 11th Sovjet algebraic colloquium, Abstracts, Kishinev, 1971, pp. 255-256.
9. R. E. LadnEr, The computational complexity ofprovability in systems of modal propositional logics, SIAM Journal of Computing, vol. 6 (1977), no. 3, pp. 467-480.
10. L. Maksimova, Intuitionistic logic and implicit definability, Annals of Pure and Applied Logic, vol. 105 (2000), pp. 83-102.
11. L. Maksimova and A. Voronkov, Complexity of some problems in modal and superintuitionistic logics, Logic colloquium’99, Abstracts, Utrecht, 1999, Bulletin of Symbolic Logic, vol. 6 (2000), pp. 118-119.
12. L. L. Maksimova, Implicit definability and positive logics, to appear in Algebra and Logic.
13. L. L. Maksimova, Pretabular superintuitionistic logics, Algebra and Logic, vol. 11 (1972), pp. 558-570.
14. L. L. Maksimova, Craig’s interpolation theorem and amalgamable varieties, Doklady AN SSSR, vol. 237 (1977), pp. 1281-1284.
15. L. L. Maksimova, Craig’s theorem in superintuitionistic logics and amalgamable varieties of pseudoboolean algebras, Algebra and Logic, vol. 16 (1977), pp. 643-681.
16. L. L. Maksimova, Decidability of projective Beth’s property in varieties of Heyting algebras, Algebra and Logic, vol. 40 (2001), pp. 290-301.
17. S. Miura, A remarkon the intersection of two logics, Nagoya Mathematics Journal, vol. 26 (1966), pp. 167-171.
18. C. H. Papadimitriou, Computational complexity, Addison-Wesley, Reading, Massachusets, 1994.
19. V. R. Pratt, Models of program logics, Proceedings 20th IEEE symposium on foundations of computer science, 1979, pp. 115-122.
20. H. Rasiowa and R. Sikorski, The mathematics of metamathematics, Polish Scientific Publishers, Warszawa, 1963.
21. E. Spaan, Complexity of modal logics, Dissertation, Institute for Logic, Language and Computation, University of Amsterdam, 1992.
22. R. Statman, Intuitionistic logic is polynomial-space complete, Theoretical Computer Science, vol. 9 (1979), pp. 67-72.