Undecidable theories.
Suppose we are given a mathematical theory. Is there an effective procedure which will enable us to decide, for any sentence of the theory, whether or not the sentence is valid in that theory? This is referred to as the decision problem for that theory. If it is answered in the affirmative we say th...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
McGill University
1961
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=113389 |
| id |
ndltd-LACETR-oai-collectionscanada.gc.ca-QMM.113389 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-LACETR-oai-collectionscanada.gc.ca-QMM.1133892014-02-13T03:56:53ZUndecidable theories.Feldman, Norman.Mathematics.Suppose we are given a mathematical theory. Is there an effective procedure which will enable us to decide, for any sentence of the theory, whether or not the sentence is valid in that theory? This is referred to as the decision problem for that theory. If it is answered in the affirmative we say that the theory is decidable. If the answer is negative, then we say that the theory is undecidable. There are essentially two methods with which to attack this problem; the direct method and the indirect method.McGill UniversityLambek, J. (Supervisor)1961Electronic Thesis or Dissertationapplication/pdfenalephsysno: NNNNNNNNNTheses scanned by McGill Library.All items in eScholarship@McGill are protected by copyright with all rights reserved unless otherwise indicated.Master of Science. (Department of Mathematics.) http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=113389 |
| collection |
NDLTD |
| language |
en |
| format |
Others
|
| sources |
NDLTD |
| topic |
Mathematics. |
| spellingShingle |
Mathematics. Feldman, Norman. Undecidable theories. |
| description |
Suppose we are given a mathematical theory. Is there an effective procedure which will enable us to decide, for any sentence of the theory, whether or not the sentence is valid in that theory? This is referred to as the decision problem for that theory. If it is answered in the affirmative we say that the theory is decidable. If the answer is negative, then we say that the theory is undecidable. There are essentially two methods with which to attack this problem; the direct method and the indirect method. |
| author2 |
Lambek, J. (Supervisor) |
| author_facet |
Lambek, J. (Supervisor) Feldman, Norman. |
| author |
Feldman, Norman. |
| author_sort |
Feldman, Norman. |
| title |
Undecidable theories. |
| title_short |
Undecidable theories. |
| title_full |
Undecidable theories. |
| title_fullStr |
Undecidable theories. |
| title_full_unstemmed |
Undecidable theories. |
| title_sort |
undecidable theories. |
| publisher |
McGill University |
| publishDate |
1961 |
| url |
http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=113389 |
| work_keys_str_mv |
AT feldmannorman undecidabletheories |
| _version_ |
1716641924390060032 |