Punctual definability on structures
From MaRDI portal
Publication:2033006
Recommendations
Cites work
- 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 7407778 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A computability theoretic equivalent to Vaught's conjecture
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Algebraic structures computable without delay
- An Effective Version of Dilworth's Theorem
- Effectively existentially-atomic structures
- Eliminating unbounded search in computable algebra
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Graphs are not universal for online computability
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- The complexity of computable categoricity
- The diversity of categoricity without delay
Cited in
(6)- Punctually presented structures I: Closure theorems
- WHICH CLASSES OF STRUCTURES ARE BOTH PSEUDO-ELEMENTARY AND DEFINABLE BY AN INFINITARY SENTENCE?
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- Punctual structures and primitive recursive reducibility
- scientific article; zbMATH DE number 7407778 (Why is no real title available?)
- Primitive recursive reverse mathematics
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)