Entry Beyersdorff:2012:PCN from lncs2012f.bib
Last update: Sun Oct 15 02:37:12 MDT 2017
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Beyersdorff:2012:PCN,
author = "Olaf Beyersdorff and Oliver Kutz",
title = "Proof Complexity of Non-classical Logics",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7388",
pages = "1--54",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31485-8_1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:21:30 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31485-8_1/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31485-8",
book-URL = "http://www.springerlink.com/content/978-3-642-31485-8",
fjournal = "Lecture Notes in Computer Science",
}
Related entries
- Complexity,
7353(0)31,
7353(0)76,
7353(0)138,
7353(0)196,
7354(0)159,
7363(0)1,
7370(0)17,
7370(0)56,
7370(0)69,
7370(0)91,
7370(0)162,
7370(0)469,
7372(0)101,
7373(0)40,
7381(0)229,
7386(0)89,
7386(0)117,
7386(0)130,
7386(0)141,
7386(0)155,
7386(0)169,
7386(0)196,
7386(0)209,
7386(0)252,
7388(0)89,
7391(0)13,
7391(0)100,
7395(0)208
- Logic,
7351(0)74,
7351(0)186,
7352(0)132,
7360(0)12,
7360(0)33,
7360(0)79,
7360(0)172,
7360(0)196,
7362(0)264,
7364(0)45,
7364(0)82,
7371(0)1,
7381(0)138,
7388(0)55,
7393(0)46,
7393(0)61,
7393(0)91,
7393(0)139,
7393(0)151,
7393(0)170,
7393(0)184,
7399(0)238
- Proof,
7358(0)105,
7362(0)17,
7362(0)32,
7372(0)208,
7397(0)179