Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Dominik Wehr"'
Autor:
Bahareh Afshari, Dominik Wehr
Publikováno v:
Information and Computation, 290:104982. Elsevier
Beckmann [1] derives bounds on the length of reduction chains of classes of simply typed λ-calculus terms which are exact up-to a constant factor in their highest exponent. Afshari et al. [2] obtain similar bounds on acyclic higher-order recursion s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::934b51fc463a589648a975326a699a04
https://doi.org/10.1016/j.ic.2022.104982
https://doi.org/10.1016/j.ic.2022.104982
Publikováno v:
Journal of Logic and Computation. 31:112-151
We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic natural deduct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05eeba8df8f4f509fad751a31b89cae9
https://doi.org/10.1093/logcom/exaa073
https://doi.org/10.1093/logcom/exaa073
Autor:
Dominik Wehr, Dominik Kirst
Publikováno v:
Logic, Language, Information, and Computation ISBN: 9783031152979
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70412922f57d4f031e25fb0fc1d9de78
https://doi.org/10.1007/978-3-031-15298-6_22
https://doi.org/10.1007/978-3-031-15298-6_22
Publikováno v:
Logical Foundations of Computer Science ISBN: 9783030367541
LFCS
LFCS
We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic natural deduct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3dd3b495909bb280c5327d82eebb01d
https://doi.org/10.1007/978-3-030-36755-8_4
https://doi.org/10.1007/978-3-030-36755-8_4