AbstractHere we present a new version of recursion induction principle with an effective and, by the way, mechanizable flavour. Furthermore we obtain a measure of the complexity of equivalences (or inequalities) between recursive programs and also of the difficulty of their proofs
We generalize standard Turing machines working in time ω on a tape of length ω to abstract machines ...
Induction is the process by which we reason from the particular to the general. In this paper we use...
Several induction theorem provers were developed to verify functional programs mechanically. Unfortu...
AbstractHere we present a new version of recursion induction principle with an effective and, by the...
We revisit both the usual ``going-up'' induction principle and Manna and Waldinger's ``going-down'' ...
We revisit both the usual ``going-up'' induction principle and Manna and Waldinger's ``going-down'' ...
The main goal of this paper is to compare recursive algorithms such as Turing machines with such sup...
AbstractThe main goal of this paper is to compare recursive algorithms such as Turing machines with ...
The complexity of equivalence relations has received much attention in the recent literature. The ma...
This paper presents a mechanisation of some basic computability theory. The mechanisation uses two m...
We use the AI proof planning techniques of {\it recursion analysis} and {\it rippling} as tools to a...
The recursive construction of a function f: A → Θ consists, paradigmatically, of finding a functor T...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
We present a technique for the mechanical proof of correctness properties of programs. We define a l...
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-so...
We generalize standard Turing machines working in time ω on a tape of length ω to abstract machines ...
Induction is the process by which we reason from the particular to the general. In this paper we use...
Several induction theorem provers were developed to verify functional programs mechanically. Unfortu...
AbstractHere we present a new version of recursion induction principle with an effective and, by the...
We revisit both the usual ``going-up'' induction principle and Manna and Waldinger's ``going-down'' ...
We revisit both the usual ``going-up'' induction principle and Manna and Waldinger's ``going-down'' ...
The main goal of this paper is to compare recursive algorithms such as Turing machines with such sup...
AbstractThe main goal of this paper is to compare recursive algorithms such as Turing machines with ...
The complexity of equivalence relations has received much attention in the recent literature. The ma...
This paper presents a mechanisation of some basic computability theory. The mechanisation uses two m...
We use the AI proof planning techniques of {\it recursion analysis} and {\it rippling} as tools to a...
The recursive construction of a function f: A → Θ consists, paradigmatically, of finding a functor T...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
We present a technique for the mechanical proof of correctness properties of programs. We define a l...
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-so...
We generalize standard Turing machines working in time ω on a tape of length ω to abstract machines ...
Induction is the process by which we reason from the particular to the general. In this paper we use...
Several induction theorem provers were developed to verify functional programs mechanically. Unfortu...
DOI
Add to ORKG