An undecidable problem in correspondence theory (Q3984404): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2275473 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2144185328 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3781066 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:07, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An undecidable problem in correspondence theory |
scientific article |
Statements
An undecidable problem in correspondence theory (English)
0 references
27 June 1992
0 references
undecidability of first-order definability of propositional formulas
0 references
intuitionistic formulas
0 references
correspondence theory
0 references
Minsky machine
0 references
