scientific article; zbMATH DE number 3817693

MaRDI QIDQ3665095zbMATH OpenFDO

Authors Gheorghe Păun, Cristian S. Calude

Publication date 1983

Full work available at URL https://eudml.org/doc/92177

zbMATH Keywords

consistent extensionGoedel numberingrecursive arithmeticundecidable problems

Mathematics Subject Classification ID

Computability and recursion theory (03D99) Relative consistency and interpretations (03F25) Proof theory and constructive mathematics (03F99)

Cites work

• A variant of a recursively unsolvable problem
• scientific article; zbMATH DE number 3539209 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3336816 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Programmed Grammars and Classes of Formal Languages
• Scattered context grammars
• Simple matrix languages with a leftmost restriction

Cited in

(3)

• Is independence an exception?
• Incompleteness and the halting problem
• Is complexity a source of incompleteness?

This page was built for publication:

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