Computability in Europe 2008
Logic and Theory of Algorithms

Print current page  Print this page

Regular Talk:
Inductive Definitions over Domain Representable Spaces

Edit abstract data

Speaker: Petter Kristian Køber
Slot: Wed, 11:50-12:10, Amphitheater B (col. 2)

Abstract

In this talk, we study positive inductive definitions over a class of T_{0}
quotients of countably based spaces (qcb_{0} spaces).
In particular, we prove that if A and B are qcb_{0} spaces, then there exists a
minimal qcb_{0} space X satisfying the equation  X = A  + [ B => X ]. This
least fixed point is obtained via a similar construction over a certain class of
domains with partial equivalence relations, using standard domain
representations of A and B. In fact, a least fixed point exists for every
strictly positive operator.  
Further generalisations, e.g. admitting generalised positive induction or free
algebra constructions in the defining equation, tend to somewhat complicate the
situation.

websites: Arnold Beckmann 2008-05-30 Valid HTML 4.01! Valid CSS!