Proof Theory in Computer Science | Zendy

Reinhard Kähle | Zendy; Peter SchroederHeister | Zendy; Robert F. Stärk | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Proof Theory in Computer Science

Author(s) -

Reinhard Kähle,

Peter SchroederHeister,

Robert F. Stärk

Publication year - 2001

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/3-540-45504-3

Subject(s) - computer science , proof theory , structural proof theory , proof of concept , mathematical logic , theoretical computer science , calculus (dental) , programming language , mathematical proof , mathematics , operating system , medicine , geometry , dentistry

A typed lambda calculus with recursion in all finite types is defined such that the first order terms exactly characterize the parallel complexity class NC. This is achieved by use of the appropriate forms of recursion (concatenation recursion and logarithmic recursion), a ramified type structure and imposing of a linearity constraint.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research