Computational inductive definability

DOI10.1016/J.APAL.2003.10.013MaRDI QIDQ598276zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• New Computational Paradigms
• scientific article; zbMATH DE number 2151710
• Computability and Definability
• scientific article; zbMATH DE number 1302017
• On the complexity of inductive definitions
• scientific article; zbMATH DE number 1467185
• Abstract Computability and Invariant Definability
• Computational adequacy via ‘mixed’ inductive definitions
• Non-deterministic inductive definitions and fullness
• Intensionality, definability and computation

Cites work

• scientific article; zbMATH DE number 4049005 (Why is no real title available?)
• scientific article; zbMATH DE number 3772938 (Why is no real title available?)
• scientific article; zbMATH DE number 3791602 (Why is no real title available?)
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 1556014 (Why is no real title available?)
• A programming language for the inductive sets, and applications
• Abstract First Order Computability. I
• Alternation
• Descriptive set theory
• Elementary induction on abstract structures
• Equivalences among logics of programs
• The next admissible set
• Unbounded program memory adds to the expressive power of first-order programming logic
• ``During cannot be expressed by ``after

Cited in

(7)

• On the complexity of inductive definitions
• A programming language for the inductive sets, and applications
• \(\Pi_1^0\)-positive inductive definability on abstract structures
• scientific article; zbMATH DE number 2151710 (Why is no real title available?)
• New Computational Paradigms
• Definability by turing machines
• scientific article; zbMATH DE number 6863850 (Why is no real title available?)

This page was built for publication: Computational inductive definability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598276)