Graded Multicategories of Polynomial-time Realizers (Extended Abstract) (1989)
| Venue: | DEPARTMENT OF MATHEMATICS DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE MCGILL UNIVERSITY JOHN ABBOTT COLLEGE MONASH UNIVERSITY 805 SHERBROOKE ST |
| Citations: | 1 - 1 self |
BibTeX
@INPROCEEDINGS{Seely89gradedmulticategories,
author = {R.A.G. Seely},
title = {Graded Multicategories of Polynomial-time Realizers (Extended Abstract)},
booktitle = {DEPARTMENT OF MATHEMATICS DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE MCGILL UNIVERSITY JOHN ABBOTT COLLEGE MONASH UNIVERSITY 805 SHERBROOKE ST},
year = {1989},
publisher = {Australia Canada Canada}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a logical calculus which imposes a grading on a sequent-style calculus to account for the runtime of the programmes represented by the sequents. This system is sound for a notion of polynomial-time realizability. An extension of the grading is also considered, giving a notion of "dependant grades", which is also sound. Furthermore, we define a notion of closed graded multicategory, and show how the structure of polynomial-time realizers has that structure.
Citations
| 541 | Linear Logic - Girard - 1987 |
| 209 | Investigations into logical deduction - Gentzen - 1969 |
| 79 | Functional interpretations of feasibly constructive arithmetic - Cook, Urquhart - 1993 |
| 26 | Deductive systems and categories - Lambek - 1968 |
| 13 | Multicategories revisited - Lambek - 1987 |
| 13 | Hyperdoctrines, natural deduction and the Beck condition - Seely - 1983 |
| 6 | Deductive systems and categories II - Lambek - 1969 |
| 3 | Polynomially graded logic - Nerode, Remmel, et al. - 1989 |
| 2 | Bounded Arithmetic, Doctoral dissertation - Buss - 1985 |
| 2 | The polynomial time hierarchy and intuitionistic bounded arithmetic - Buss - 1986 |
| 2 | Proofs, programs and run-times - Crossley - 1989 |
| 1 | A logical calculus for polynomial time realizability - Crossley, Mathai, et al. - 1989 |
