Counting the back-and-forth types

DOI10.1093/LOGCOM/EXQ048zbMATH Open1268.03044OpenAlexW2000110189MaRDI QIDQ2907060FDOQ2907060

Antonio Montalbán

Publication date: 5 September 2012

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f08ea2431999a0e416180941a31e94a2e042f309

zbMATH Keywords

computable structuresTuring degreeintrinsical relationsback-and-forthjump of structure

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Cited In (7)

• Coding and definability in computable structures
• Rice sequences of relations
• On bi-embeddable categoricity of algebraic structures
• The property “arithmetic-is-recursive” on a cone
• Learning families of algebraic structures from informant
• A robuster Scott rank
• Measuring complexities of classes of structures

This page was built for publication: Counting the back-and-forth types

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