On the relation provable equivalence and on partitions in effectively inseparable sets (Q1156125): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4121962 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the algebraization of a Feferman's predicate. (The algebraization of theories which express Theor; X) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursively enumerable classes and their application to recursive sequences of formal theories / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Theory of Formal Systems. (AM-47) / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01837553 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2091083565 / rank | |||
Normal rank |
Latest revision as of 11:10, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the relation provable equivalence and on partitions in effectively inseparable sets |
scientific article |
Statements
On the relation provable equivalence and on partitions in effectively inseparable sets (English)
0 references
1981
0 references
recursively enumerable class of recursively enumerable sets
0 references
Peano arithmetic
0 references
contraproductive center
0 references
0 references
0 references