FOUNDATIONS OF ONLINE STRUCTURE THEORY
From MaRDI portal
Cites work
- A quest for algorithmically random infinite structures
- A survey of homogeneous structures
- Algebraic structures computable without delay
- An Effective Version of Dilworth's Theorem
- An on-line graph coloring algorithm with sublinear performance ratio
- Atomless Boolean algebras computable in polynomial time
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Computable functors and effective interpretability
- Computable structures and the hyperarithmetical hierarchy
- Computational complexity of real functions
- CONSTRUCTIVE ALGEBRAS I
- Constructive models of complete solvable theories
- Developments in Language Theory
- Effective content of field theory
- Effective procedures in field theory
- Eliminating unbounded search in computable algebra
- Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
- From automatic structures to automatic groups.
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
- Graphs are not universal for online computability
- Handbook of recursive mathematics. Vol. 1: Recursive model theory
- Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and combinatorics
- scientific article; zbMATH DE number 1002913 (Why is no real title available?)
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1302870 (Why is no real title available?)
- scientific article; zbMATH DE number 1302879 (Why is no real title available?)
- scientific article; zbMATH DE number 1303205 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 2167522 (Why is no real title available?)
- scientific article; zbMATH DE number 3805536 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- scientific article; zbMATH DE number 3250559 (Why is no real title available?)
- Omitting types, type spectrums, and decidability
- On-line coloring \(k\)-colorable graphs
- On-Line Coloring and Recursive Graph Theory
- Polynomial-time Abelian groups
- Polynomial-time versus recursive models
- Recursively presentable prime models
- Some constructivizations of Abelian groups
- Space complexity of abelian groups
- Structures computable in polynomial time. I
- Structures computable in polynomial time. II
- The additive group of the rationals does not have an automatic presentation
- The back-and-forth method and computability without delay
- The complexity of computable categoricity
- The diversity of categoricity without delay
Cited in
(42)- Punctual dimension of algebraic structures in certain classes
- Punctual categoricity relative to a computable oracle
- Punctual definability on structures
- Non-density in punctual computability
- Punctual categoricity spectra of computably categorical structures
- On bi-embeddable categoricity of algebraic structures
- A note on computable embeddings for ordinals and their reverses
- Searching for applicable versions of computable structures
- Punctual structures and primitive recursive reducibility
- Graphs are not universal for online computability
- Effective categoricity of automatic equivalence and nested equivalence structures
- Online presentations of finitely generated structures
- Definable Subsets of Polynomial-Time Algebraic Structures
- Rogers semilattices of punctual numberings
- Primitive recursive equivalence relations and their primitive recursive complexity
- A structure of punctual dimension two
- Foundations of online structure theory. II: The operator approach
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- To reorient is easier than to orient: An on-line algorithm for reorientation of graphs
- Computable embeddability for algebraic structures
- Primitive recursive ordered fields and some applications
- Primitive recursive reverse mathematics
- Punctual 1-linear orders
- On the main scientific achievements of Victor Selivanov
- Punctually presented structures I: Closure theorems
- COMPUTABLY COMPACT METRIC SPACES
- On the index set of punctually categorical finitely generated structures
- Computably and punctually universal spaces
- Ordered fields and Grzegorczyk's hierarchy
- The existence of primitive recursive structures
- Undecidability of the degree structure of primitive recursive m-reducibility
- Computably enumerable equivalence relations via primitive recursive reductions
- A discrete linear order with non-dense punctual degrees
- Computable classifications of continuous, transducer, and regular functions
- Punctually presented structures. II: Comparing presentations.
- Structures of finite punctual dimension \(n>2\)
- Punctual presentability in certain classes of algebraic structures
- Punctual numberings for families of sets
- Online and feasible presentability: from trees to modal algebras
- New degree spectra of Polish spaces
- Constructing punctually categorical semigroups
- Primitive recursive ordered fields and some applications
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)
