Counting the back-and-forth types

DOI10.1093/LOGCOM/EXQ048MaRDI QIDQ2907060zbMATH OpenOpenAlexFDO

Authors 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

back-and-forthcomputable structuresintrinsical relationsjump of structureTuring degree

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Recommendations

• On the n-back-and-forth types of Boolean algebras
• Countable structures, Ehrenfeucht strategies, and Wadge reductions
• Measuring complexities of classes of structures
• The back-and-forth method and computability without delay
• \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures

Cited in

(9)

• Coding and definability in computable structures
• On bi-embeddable categoricity of algebraic structures
• Learning families of algebraic structures from informant
• The back-and-forth method and computability without delay
• Rice sequences of relations
• A robuster Scott rank
• Measuring complexities of classes of structures
• The property ``arithmetic-is-recursive on a cone
• Optimal syntactic definitions of back-and-forth types

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)