From: Luigi Santocanale <luigis@brics.dk>
To: "Categories@Mta. Ca" <categories@mta.ca>
Subject: Re: coinduction: definable equationally?
Date: Thu, 02 Nov 2000 18:09:10 +0100 [thread overview]
Message-ID: <3A019FB6.2454C847@brics.dk> (raw)
In-Reply-To: <200010280923.CAA10190@coraki.Stanford.EDU>
Vaughan Pratt wrote:
> We may now reword the original question in the light of the foregoing.
> To what variety can one similarly associate suitable operations fully
> defined equationally so as to include an equationally expressed principal
> of coinduction?
In the same way an induction principle is expressible by means of a
least fixed point, one could expect coinductive principles to be
expressible by means of greatest fixed points.
The following example will clarify what I have in mind.
Let G,H two graphs, then we can construct the graph G*H, where
(G*H)_0 = G_0 x H_0
and
(G*H)_1 = (G_1 x H_0) + (G_0 x H_1) .
Every transition of G*H is labeled: it is either a left transition or a
right transition. We obtain in this way two modal operators on the
subsets of G_0 x H_0, call them <l> and <r>. A bisimulation is a subset
B of G_0 x H_0 such that
B <= [r]<l>B and B <= [l]<r> ,
where the [] are the duals of <>. If G = H, then saying that G has no
proper quotient amounts to saying that the greatest bisimulation is
equal to the diagonal D. Therefore a principle of coinduction can be
expressed as follows:
\nu_z.([r]<l>z \wedge [l]<r>z) = D
where \nu_z.f(z) is the greatest fixed point of f(z). The example can be
generalized.
The following question arises: is the greatest postfixed point definable
equationally? The answer is yes, at least in several cases, as it is the
least prefixed point.
Consider a theory which contains the signature <0,+,.,\>. <0,+> satisfy
the semilattice axioms and, with respect to induced order, a.x is left
adjoint to a\x, for a fixed a. Let f(z) be any term of the theory, then
the following holds:
g(x) is the parameterized least prefixed point of f(z).x if and only if
the equations
f(g(x)).x = g(x)
g(x) <= g(x+y)
g(f(x)\x) <= x
hold.
It is an easy exercise to check this is true, using the fact that
f(x).(f(x)\x) <= x . If . has a right unit 1, then g(1) is the least
prefixed point of f(z). Similar results hold for the greatest postfixed
point if we can find an operation . with a parameterized right adjoint.
Algebraic models of the propositional $\mu$-calculus form a variety, as
the models of PDL do, and hopefully coinductive principles can be
expressed. One could also define something like a $\mu$-linear logic,
its models would form a variety.
Best regards,
Luigi
--
Luigi Santocanale,
BRICS
Department of Computer Science Telephone: +45 8942 3288
University of Aarhus Telefax: +45 8942 3255
Ny Munkegade, building 540 http://www.brics.dk/~luigis/
DK - 8000 Århus C, Denmark. mailto:luigis@brics.dk
next prev parent reply other threads:[~2000-11-02 17:09 UTC|newest]
Thread overview: 6+ messages / expand[flat|nested] mbox.gz Atom feed top
2000-10-27 20:40 coinduction Jesse F. Hughes
2000-10-28 9:23 ` coinduction: definable equationally? Vaughan Pratt
2000-10-28 20:54 ` Jesse F. Hughes
2000-10-30 0:32 ` Andrej Bauer
2000-11-02 17:09 ` Luigi Santocanale [this message]
2000-10-30 3:38 ` coinduction Dusko Pavlovic
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=3A019FB6.2454C847@brics.dk \
--to=luigis@brics.dk \
--cc=categories@mta.ca \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).