Crossref
Non-finite Axiomatizability of Generalized Medvedev Logics
Electronic Proceedings in Theoretical Computer Science · 29.06.2026 · 447 · 770-781
DOI: 10.4204/eptcs.447.43 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Proceedings in Theoretical Computer Science, online erschienen am 29.06.2026. Verfasst von Han Xiao. Die Arbeit nennt 13 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Xiao, H. (2026). Non-finite Axiomatizability of Generalized Medvedev Logics. Electronic Proceedings in Theoretical Computer Science, 447, 770-781. https://doi.org/10.4204/eptcs.447.43
Vancouver
Xiao H. Non-finite Axiomatizability of Generalized Medvedev Logics. Electronic Proceedings in Theoretical Computer Science. 2026;447:770-781. doi:10.4204/eptcs.447.43
BibTeX
@article{Xiao2026,
author = {Xiao, Han},
title = {Non-finite Axiomatizability of Generalized Medvedev Logics},
journal = {Electronic Proceedings in Theoretical Computer Science},
year = {2026},
volume = {447},
pages = {770--781},
doi = {10.4204/eptcs.447.43}
}
EUVIMED