Punctually presented structures. II: Comparing presentations.

DOI10.1007/S00153-024-00940-7MaRDI QIDQ7026087zbMATH OpenFDO

Authors M. V. Dorzhieva, Rodney G. Downey, Ellen Hammatt, Alexander Melnikov, Keng Meng Ng

Publication date 18 February 2025

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00153-024-00940-7

zbMATH Keywords

Boolean algebralinear ordersundirected graphscomputable structuresprimitive recursivepunctual structures

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites work

• scientific article; zbMATH DE number 3781440 (Why is no real title available?)
• scientific article; zbMATH DE number 1303204 (Why is no real title available?)
• scientific article; zbMATH DE number 1405578 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• scientific article; zbMATH DE number 7407778 (Why is no real title available?)
• A structure of punctual dimension two
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Algebraic structures computable without delay
• An autostable 1-decidable model without a computable Scott family of -formulas
• CONSTRUCTIVE ALGEBRAS I
• Categoricity for primitive recursive and polynomial Boolean algebras
• Coding in the automorphism group of a computably categorical structure
• Computable Algebra, General Theory and Theory of Computable Fields
• Computable Structure Theory
• Computable structures and the hyperarithmetical hierarchy
• Criteria of autostability for 1-decidable models
• Degree spectra and computable dimensions in algebraic structures
• Existence and uniqueness of structures computable in polynomial time
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Finitely generated structures computable in polynomial time
• Graphs are not universal for online computability
• Non-density in punctual computability
• Online presentations of finitely generated structures
• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• Polynomial-time Abelian groups
• Polynomial-time versus recursive models
• Primitively recursive categoricity for unars and equivalence structures
• Primitively recursively categorical linear orderings
• Problem of the number of non-self-equivalent constructivizations
• Punctual copies of algebraic structures
• Punctual definability on structures
• Punctual degrees and lattice embeddings
• Punctual dimension of algebraic structures in certain classes
• Punctually presented structures I: Closure theorems
• Recursive Boolean algebras with recursive atoms
• Relativizing computable categoricity
• Searching for applicable versions of computable structures
• The back-and-forth method and computability without delay
• The diversity of categoricity without delay
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings

Cited in

(2)

• A discrete linear order with non-dense punctual degrees
• Structures of finite punctual dimension \(n>2\)

This page was built for publication: Punctually presented structures. II: Comparing presentations.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7026087)