Back to Results
First PageMeta Content
Mathematical logic / Recursion / Theory of computation / Functions and mappings / Programming idioms / Primitive recursive function / Well-founded relation / ELEMENTARY / Fold / Computability theory / Mathematics / Theoretical computer science


Predicative Lexicographic Path Orders: Towards a Maximal Model for Primitive Recursive Functions∗ Naohi Eguchi Institute of Computer Science, University of Innsbruck, Austria
Add to Reading List

Document Date: 2013-08-26 10:13:12

Open Document

File Size: 331,54 KB

Share Result on Facebook

City

London / New York / /

Company

Simmons / Cambridge University Press / EPO / Term Rewriting Systems / /

Country

Austria / /

/

Facility

University of Innsbruck / Primitive Recursive Functions∗ Naohi Eguchi Institute of Computer Science / /

Organization

Cambridge University / University of Innsbruck / Primitive Recursive Functions∗ Naohi Eguchi Institute of Computer Science / /

Person

Proof Theory / /

Position

author / Maximal Model for Primitive Recursive Functions / /

ProvinceOrState

New York / /

PublishedMedium

Theoretical Computer Science / Lecture Notes in Computer Science / /

Technology

Digital Object Identifier / /

SocialTag