Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Jouko Vaananen"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 3 (2009)
Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic. But on the other hand, many
Externí odkaz:
https://doaj.org/article/87fae7217b5f42a291f9f8c3195a4eb8
Publikováno v:
Transactions of the American Mathematical Society. 339:567
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a5edd0902f4f82209c7ab1e1b75d3f4
https://doi.org/10.2307/2154287
https://doi.org/10.2307/2154287
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 193, Iss Proc. GandALF 2015, Pp 73-85 (2015)
We study the data complexity of model-checking for logics with team semantics. For dependence and independence logic, we completely characterize the tractability/intractability frontier of data complexity of both quantifier-free and quantified formul
Externí odkaz:
https://doaj.org/article/ba033f5d90404de5bb697432fce2b8c9
Autor:
Jouko Vaananen
Publikováno v:
Proceedings of the American Mathematical Society. 79:294
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad3d0bd8732825fa3a6766ff4780788b
https://doi.org/10.2307/2043253
https://doi.org/10.2307/2043253