The existence of strongly computable representations in the class of Boolean algebras (Q1761055): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4895321 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some properties of the constructivization of Boolean algebras / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank | |||
Normal rank | |||
Latest revision as of 21:43, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The existence of strongly computable representations in the class of Boolean algebras |
scientific article |
Statements
The existence of strongly computable representations in the class of Boolean algebras (English)
0 references
15 November 2012
0 references
