Computational inductive definability
From MaRDI portal
Publication:598276
DOI10.1016/J.APAL.2003.10.013zbMATH Open1052.03021OpenAlexW2085030882MaRDI QIDQ598276FDOQ598276
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
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
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)
Cites Work
- Elementary induction on abstract structures
- Title not available (Why is that?)
- Descriptive set theory
- Alternation
- Title not available (Why is that?)
- Equivalences among logics of programs
- ``During cannot be expressed by ``after
- A programming language for the inductive sets, and applications
- Unbounded program memory adds to the expressive power of first-order programming logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Abstract First Order Computability. I
- The next admissible set
Cited In (7)
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)
