dc.contributor.author |
Krebs, Andreas |
|
dc.date.accessioned |
2015-09-08T15:18:33Z |
|
dc.date.available |
2015-09-08T15:18:33Z |
|
dc.date.issued |
2015 |
|
dc.identifier.issn |
1529-3785 |
|
dc.identifier.uri |
http://hdl.handle.net/10900/64698 |
|
dc.language.iso |
en |
en |
dc.publisher |
Assoc Computing Machinery |
de_DE |
dc.relation.uri |
http://dx.doi.org/10.1145/2732409 |
|
dc.rights |
info:eu-repo/semantics/closedAccess |
|
dc.subject.ddc |
004 |
de_DE |
dc.subject.ddc |
610 |
de_DE |
dc.title |
Bounds for the Quantifier Depth in Finite-Variable Logics: Alternation Hierarchy |
de_DE |
dc.type |
Article |
de_DE |
utue.quellen.id |
20150901145020_00192 |
|
utue.personen.roh |
Berkholz, Christoph |
|
utue.personen.roh |
Krebs, Andreas |
|
utue.personen.roh |
Verbitsky, Oleg |
|
dcterms.isPartOf.ZSTitelID |
Acm Transactions on Computational Logic |
de_DE |
dcterms.isPartOf.ZS-Issue |
Article 21 |
de_DE |
dcterms.isPartOf.ZS-Volume |
16 |
de_DE |
utue.fakultaet |
07 Mathematisch-Naturwissenschaftliche Fakultät |
|