Kleene's T predicate

Known as: Kleene normal form theorem, Kleene's normal form theorem, Normal form theorem

In computability theory, the T predicate, first studied by mathematician Stephen Cole Kleene, is a particular set of triples of natural numbers that…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

Keeping the balance of nature is important, and it is very significant to effectively control the number of species for ecosystem…

2015

The note offers a proof of Darboux and Liouville theorems from a symplectic group action perspective.

2010

We identify weak semirings, which drop the right annihilation axiom a0 = 0, as a common foundation for partial, total and general…

2009

A classical while-program normal-form theorem is derived in demonic refinement algebra. In contrast to Kozen's partial…

2007

This paper develops a constructive method for nding a nilpotent basis for a special class of smooth nonholonomic distributions…

1992

We introduce m-valued locally definable acceptance types, a new model generalizing the idea of alternating machines and their…

1991

For every positive integer k, fc-limited ETOL systems provide a limitation of the parallel rewriting of ETOL systems. In such…

1977

For an m-complete lattice L (m is an infinite regular cardinal) and subset X of L that m-generates L, we prove a Normal Form…

1970

In Chapter 6 of their book [l] Curry and Feys define a notion of reduction (strong reduction) for the extensional theory of…

1969

In this paper we present an axiomatic theory within which much of the theory of computability can be developed in an abstract…