Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
LPAR
/
Paper
The Equational Theory of < N, 0, 1, +, , uparrow > Is Decidable, but Not Finitely Axiomatisable.
Roberto Di Cosmo
,
Thomas Dufour
Venue
B
LPAR
Year
2004
Proceedings
LPAR
DBLP record
conf/lpar/CosmoD04 ↗
Browse the full
LPAR paper archive
.