Complexity of \(\Sigma^0_n\)-classifications for definable subsets (Q2700822): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Nikolay Bazhenov / rank | |||
Property / author | |||
Property / author: M. V. Zubkov / rank | |||
Property / author | |||
Property / author: Nikolay Bazhenov / rank | |||
Normal rank | |||
Property / author | |||
Property / author: M. V. Zubkov / rank | |||
Normal rank | |||
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.1007/s00153-022-00842-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4286209841 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2885275 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2709299 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4934289 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4513962 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4286756 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classifications of definable subsets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4956005 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3949052 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A construction for recursive linear orderings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orderings with αth Jump Degree 0 (α) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ehrenfeucht-Fraïssé games on ordinals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4764115 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: There is no classification of the decidably presentable structures / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:16, 1 August 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity of \(\Sigma^0_n\)-classifications for definable subsets |
scientific article |
Statements
Complexity of \(\Sigma^0_n\)-classifications for definable subsets (English)
0 references
27 April 2023
0 references
first-order definable set
0 references
arithmetical hierarchy
0 references
computable structure
0 references
\(\Sigma^0_n\)-classification
0 references
0 references