Punctual definability on structures

DOI10.1016/J.APAL.2021.102987MaRDI QIDQ2033006zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algebraic structuresdefinabilityprimitive recursion

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Abstract and axiomatic computability and recursion theory (03D75) Applications of computability and recursion theory (03D80)

Recommendations

• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• Punctual categoricity relative to a computable oracle
• Punctually presented structures I: Closure theorems
• Constructing punctually categorical semigroups
• Punctual structures and primitive recursive reducibility

Cites work

• A computability theoretic equivalent to Vaught's conjecture
• Algebraic structures computable without delay
• An Effective Version of Dilworth's Theorem
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Effectively existentially-atomic structures
• Eliminating unbounded search in computable algebra
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Foundations of online structure theory. II: The operator approach
• Graphs are not universal for online computability
• scientific article; zbMATH DE number 5605134 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• The complexity of computable categoricity
• The diversity of categoricity without delay

Cited in

(9)

• Punctual structures and primitive recursive reducibility
• Foundations of online structure theory. II: The operator approach
• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• WHICH CLASSES OF STRUCTURES ARE BOTH PSEUDO-ELEMENTARY AND DEFINABLE BY AN INFINITARY SENTENCE?
• Primitive recursive reverse mathematics
• Punctually presented structures I: Closure theorems
• Punctual spectra of algebraic structures and isomorphisms
• Punctually presented structures. II: Comparing presentations.
• Punctual numberings for families of sets

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)