The Inherent Computational Complexity of Theories of Ordered Sets: A Brief Survery
| Main Author: | |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/148882 |
| _version_ | 1826214508712951809 |
|---|---|
| author | Meyer, Albert R. |
| author_facet | Meyer, Albert R. |
| author_sort | Meyer, Albert R. |
| collection | MIT |
| first_indexed | 2024-09-23T16:06:53Z |
| id | mit-1721.1/148882 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T16:06:53Z |
| publishDate | 2023 |
| record_format | dspace |
| spelling | mit-1721.1/1488822023-03-30T03:07:33Z The Inherent Computational Complexity of Theories of Ordered Sets: A Brief Survery Meyer, Albert R. 2023-03-29T14:04:44Z 2023-03-29T14:04:44Z 1974-10 https://hdl.handle.net/1721.1/148882 02068422 MIT-LCS-TM-054 MAC-TM-054 application/pdf |
| spellingShingle | Meyer, Albert R. The Inherent Computational Complexity of Theories of Ordered Sets: A Brief Survery |
| title | The Inherent Computational Complexity of Theories of Ordered Sets: A Brief Survery |
| title_full | The Inherent Computational Complexity of Theories of Ordered Sets: A Brief Survery |
| title_fullStr | The Inherent Computational Complexity of Theories of Ordered Sets: A Brief Survery |
| title_full_unstemmed | The Inherent Computational Complexity of Theories of Ordered Sets: A Brief Survery |
| title_short | The Inherent Computational Complexity of Theories of Ordered Sets: A Brief Survery |
| title_sort | inherent computational complexity of theories of ordered sets a brief survery |
| url | https://hdl.handle.net/1721.1/148882 |
| work_keys_str_mv | AT meyeralbertr theinherentcomputationalcomplexityoftheoriesoforderedsetsabriefsurvery AT meyeralbertr inherentcomputationalcomplexityoftheoriesoforderedsetsabriefsurvery |