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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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
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
links / mardi / namelinks / mardi / name
 

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