1 citations · 1 across the 1 of their papers we have counts for
1 paper
Petter Kristian Køber
Recursive domain equations have natural solutions. In particular there are domains defined by strictly positive induction. The class of countably based domains gives a computabilit…