Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
TASE
/
Paper
Reachable Completeness Theorem of Order Sorted Equational Logic with Infinite Proofs.
Taeseung Sohn
,
Tsubasa Takagi
Venue
National
TASE
Year
2026
Proceedings
TASE
DBLP record
conf/tase/SohnT26 ↗
Browse the full
TASE paper archive
.