19 citations · 42 across the 6 of their papers we have counts for
1 paper · 2 filters
Mark V. Lawson, Philip Scott
A countably infinite Boolean inverse monoid that can be written as an increasing union of finite Boolean inverse monoids (suitably embedded) is said to be of finite type. Borrowing…