In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions ...
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...
We study the formal rst order system Tind in the standard language of Gentzen's LK. Tind extends LK by the purely logical rule of term-induction, that is a restricted inductio...
In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the ...
Abstract. The following problem will be considered: from scattered examples on the behavior of a dynamic system induce a description of the system. For the induced description to b...