Computational inductive definability

DOI10.1016/j.apal.2003.10.013zbMath1052.03021OpenAlexW2085030882MaRDI QIDQ598276

Dexter Kozen

Publication date: 6 August 2004

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2003.10.013

zbMATH Keywords

Descriptive set theoryHereditarily finite setsIND programsInductive definability

Mathematics Subject Classification ID

Descriptive set theory (03E15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Inductive definability (03D70) Abstract and axiomatic computability and recursion theory (03D75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalences among logics of programs
• ``During cannot be expressed by ``after
• Descriptive set theory
• Elementary induction on abstract structures
• A programming language for the inductive sets, and applications
• Unbounded program memory adds to the expressive power of first-order programming logic
• Alternation
• Abstract First Order Computability. I
• The next admissible set

This page was built for publication: Computational inductive definability