[FOM] Least class that ...

[Giuseppina RONZITTI]

José Félix Costa <fgc at math.ist.utl.pt> a écrit:

> The concept you search for is that of an inductive closure. See, e.g. (where
> it is quite well explained), in
>
> Jean H. Gallier
> Logic for Computer Science, Foundations of Automatic Theorem Proving
> Willey (1987)

It may be useful to know that a corrected and revised on-line version of
Gallier's book is online at:

http://www.cis.upenn.edu/~jean/gbooks/logic.html

Best regards,
G.R.
---------------------------------------------------------------
Giuseppina Ronzitti, PhD
CNRS Postdoctoral Research Fellow
LHPS Archives H. Poincaré - (Université Nancy 2)
23 Bd Albert Ier,  BP 33-97 F-54015 Nancy Cedex
Tél / Fax : 33/(0)3 83 96 70 83 -- skype: sonogiusi
email: Giuseppina.Ronzitti at univ-nancy2.fr
homepage: http://www.geocities.com/giuseppina_ronzitti
--------------------------------------------------------------