A formal metatheory in which Goedel's first but not his second incompleteness theorem can be proved
Uloženo v:
| Název: | A formal metatheory in which Goedel's first but not his second incompleteness theorem can be proved |
|---|---|
| Autoři: | Bunder, M. W. |
| Témata: | Decidability of theories and sets of sentences, metatheory, formal systems, Automata and formal grammars in connection with logical questions, Abstract and axiomatic computability and recursion theory, Goedels incompleteness theorems |
| Druh dokumentu: | Article |
| Popis souboru: | application/xml |
| Přístupová URL adresa: | https://zbmath.org/3801507 |
| Přístupové číslo: | edsair.c2b0b933574d..4fe9e77ee59eb8cff90bb98a53a5662d |
| Databáze: | OpenAIRE |
Nájsť tento článok vo Web of Science | Žádný popis. |