Computability by means of effectively definable schemes and definability via enumerations (Q1263579): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5625129 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5534919 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Abstract First Order Computability. I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Abstract Computability and Invariant Definability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5573961 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3476803 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Definability via enumerations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4205083 / rank | |||
Normal rank | |||
Latest revision as of 10:54, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computability by means of effectively definable schemes and definability via enumerations |
scientific article |
Statements
Computability by means of effectively definable schemes and definability via enumerations (English)
0 references
1990
0 references
In a previous paper the author has characterized, in terms of enumerations, search computability on structures. This paper provides a similar (again in terms of enumerations) characterization of computability via Shepherdson's recursively enumerable definitional schemes.
0 references
enumerations
0 references
characterization of computability via Shepherdson's recursively enumerable definitional schemes
0 references
