Computational inductive definability
type: Item
instance of: scholarly article
title: Computational inductive definability
zbMATH Open document ID: 1052.03021
author: Dexter Kozen
published in: Annals of Pure and Applied Logic
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 03D70
Mathematics Subject Classification ID: 03D60
Mathematics Subject Classification ID: 03D75
Mathematics Subject Classification ID: 03E15
zbMATH DE Number: 2083177
zbMATH Keywords: IND programs
zbMATH Keywords: Inductive definability
zbMATH Keywords: Hereditarily finite sets
zbMATH Keywords: Descriptive set theory
MaRDI profile type: Publication
full work available at URL: j.apal.2003.10.013
OpenAlex ID: W2085030882
cites work: Q4075450
cites work: The next admissible set
cites work: Alternation
cites work: Q3953160
cites work: A programming language for the inductive sets, and applications
cites work: Q4525781
cites work: Q3968454
cites work: Equivalences among logics of programs
cites work: Abstract First Order Computability. I
cites work: Elementary induction on abstract structures
cites work: Descriptive set theory
cites work: Unbounded program memory adds to the expressive power of first-order programming logic
cites work: Q3785901
cites work: ``During'' cannot be expressed by ``after''
DOI: 10.1016/J.APAL.2003.10.013
Recommended article: New Computational Paradigms
Recommended article: Q4661264
Recommended article: Computability and Definability
Recommended article: Q4247256
Recommended article: On the complexity of inductive definitions
Recommended article: Q4486652
Recommended article: Abstract Computability and Invariant Definability
Recommended article: Computational adequacy via ‘mixed’ inductive definitions
Recommended article: Non-Deterministic Inductive Definitions and Fullness
Recommended article: Intensionality, Definability and Computation
description: scientific article; zbMATH DE number 2083177