PUNCTUAL CATEGORICITY AND UNIVERSALITY (Q5858918): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1017/jsl.2020.51 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3094321964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: FOUNDATIONS OF ONLINE STRUCTURE THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of distributive lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space complexity of abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computable categoricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs are not universal for online computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4956005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3961013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Questions in Computable Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree spectra and computable dimensions in algebraic structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic structures computable without delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive recursive fields and categoricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Coloring and Recursive Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating unbounded search in computable algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Classification Problem for Compact Computable Metric Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:22, 25 July 2024

scientific article; zbMATH DE number 7333589
Language Label Description Also known as
English
PUNCTUAL CATEGORICITY AND UNIVERSALITY
scientific article; zbMATH DE number 7333589

    Statements

    PUNCTUAL CATEGORICITY AND UNIVERSALITY (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 April 2021
    0 references
    primitive recursion
    0 references
    computable structures
    0 references
    punctual computability
    0 references

    Identifiers