The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one (Q779152): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.33048/semi.2020.17.067 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3116179710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4513975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tarski-Lindenbaum Algebra of the Class of all Strongly Constructivizable Prime Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4956005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong and weak constructivization and computable families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive models of complete solvable theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively presentable prime models / rank
 
Normal rank

Latest revision as of 04:12, 23 July 2024

scientific article
Language Label Description Also known as
English
The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one
scientific article

    Statements

    The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one (English)
    0 references
    21 July 2020
    0 references
    first-order logic
    0 references
    Tarski-Lindenbaum algebra
    0 references
    computable isomorphism
    0 references
    semantic class of models
    0 references
    algorithmic complexity estimate
    0 references

    Identifiers

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