Decision problems for multiple successor arithmetics: technical report
Let N sub k denote the set of words over the alphabet S sub k = (1 ..., k). N sub k contains the null word which is denoted. Decision problems are considered for various first-order interpreted predicate languages in which the variables range over N sub k (k> 2). The main result is that there is...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ann Arbor, Mich.
Univ. of Michigan, Office of Research Administration
1965
|
| Schlagworte: | |
| Zusammenfassung: | Let N sub k denote the set of words over the alphabet S sub k = (1 ..., k). N sub k contains the null word which is denoted. Decision problems are considered for various first-order interpreted predicate languages in which the variables range over N sub k (k> 2). The main result is that there is no decision procedure for truth in the interpreted language which has the subword relation as its only non-logical primitive. This, together with known results summarized in the report, settles the decision problem for any language constructed on the basis of a large number of relations and functions. (Author) |
| Beschreibung: | 20 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV039987529 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 120327s1965 t||| 00||| eng d | ||
| 027 | |a 03105-36-T | ||
| 035 | |a (OCoLC)918470675 | ||
| 035 | |a (DE-599)BVBBV039987529 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 100 | 1 | |a Thatcher, James Winthrop |e Verfasser |0 (DE-588)173798284 |4 aut | |
| 245 | 1 | 0 | |a Decision problems for multiple successor arithmetics |b technical report |c J. W. Thatcher |
| 264 | 1 | |a Ann Arbor, Mich. |b Univ. of Michigan, Office of Research Administration |c 1965 | |
| 300 | |a 20 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | |a Let N sub k denote the set of words over the alphabet S sub k = (1 ..., k). N sub k contains the null word which is denoted. Decision problems are considered for various first-order interpreted predicate languages in which the variables range over N sub k (k> 2). The main result is that there is no decision procedure for truth in the interpreted language which has the subword relation as its only non-logical primitive. This, together with known results summarized in the report, settles the decision problem for any language constructed on the basis of a large number of relations and functions. (Author) | ||
| 650 | 4 | |a ARITHMETIC | |
| 650 | 7 | |a Decision theory |2 dtict | |
| 650 | 7 | |a Mathematical logic |2 dtict | |
| 650 | 7 | |a Automata |2 dtict | |
| 650 | 7 | |a Metamathematics |2 dtict | |
| 650 | 7 | |a Recursive functions |2 dtict | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024844742 | ||
Datensatz im Suchindex
| _version_ | 1804148974730346496 |
|---|---|
| any_adam_object | |
| author | Thatcher, James Winthrop |
| author_GND | (DE-588)173798284 |
| author_facet | Thatcher, James Winthrop |
| author_role | aut |
| author_sort | Thatcher, James Winthrop |
| author_variant | j w t jw jwt |
| building | Verbundindex |
| bvnumber | BV039987529 |
| ctrlnum | (OCoLC)918470675 (DE-599)BVBBV039987529 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01626nam a2200337 c 4500</leader><controlfield tag="001">BV039987529</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">120327s1965 t||| 00||| eng d</controlfield><datafield tag="027" ind1=" " ind2=" "><subfield code="a">03105-36-T</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)918470675</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039987529</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Thatcher, James Winthrop</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)173798284</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Decision problems for multiple successor arithmetics</subfield><subfield code="b">technical report</subfield><subfield code="c">J. W. Thatcher</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ann Arbor, Mich.</subfield><subfield code="b">Univ. of Michigan, Office of Research Administration</subfield><subfield code="c">1965</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Let N sub k denote the set of words over the alphabet S sub k = (1 ..., k). N sub k contains the null word which is denoted. Decision problems are considered for various first-order interpreted predicate languages in which the variables range over N sub k (k> 2). The main result is that there is no decision procedure for truth in the interpreted language which has the subword relation as its only non-logical primitive. This, together with known results summarized in the report, settles the decision problem for any language constructed on the basis of a large number of relations and functions. (Author)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">ARITHMETIC</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Decision theory</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematical logic</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automata</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Metamathematics</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Recursive functions</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024844742</subfield></datafield></record></collection> |
| id | DE-604.BV039987529 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T00:15:40Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024844742 |
| oclc_num | 918470675 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | 20 S. |
| publishDate | 1965 |
| publishDateSearch | 1965 |
| publishDateSort | 1965 |
| publisher | Univ. of Michigan, Office of Research Administration |
| record_format | marc |
| spelling | Thatcher, James Winthrop Verfasser (DE-588)173798284 aut Decision problems for multiple successor arithmetics technical report J. W. Thatcher Ann Arbor, Mich. Univ. of Michigan, Office of Research Administration 1965 20 S. txt rdacontent n rdamedia nc rdacarrier Let N sub k denote the set of words over the alphabet S sub k = (1 ..., k). N sub k contains the null word which is denoted. Decision problems are considered for various first-order interpreted predicate languages in which the variables range over N sub k (k> 2). The main result is that there is no decision procedure for truth in the interpreted language which has the subword relation as its only non-logical primitive. This, together with known results summarized in the report, settles the decision problem for any language constructed on the basis of a large number of relations and functions. (Author) ARITHMETIC Decision theory dtict Mathematical logic dtict Automata dtict Metamathematics dtict Recursive functions dtict |
| spellingShingle | Thatcher, James Winthrop Decision problems for multiple successor arithmetics technical report ARITHMETIC Decision theory dtict Mathematical logic dtict Automata dtict Metamathematics dtict Recursive functions dtict |
| title | Decision problems for multiple successor arithmetics technical report |
| title_auth | Decision problems for multiple successor arithmetics technical report |
| title_exact_search | Decision problems for multiple successor arithmetics technical report |
| title_full | Decision problems for multiple successor arithmetics technical report J. W. Thatcher |
| title_fullStr | Decision problems for multiple successor arithmetics technical report J. W. Thatcher |
| title_full_unstemmed | Decision problems for multiple successor arithmetics technical report J. W. Thatcher |
| title_short | Decision problems for multiple successor arithmetics |
| title_sort | decision problems for multiple successor arithmetics technical report |
| title_sub | technical report |
| topic | ARITHMETIC Decision theory dtict Mathematical logic dtict Automata dtict Metamathematics dtict Recursive functions dtict |
| topic_facet | ARITHMETIC Decision theory Mathematical logic Automata Metamathematics Recursive functions |
| work_keys_str_mv | AT thatcherjameswinthrop decisionproblemsformultiplesuccessorarithmeticstechnicalreport |