Inductive definitions with decidable atomic formulas

DOI10.1007/3-540-63172-0_53MaRDI QIDQ4362932zbMATH OpenFDO

Authors Anton Setzer

Publication date 13 November 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63172-0_53

zbMATH Keywords

constructive proofsextraction of programs from classical proofstype theory for infinitely branching trees

Mathematics Subject Classification ID

Proof theory and constructive mathematics (03F99) General topics in the theory of software (68N01)

Recommendations

• scientific article; zbMATH DE number 2077110
• Inductive families
• A TYPE-FREE THEORY OF HALF-MONOTONE INDUCTIVE DEFINITIONS

Cited in

(2)

• A second order theory of infinite trees
• Decidability results for sets with atoms

This page was built for publication: Inductive definitions with decidable atomic formulas

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