Computability Logic (CL) is a theoretical framework developed by Georg Kreisel and further advanced by G. Chaitin, among others. It is an area of logic that seeks to provide a foundation for understanding computation in a formal logical setting. Unlike traditional logics, which focus on truth values and static propositions, Computability Logic emphasizes the concept of computability as a resource.
New to topics? Read the docs here!