Back to Results
First PageMeta Content
Proof theory / Computability theory / Functions and mappings / Theory of computation / Dialectica interpretation / Function / Primitive recursive function / Peano axioms / Well-founded relation / Mathematics / Mathematical logic / Logic


System T and the Product of Selection Functions Martín Escardó1 , Paulo Oliva2 , and Thomas Powell2 1 University of Birmingham Department of Computer Science
Add to Reading List

Document Date: 2011-06-20 06:36:33

Open Document

File Size: 524,99 KB

Share Result on Facebook

City

Paris / /

Company

Creative Commons / Dagstuhl Publishing / Billy / /

Country

Germany / /

Currency

pence / /

/

Event

Reorganization / /

Facility

University of Birmingham Department / Computer Science m.escardo@cs.bham.ac.uk Queen Mary University of London School / /

IndustryTerm

finite product / maximum operator / binary product / finite products / finite product operator / /

Organization

University of London School of Electronic Engineering and Computer Science / Royal Society / University of Birmingham Department of Computer Science / /

Person

T. Powell It / Ai / P. Oliva / M. Escardó / Bill Editors / John Q. Open / /

Position

mp / author / Editor / co-operative / 2nd author / /

Technology

Digital Object Identifier / /

SocialTag