Categoricity for primitive recursive and polynomial Boolean algebras (Q1731520): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10469-018-9498-1 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Existence and uniqueness of structures computable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structures computable in polynomial time. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4005059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic structures computable without delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autostability of models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive isomorphism types of recursive Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autostability and computable families of constructivizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4895321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / 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: Complexity and categoricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time versus recursive models / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10469-018-9498-1 / rank
 
Normal rank

Latest revision as of 06:23, 11 December 2024

scientific article
Language Label Description Also known as
English
Categoricity for primitive recursive and polynomial Boolean algebras
scientific article

    Statements

    Categoricity for primitive recursive and polynomial Boolean algebras (English)
    0 references
    0 references
    13 March 2019
    0 references
    Boolean algebra
    0 references
    Boolean algebra computable in polynomial time
    0 references
    computable presentation
    0 references
    primitive recursively categorical Boolean algebra
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references