The minimality of certain decidability conditions for Boolean algebras (Q416985): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4895321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted theories of constructive Boolean algebras / 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: Q4664637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly constructive Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of strongly computable representations in the class of Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean algebras of elementary characteristic \((1, 0, 1)\) whose set of atoms and Ershov-Tarski ideal are computable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664630 / rank
 
Normal rank

Latest revision as of 05:00, 5 July 2024

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
    0 references
    10 May 2012
    0 references
    0 references
    0 references
    0 references
    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