EUVIMEDEUVIMED entdecken
Crossref

Taming Complexity in Intuitionistic Modal Logic: The Case of FIK and Its Shallow Calculus

Han Gao, Nicola Olivetti

Electronic Proceedings in Theoretical Computer Science · 29.06.2026 · 447 · 407-426

DOI: 10.4204/eptcs.447.23 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Electronic Proceedings in Theoretical Computer Science, online erschienen am 29.06.2026. Verfasst von Han Gao und 1 weiteren Autor:innen. Die Arbeit nennt 28 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Gao, H., & Olivetti, N. (2026). Taming Complexity in Intuitionistic Modal Logic: The Case of FIK and Its Shallow Calculus. Electronic Proceedings in Theoretical Computer Science, 447, 407-426. https://doi.org/10.4204/eptcs.447.23

Vancouver

Gao H, Olivetti N. Taming Complexity in Intuitionistic Modal Logic: The Case of FIK and Its Shallow Calculus. Electronic Proceedings in Theoretical Computer Science. 2026;447:407-426. doi:10.4204/eptcs.447.23

BibTeX
@article{Gao2026,
  author = {Gao, Han and Olivetti, Nicola},
  title = {Taming Complexity in Intuitionistic Modal Logic: The Case of FIK and Its Shallow Calculus},
  journal = {Electronic Proceedings in Theoretical Computer Science},
  year = {2026},
  volume = {447},
  pages = {407--426},
  doi = {10.4204/eptcs.447.23}
}
Kostenlos starten →