Punctual definability on structures

DOI10.1016/j.apal.2021.102987OpenAlexW3155670288MaRDI QIDQ2033006

Antonio Montalbán, Alexander G. Melnikov, Iskander Sh. 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

definabilityalgebraic structuresprimitive recursion

Mathematics Subject Classification ID

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

Related Items (4)

Punctual structures and primitive recursive reducibility ⋮ Primitive recursive reverse mathematics ⋮ Punctually presented structures I: Closure theorems ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computable categoricity
• Algebraic structures computable without delay
• The diversity of categoricity without delay
• A computability theoretic equivalent to Vaught's conjecture
• Eliminating unbounded search in computable algebra
• Graphs are not universal for online computability
• Effectively Existentially-Atomic Structures
• An Effective Version of Dilworth's Theorem
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• PUNCTUAL CATEGORICITY AND UNIVERSALITY

This page was built for publication: Punctual definability on structures