The minimality of certain decidability conditions for Boolean algebras (Q416985): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 03C57 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 03B25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 06E05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6032837 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Boolean algebra | |||
| Property / zbMATH Keywords: Boolean algebra / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computable set | |||
| Property / zbMATH Keywords: computable set / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computable model | |||
| Property / zbMATH Keywords: computable model / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
strongly computable model | |||
| Property / zbMATH Keywords: strongly computable model / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
\(n\)-computability | |||
| Property / zbMATH Keywords: \(n\)-computability / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
decidable model | |||
| Property / zbMATH Keywords: decidable model / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
elementary characteristic of a Boolean algebra | |||
| Property / zbMATH Keywords: elementary characteristic of a Boolean algebra / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Ershov-Tarski ideal | |||
| Property / zbMATH Keywords: Ershov-Tarski ideal / rank | |||
Normal rank | |||
Revision as of 20:49, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimality of certain decidability conditions for Boolean algebras |
scientific article |
Statements
The minimality of certain decidability conditions for Boolean algebras (English)
0 references
10 May 2012
0 references
Boolean algebra
0 references
computable set
0 references
computable model
0 references
strongly computable model
0 references
\(n\)-computability
0 references
decidable model
0 references
elementary characteristic of a Boolean algebra
0 references
Ershov-Tarski ideal
0 references
