Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Andrey Bovykin
2010 – today
- 2010
[j3]Andrey Bovykin: Unprovability threshold for the planar graph minor theorem. Ann. Pure Appl. Logic 162(3): 175-181 (2010)
2000 – 2009
- 2009
[j2]Andrey Bovykin: Exact unprovability results for compound well-quasi-ordered combinatorial classes. Ann. Pure Appl. Logic 157(2-3): 77-84 (2009)- 2008
[j1]Andrey Bovykin: Resplendent models and S11{\Sigma_1^1} -definability with an oracle. Arch. Math. Log. 47(6): 607-623 (2008)- 2006
[c1]Duncan Hull, Evgeny Zolin, Andrey Bovykin, Ian Horrocks, Ulrike Sattler, Robert Stevens: Deciding Semantic Matching of Stateless Services. AAAI 2006: 1319-1324
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-09-10 15:48 CEST by the dblp team



