FOUNDATIONS OF ONLINE STRUCTURE THEORY
From MaRDI portal
Publication:5226592
DOI10.1017/BSL.2019.20zbMATH Open1477.03167OpenAlexW2939890436WikidataQ128047871 ScholiaQ128047871MaRDI QIDQ5226592FDOQ5226592
Authors: Alexander Melnikov, Nikolay Bazhenov, Rodney G. Downey, Iskander Kalimullin 
Publication date: 1 August 2019
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cff7f0302b65f02c51b73f542f4ee8cd81a5fd0b
Coloring of graphs and hypergraphs (05C15) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80) Abstract and axiomatic computability and recursion theory (03D75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The additive group of the rationals does not have an automatic presentation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Effective Version of Dilworth's Theorem
- Computable structures and the hyperarithmetical hierarchy
- From automatic structures to automatic groups.
- Effective content of field theory
- Title not available (Why is that?)
- On-line coloring \(k\)-colorable graphs
- CONSTRUCTIVE ALGEBRAS I
- Title not available (Why is that?)
- Effective procedures in field theory
- Title not available (Why is that?)
- Polynomial-time versus recursive models
- Polynomial-time Abelian groups
- Title not available (Why is that?)
- On-Line Coloring and Recursive Graph Theory
- A survey of homogeneous structures
- An on-line graph coloring algorithm with sublinear performance ratio
- Computational complexity of real functions
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
- Some constructivizations of Abelian groups
- Handbook of recursive mathematics. Vol. 1: Recursive model theory
- Recursively presentable prime models
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of computable categoricity
- Developments in Language Theory
- Title not available (Why is that?)
- Space complexity of abelian groups
- Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
- Algebraic structures computable without delay
- Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and combinatorics
- Constructive models of complete solvable theories
- Structures computable in polynomial time. I
- Eliminating unbounded search in computable algebra
- Structures computable in polynomial time. II
- The diversity of categoricity without delay
- Omitting types, type spectrums, and decidability
- COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
- A quest for algorithmically random infinite structures
- Atomless Boolean algebras computable in polynomial time
- Graphs are not universal for online computability
- The back-and-forth method and computability without delay
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
Cited In (31)
- New degree spectra of Polish spaces
- Constructing punctually categorical semigroups
- Primitive recursive ordered fields and some applications
- Primitive recursive equivalence relations and their primitive recursive complexity
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- Primitive recursive ordered fields and some applications
- On the main scientific achievements of Victor Selivanov
- Punctually presented structures I: Closure theorems
- To reorient is easier than to orient: An on-line algorithm for reorientation of graphs
- Effective categoricity of automatic equivalence and nested equivalence structures
- Computable embeddability for algebraic structures
- COMPUTABLY COMPACT METRIC SPACES
- Primitive recursive reverse mathematics
- Punctual dimension of algebraic structures in certain classes
- Punctual categoricity relative to a computable oracle
- Non-density in punctual computability
- Punctual 1-linear orders
- Graphs are not universal for online computability
- Online presentations of finitely generated structures
- Punctual definability on structures
- Computably and punctually universal spaces
- On bi-embeddable categoricity of algebraic structures
- Punctual categoricity spectra of computably categorical structures
- Rogers semilattices of punctual numberings
- Punctual structures and primitive recursive reducibility
- A note on computable embeddings for ordinals and their reverses
- Title not available (Why is that?)
- On the index set of punctually categorical finitely generated structures
- Searching for applicable versions of computable structures
- Definable Subsets of Polynomial-Time Algebraic Structures
- A structure of punctual dimension two
This page was built for publication: FOUNDATIONS OF ONLINE STRUCTURE THEORY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226592)
