Journal of Symbolic Logic 63 (2):451-478 (1998)
We study logical systems for reasoning about equations involving recursive definitions. In particular, we are interested in "propositional" fragments of the functional language of recursion FLR [18, 17], i.e., without the value passing or abstraction allowed in FLR. The "pure," propositional fragment FLR 0 turns out to coincide with the iteration theories of . Our main focus here concerns the sharp contrast between the simple class of valid identities and the very complex consequence relation over several natural classes of models
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Nonstandard Characterizations of Recursive Saturation and Resplendency.Stuart T. Smith - 1987 - Journal of Symbolic Logic 52 (3):842-863.
0-1 Laws for Recursive Structures.E. Grädel & A. Malmström - 1999 - Archive for Mathematical Logic 38 (4-5):205-215.
A Lift of a Theorem of Friedberg: A Banach-Mazur Functional That Coincides with No Α-Recursive Functional on the Class of Α-Recursive Functions.A. Di Paola Robert - 1981 - Journal of Symbolic Logic 46 (2):216-232.
Proving Consistency of Equational Theories in Bounded Arithmetic.Arnold Beckmann - 2002 - Journal of Symbolic Logic 67 (1):279-296.
Added to index2009-01-28
Total downloads11 ( #385,846 of 2,132,314 )
Recent downloads (6 months)1 ( #391,728 of 2,132,314 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.