scientific article

zbMath0517.03022MaRDI QIDQ3665095

Gheorghe Păun, Cristian S. Calude

Publication date: 1983

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

consistent extensionundecidable problemsrecursive arithmeticGoedel numbering

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Scattered context grammars
• Programmed Grammars and Classes of Formal Languages
• Simple matrix languages with a leftmost restriction
• A variant of a recursively unsolvable problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item