DOIAbstract
AbstractThis paper is concerned with the existence and properties of various fixpoints of nondeterministic recursive definitions
AbstractThis paper is concerned with the existence and properties of various fixpoints of nondeterministic recursive definitions
This paper studies parallel recursion. The trace specification language used in this paper incorpor...
AbstractA general functorial framework for recursive definitions is presented in which simulation of...
AbstractThis paper develops a transformational paradigm by which nonnumerical algorithms are treated...
This paper is concerned with the relationship between the computational and fixpoint semantics of no...
AbstractIn this paper, we investigate the structural properties of the set of fixpoints for the clas...
AbstractThis paper is concerned with the existence and properties of various fixpoints of nondetermi...
AbstractThe classical method for constructing the least fixedpoint of a recursive definition is to g...
This paper studies parallel recursion. The trace specification language used in this paper incorpora...
AbstractThis paper studies parallel recursion. The trace specification language used in this paper i...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
AbstractIn applicative theories the recursion theorem provides a term rec which solves recursive equ...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
Non-deterministic computations are conventionally modelled by lists of their outcomes. This approach...
A general functorial framework for recursive definitions is presented in which simulation of a defin...
It is shown how Gödel's famous diagonal argument and a generalization of the recursion theorem are d...
This paper studies parallel recursion. The trace specification language used in this paper incorpor...
AbstractA general functorial framework for recursive definitions is presented in which simulation of...
AbstractThis paper develops a transformational paradigm by which nonnumerical algorithms are treated...
This paper is concerned with the relationship between the computational and fixpoint semantics of no...
AbstractIn this paper, we investigate the structural properties of the set of fixpoints for the clas...
AbstractThis paper is concerned with the existence and properties of various fixpoints of nondetermi...
AbstractThe classical method for constructing the least fixedpoint of a recursive definition is to g...
This paper studies parallel recursion. The trace specification language used in this paper incorpora...
AbstractThis paper studies parallel recursion. The trace specification language used in this paper i...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
AbstractIn applicative theories the recursion theorem provides a term rec which solves recursive equ...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
Non-deterministic computations are conventionally modelled by lists of their outcomes. This approach...
A general functorial framework for recursive definitions is presented in which simulation of a defin...
It is shown how Gödel's famous diagonal argument and a generalization of the recursion theorem are d...
This paper studies parallel recursion. The trace specification language used in this paper incorpor...
AbstractA general functorial framework for recursive definitions is presented in which simulation of...
AbstractThis paper develops a transformational paradigm by which nonnumerical algorithms are treated...
Add to ORKG