Decidability without mathematics

DOI10.1016/J.APAL.2003.11.029zbMath1056.03023OpenAlexW1972658324MaRDI QIDQ598296

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

representabilitydecidabilitycomputabilityrecursivenessconcatenationelementary theory of textsname discernibility

Mathematics Subject Classification ID

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

Related Items (2)

Foundations for the formalization of metamathematics and axiomatizations of consequence theories ⋮ Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)

This page was built for publication: Decidability without mathematics