Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
TABLEAUX
/
Paper
Complexity of a Fragment of Infinitary Action Logic with Exponential via Non-well-founded Proofs.
Stepan L. Kuznetsov
Venue
B
TABLEAUX
Year
2021
Proceedings
TABLEAUX
DBLP record
conf/tableaux/Kuznetsov21 ↗
Browse the full
TABLEAUX paper archive
.