A formal metatheory in which Goedel's first but not his second incompleteness theorem can be proved
Saved in:
| Title: | A formal metatheory in which Goedel's first but not his second incompleteness theorem can be proved |
|---|---|
| Authors: | Bunder, M. W. |
| Subject Terms: | 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 |
| Document Type: | Article |
| File Description: | application/xml |
| Access URL: | https://zbmath.org/3801507 |
| Accession Number: | edsair.c2b0b933574d..4fe9e77ee59eb8cff90bb98a53a5662d |
| Database: | OpenAIRE |
Nájsť tento článok vo Web of Science | Description not available. |