| |
| 2008 | ||
|---|---|---|
| 8 | EE | Pavel Naumov: On meta complexity of propositional formulas and propositional proofs. Arch. Math. Log. 47(1): 35-52 (2008) |
| 2006 | ||
| 7 | EE | Pavel Naumov: On modal logic of deductive closure. Ann. Pure Appl. Logic 141(1-2): 218-224 (2006) |
| 6 | EE | Pavel Naumov: Upper bounds on complexity of Frege proofs with limited use of certain schemata. Arch. Math. Log. 45(4): 431-446 (2006) |
| 5 | EE | Pavel Naumov: Logic of subtyping. Theor. Comput. Sci. 357(1-3): 167-185 (2006) |
| 2005 | ||
| 4 | EE | Pavel Naumov: On Modal Logics of Partial Recursive Functions. Studia Logica 81(3): 295-309 (2005) |
| 2004 | ||
| 3 | EE | Pavel Naumov: On Modal Logics of Partial Recursive Functions CoRR cs.LO/0407031: (2004) |
| 2001 | ||
| 2 | EE | Pavel Naumov, Mark-Oliver Stehr, José Meseguer: The HOL/NuPRL Proof Translator (A Practical Approach to Formal Interoperability). TPHOLs 2001: 329-345 |
| 2000 | ||
| 1 | Robert L. Constable, Paul B. Jackson, Pavel Naumov, Juan C. Uribe: Constructively formalizing automata theory. Proof, Language, and Interaction 2000: 213-238 | |
| 1 | Robert L. Constable | [1] |
| 2 | Paul B. Jackson | [1] |
| 3 | José Meseguer | [2] |
| 4 | Mark-Oliver Stehr | [2] |
| 5 | Juan C. Uribe | [1] |