Graduate studies at Western
Journal of Symbolic Logic 67 (1):279-296 (2002)
|Abstract||We consider equational theories for functions defined via recursion involving equations between closed terms with natural rules based on recursive definitions of the function symbols. We show that consistency of such equational theories can be proved in the weak fragment of arithmetic S 1 2 . In particular this solves an open problem formulated by TAKEUTI (c.f. [5, p.5 problem 9.])|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Glaudio Bernardi (1975). On the Equational Class of Diagonalizable Algebras. Studia Logica 34 (4):321 - 331.
Richard Pettigrew (2009). On Interpretations of Bounded Arithmetic and Bounded Set Theory. Notre Dame Journal of Formal Logic 50 (2):141-152.
Franco Montagna (1975). For Everyn, Then-Freely Generated Algebra is Not Functionally Free in the Equational Class of Diagonalizable Algebras. Studia Logica 34 (4):315 - 319.
Markus Junker & Ingo Kraus (2002). Theories with Equational Forking. Journal of Symbolic Logic 67 (1):326-340.
Leszek Aleksander Kołodziejczyk (2006). On the Herbrand Notion of Consistency for Finitely Axiomatizable Fragments of Bounded Arithmetic Theories. Journal of Symbolic Logic 71 (2):624 - 638.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #291,948 of 722,936 )
Recent downloads (6 months)1 ( #61,087 of 722,936 )
How can I increase my downloads?