The notion of recursiveness is treated in a model-theoretical way by using a particular instance of Kreisel's definition of 'invariant definability'. Naming the chosen notion 'finite describability', a number of basic definitions and properties are defined and proved. As one would expect, these properties coincide with the ones for recursion theory. The equivalences of finite describability and recursiveness bring model theory and recursion theory slightly together.Science, Faculty ofMathematics, Department ofGraduat
This paper presents a generalized paradigm for formal learning theory, of which language leamability...
This book presents the main results of descriptive complexity theory, that is, the connections betwe...
Abstract Induction-recursion is a schema which formalizes the principles for introducing new sets in...
The notion of recursiveness is treated in a model-theoretical way by using a particular instance of ...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
'We int¡oduce recursively invariant p-recursion theory as a new approach towards recursion theo...
We study iteration and recursion operators in the multiset relational model of linear logic and prov...
SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Co...
AbstractMoschovakis (1984, in “Computation and Proof Theory” (Y. Richter et al., Eds.), Lect. Notes ...
AbstractWe introduce recursively invariant β-recursion theory as a new approach towards recursion th...
The SAGE Encyclopedia of Human Communication Sciences and DisordersRecursion is a mathematical princ...
Abstract: Disjunctive finitary programs are a class of logic programs admitting function symbols an...
It is a truism that conceptual understanding of a hypothesis is required for its empirical investiga...
: This paper continues our work on infinite, recursive structures. We investigate the descriptive co...
When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classic...
This paper presents a generalized paradigm for formal learning theory, of which language leamability...
This book presents the main results of descriptive complexity theory, that is, the connections betwe...
Abstract Induction-recursion is a schema which formalizes the principles for introducing new sets in...
The notion of recursiveness is treated in a model-theoretical way by using a particular instance of ...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
'We int¡oduce recursively invariant p-recursion theory as a new approach towards recursion theo...
We study iteration and recursion operators in the multiset relational model of linear logic and prov...
SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Co...
AbstractMoschovakis (1984, in “Computation and Proof Theory” (Y. Richter et al., Eds.), Lect. Notes ...
AbstractWe introduce recursively invariant β-recursion theory as a new approach towards recursion th...
The SAGE Encyclopedia of Human Communication Sciences and DisordersRecursion is a mathematical princ...
Abstract: Disjunctive finitary programs are a class of logic programs admitting function symbols an...
It is a truism that conceptual understanding of a hypothesis is required for its empirical investiga...
: This paper continues our work on infinite, recursive structures. We investigate the descriptive co...
When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classic...
This paper presents a generalized paradigm for formal learning theory, of which language leamability...
This book presents the main results of descriptive complexity theory, that is, the connections betwe...
Abstract Induction-recursion is a schema which formalizes the principles for introducing new sets in...