MAX SAT approximation beyond the limits of polynomial-time approximation. (English)
Ann. Pure Appl. Logic 113, No.1-3, 81-94 (2002).
1
Cut elimination for the second order propositional logic with Hilbert’s $ε$-symbol, extensionality, and full comprehension. (English)
Adian, S. (ed.) et al., Logical foundations of computer science. 4th international symposium, LFCS ’97, Yaroslavl, Russia, July 6‒12, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1234, 113-118 (1997).
2
A lower bound for interpolation. (English)
Log. J. IGPL 5, No.3, 321-326 (1997).
3
Cut elimination for the second order propositional logic with Hilbert’s epsilon-symbol, extensionality, and full comprehension (English)
LFCS, 113-118 (1997).
4
Start
Contact
Print
General Help
