FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q128047871, #quickstatements; #temporary_batch_1722547657812
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2939890436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomless Boolean algebras 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: Structures computable in polynomial time. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space complexity of abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time versus recursive models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some constructivizations of Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of recursive mathematics. Vol. 1: Recursive model theory / 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: The complexity of computable categoricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4956005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective procedures in field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3130249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive models of complete solvable theories / 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: Q4249356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively presentable prime models / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic structures computable without delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diversity of categoricity without delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: From automatic structures to automatic groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quest for algorithmically random infinite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Version of Dilworth's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line coloring \(k\)-colorable graphs / 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: Computational complexity of real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line graph coloring algorithm with sublinear performance ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of homogeneous structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONSTRUCTIVE ALGEBRAS I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537372 / 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 back-and-forth method and computability without delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective content of field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4749832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Omitting types, type spectrums, and decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The additive group of the rationals does not have an automatic presentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128047871 / rank
 
Normal rank

Latest revision as of 22:33, 1 August 2024

scientific article; zbMATH DE number 7087944
Language Label Description Also known as
English
FOUNDATIONS OF ONLINE STRUCTURE THEORY
scientific article; zbMATH DE number 7087944

    Statements

    FOUNDATIONS OF ONLINE STRUCTURE THEORY (English)
    0 references
    0 references
    0 references
    0 references
    1 August 2019
    0 references
    primitive recursion
    0 references
    online computation
    0 references
    punctual set theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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