Optimal syntactic definitions of back-and-forth types

DOI10.1090/TRAN/9695MaRDI QIDQ7316388zbMATH OpenFDO

Authors Ruiyuan Chen, David Gonzalez, Matthew Harrison-Trainor

Publication date 19 August 2026

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/TRAN/9695

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Computable structure theory, computable model theory (03C57) Other infinitary logic (03C75) Theory of numerations, effectively presented structures (03D45) Descriptive set theory (03E15)

Cites work

• A Borel reductibility theory for classes of countable structures
• A computable functor from graphs to fields
• A robuster Scott rank
• An application of games to the completeness problem for formalized theories
• Boolean algebra approximations
• Borel Classes and Closed Games: Wadge-Type and Hurewicz-Type Results
• Complexity of Scott sentences
• Computable Boolean algebras
• Computable Structure Theory
• Computable structures and the hyperarithmetical hierarchy
• Counting the back-and-forth types
• Enumerations in computable structure theory
• Every Low 2 Boolean Algebra has a Recursive Copy
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 3266609 (Why is no real title available?)
• scientific article; zbMATH DE number 3399227 (Why is no real title available?)
• scientific article; zbMATH DE number 3060762 (Why is no real title available?)
• Invariant sets in topology and logic
• On defining well-orderings
• On the n-back-and-forth types of Boolean algebras
• Pairs of recursive structures
• PRIORITY ARGUMENTS VIA TRUE STAGES
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
• Scott sentences and admissible sets
• The structural complexity of models of arithmetic

This page was built for publication: Optimal syntactic definitions of back-and-forth types

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