Electronic Notes in Theoretical Computer Science · 2008 · 25 citations · 8 references
Natural SciencesMathematicsAlgebraApplied MathematicsCombinatoricsAbstract AlgebraAlgebraic GeometryUniversal Algebra
Dcpos can be presented by preorders of generators and inequational relations expressed as covers. Algebraic operations on the generators (possibly with their results being ideals of generators) can be extended to the dcpo presented, provided the covers are “stable” for the operations. The resulting dcpo algebra has a natural universal characterization and satisfies all the inequational laws satisfied by the generating algebra. Applications include known “coverage theorems” from locale theory.
8
Constructing Induction Rules for Deductive Synthesis Proofs
Alan Bundy, Lucas Dixon, Jeremy Gow et al. · Electronic Notes in Theoretical Computer Science · 2006 · 2.8K citations · Full text
Samson Abramsky, Achim Jung · Logic in Computer Science · 1995 · 917 citations
Inductively generated formal topologies
Thierry Coquand, Giovanni Sambin, Jan M. Smith et al. · Annals of Pure and Applied Logic · 2003 · 147 citations