Pages that link to "Item:Q1572657"

The following pages link to Computable structures and the hyperarithmetical hierarchy (Q1572657):

Displaying 50 items.

• Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations (Q282114) (← links)
• Abelian \(p\)-groups and the halting problem (Q306578) (← links)
• Implicit definability in arithmetic (Q306821) (← links)
• Isomorphisms and algorithmic properties of structures with two equivalences (Q321265) (← links)
• Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism (Q384395) (← links)
• Index sets and Scott sentences (Q403398) (← links)
• The minimality of certain decidability conditions for Boolean algebras (Q416985) (← links)
• The complexity of computable categoricity (Q471691) (← links)
• Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations (Q492716) (← links)
• Independence in computable algebra (Q497725) (← links)
• The index set of Boolean algebras autostable relative to strong constructivizations (Q498225) (← links)
• Measuring complexities of classes of structures (Q499081) (← links)
• Proper divisibility in computable rings (Q504325) (← links)
• Categoricity spectra for polymodal algebras (Q514501) (← links)
• Algebraic structures computable without delay (Q528478) (← links)
• Metric structures and probabilistic computation (Q541224) (← links)
• Spaces of orders and their Turing degree spectra (Q636350) (← links)
• Limit computable integer parts (Q647341) (← links)
• Cuts of linear orders (Q651418) (← links)
• The computable embedding problem (Q695798) (← links)
• Complexity of the isomorphism problem for computable free projective planes of finite rank (Q721371) (← links)
• An effective analysis of the Denjoy rank (Q778729) (← links)
• On categoricity spectra for locally finite graphs (Q820480) (← links)
• New degree spectra of Polish spaces (Q820494) (← links)
• The branching theorem and computable categoricity in the Ershov hierarchy (Q887636) (← links)
• Computable numberings of the class of Boolean algebras with distinguished endomorphisms (Q893075) (← links)
• Index sets of autostable relative to strong constructivizations constructive models for familiar classes (Q906085) (← links)
• On two problems of Turing complexity for strongly minimal theories (Q954212) (← links)
• Partial automorphism semigroups (Q998310) (← links)
• Degree spectra of the successor relation of computable linear orderings (Q1005920) (← links)
• Chains and antichains in partial orderings (Q1005926) (← links)
• The metamathematics of ergodic theory (Q1006602) (← links)
• Index sets for some classes of structures (Q1006610) (← links)
• Effective categoricity of abelian \(p\)-groups (Q1023056) (← links)
• Coding a family of sets (Q1295408) (← links)
• Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures (Q1430995) (← links)
• Degrees of autostability for prime Boolean algebras (Q1620777) (← links)
• Scott ranks of models of a theory (Q1644961) (← links)
• The diversity of categoricity without delay (Q1688181) (← links)
• Computable torsion abelian groups (Q1688648) (← links)
• The omega-rule interpretation of transfinite provability logic (Q1694812) (← links)
• Classifications of computable structures (Q1704081) (← links)
• Computable bi-embeddable categoricity (Q1731326) (← links)
• Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277) (← links)
• Scott sentences for certain groups (Q1745362) (← links)
• Hanf number for Scott sentences of computable structures (Q1756497) (← links)
• The existence of strongly computable representations in the class of Boolean algebras (Q1761055) (← links)
• Coding and definability in computable structures (Q1782235) (← links)
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings (Q1861536) (← links)
• Limiting partial combinatory algebras (Q1884934) (← links)