Punctual definability on structures
type: Item
instance of: scholarly article
title: Punctual definability on structures
author: Alexander Melnikov
author: Antonio Montalbán
author: Iskander Kalimullin
published in: Annals of Pure and Applied Logic
publication date: 2021-06-14T00:00:00Z
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 03D75
Mathematics Subject Classification ID: 03D80
zbMATH DE Number: 7358547
zbMATH Keywords: algebraic structures
zbMATH Keywords: definability
zbMATH Keywords: primitive recursion
MaRDI profile type: Publication
full work available at URL: j.apal.2021.102987
OpenAlex ID: W3155670288
cites work: FOUNDATIONS OF ONLINE STRUCTURE THEORY
cites work: Q4223058
cites work: AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
cites work: PUNCTUAL CATEGORICITY AND UNIVERSALITY
cites work: Graphs are not universal for online computability
cites work: The complexity of computable categoricity
cites work: Q5155667
cites work: An Effective Version of Dilworth's Theorem
cites work: Algebraic structures computable without delay
cites work: The diversity of categoricity without delay
cites work: Q3396632
cites work: Eliminating unbounded search in computable algebra
cites work: A computability theoretic equivalent to Vaught's conjecture
cites work: Effectively Existentially-Atomic Structures
cites work: Q5573961
DOI: 10.1016/J.APAL.2021.102987
description: scientific article; zbMATH DE number 7358547