Skip to main navigation
Skip to search
Skip to main content
University of Birmingham Home
Help & FAQ
Home
Research output
Profiles
Research units
Projects
Activities
Datasets
Equipment
Prizes
Press/Media
Search by expertise, name or affiliation
A circular version of Gödel's T and its abstraction complexity
Anupam Das
Computer Science
Research output
:
Working paper/Preprint
›
Preprint
13
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A circular version of Gödel's T and its abstraction complexity'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Abstraction
100%
Recursion
89%
Strong Normalization
60%
Confluence
56%
Quantifiers
48%
Proof by induction
45%
Model-based
41%
Correspondence
37%
Computing
28%
Term
24%
Form
18%