Punctual definability on structures
DOI10.1016/J.APAL.2021.102987OpenAlexW3155670288MaRDI QIDQ2033006FDOQ2033006
Authors: Alexander Melnikov, Antonio Montalbán, Iskander Kalimullin 
Publication date: 14 June 2021
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2021.102987
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?)
- Title not available (Why is that?)
- An Effective Version of Dilworth's Theorem
- The complexity of computable categoricity
- Algebraic structures computable without delay
- A computability theoretic equivalent to Vaught's conjecture
- Eliminating unbounded search in computable algebra
- Title not available (Why is that?)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- The diversity of categoricity without delay
- Graphs are not universal for online computability
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- Effectively existentially-atomic structures
Cited In (6)
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- Punctually presented structures I: Closure theorems
- Primitive recursive reverse mathematics
- WHICH CLASSES OF STRUCTURES ARE BOTH PSEUDO-ELEMENTARY AND DEFINABLE BY AN INFINITARY SENTENCE?
- Punctual structures and primitive recursive reducibility
- Title not available (Why is that?)
This page was built for publication: Punctual definability on structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033006)
