 Logics for computability

"Logics for computability" generally refers to various formal systems and logical frameworks used to study computability, decidability, and related concepts in theoretical computer science and mathematical logic. This field intersects with areas such as recursion theory, model theory, and proof theory, focusing on the relationship between logic and computational processes.