๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the theory of recursion operators

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
74 KB
Volume
11
Category
Article
ISSN
0167-2789

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the proof theory of type two function
On the proof theory of type two functionals based on primitive recursive operations
โœ David Steiner; Thomas Strahm ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 209 KB

## Abstract This paper is a companion to work of Feferman, Jรคger, GlaรŸ, and Strahm on the proof theory of the type two functionals __ฮผ__ and E~1~ in the context of Fefermanโ€style applicative theories. In contrast to the previous work, we analyze these two functionals in the context of Schlรผter's we

Recursion operators and constants of mot
Recursion operators and constants of motion in supermechanics
โœ JosรฉF. Cariรฑena; Hรฉctor Figueroa ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 857 KB

We prove that only even graded Poisson brackets can be characterized by the vanishing of the graded Schouten bracket of the associated graded tensor of type (0.2) with itself. On the other hand. we prove that the supertraces of different powers of an invariant graded tensor of type (I, I ) are const

Recursiveness of ฯ‰-Operations
Recursiveness of ฯ‰-Operations
โœ Victor L. Selivanov ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 123 KB

## Abstract It is well known that any finitary operation is recursive in a suitable total numeration. A. Orlicki showed that there is an ฯ‰โ€operation not recursive in any total numeration. We will show that any ฯ‰โ€operation is recursive in a partial numeration. Mathematics Subject Classification: 03