An undecidable problem in correspondence theory (Q3984404): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
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
