Decidability without mathematics

DOI10.1016/J.APAL.2003.11.029MaRDI QIDQ598296zbMATH OpenOpenAlexFDO

Authors Andrzej Grzegorczyk

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.11.029

zbMATH Keywords

decidabilityrecursivenesscomputabilityconcatenationrepresentabilityelementary theory of textsname discernibility

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Undecidability and degrees of sets of sentences (03D35) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• Undecidability without arithmetization
• scientific article; zbMATH DE number 515370
• Logical undecidabilities made easy
• Decidability and universality in the axiomatic theory of computability and algorithms
• Arithmetic Sinn and Effectiveness

Cited in

(7)

• scientific article; zbMATH DE number 7644092 (Why is no real title available?)
• Undecidability without arithmetization
• The decision problem for effective procedures
• Arithmetic Sinn and Effectiveness
• Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
• Foundations for the formalization of metamathematics and axiomatizations of consequence theories
• Logical undecidabilities made easy

This page was built for publication: Decidability without mathematics

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