Pages that link to "Item:Q471691"

The following pages link to The complexity of computable categoricity (Q471691):

Displaying 46 items.

• Categoricity spectra for polymodal algebras (Q514501) (← links)
• Solving the Caesar problem without categorical sortals (Q735346) (← links)
• Complexity of categorical theories with computable models (Q859246) (← links)
• Complexity of hyperconcepts (Q860806) (← links)
• The branching theorem and computable categoricity in the Ershov hierarchy (Q887636) (← links)
• Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations (Q904324) (← links)
• Index sets of autostable relative to strong constructivizations constructive models for familiar classes (Q906085) (← links)
• Computable categoricity and the Ershov hierarchy (Q958489) (← links)
• Categoricity of computable infinitary theories (Q1005932) (← links)
• Finite computable dimension and degrees of categoricity (Q1616772) (← links)
• Computable torsion abelian groups (Q1688648) (← links)
• Computable bi-embeddable categoricity (Q1731326) (← links)
• On the virtue of categoricity (Q1981999) (← links)
• Punctual categoricity relative to a computable oracle (Q2030137) (← links)
• Punctual definability on structures (Q2033006) (← links)
• Categoricity spectra of computable structures (Q2036466) (← links)
• A note on decidable categoricity and index sets (Q2200982) (← links)
• HKSS-completeness of modal algebras (Q2234421) (← links)
• Categorical linearly ordered structures (Q2311213) (← links)
• Computability-theoretic properties of injection structures (Q2342300) (← links)
• The index set of the groups autostable relative to strong constructivizations (Q2360262) (← links)
• \(\prod_1^1\)-completeness of the computable categoricity problem for projective planes (Q2364332) (← links)
• A Note on Effective Categoricity for Linear Orderings (Q2988812) (← links)
• The complexity of countable categoricity in finite languages (Q3117785) (← links)
• Intrinsic bounds on complexity and definability at limit levels (Q3399191) (← links)
• Category and Measure in Complexity Classes (Q3495645) (← links)
• Decomposing the complexity quotient category (Q4352685) (← links)
• There is no classification of the decidably presentable structures (Q4562439) (← links)
• On a question of Kalimullin (Q4563668) (← links)
• Torsion-free abelian groups with optimal Scott families (Q4565755) (← links)
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS (Q4638989) (← links)
• (Q4779146) (← links)
• Computable categoricity versus relative computable categoricity (Q4921488) (← links)
• Coding in the automorphism group of a computably categorical structure (Q4988826) (← links)
• Degrees of bi-embeddable categoricity (Q4995600) (← links)
• Relativizing computable categoricity (Q5002563) (← links)
• AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS (Q5067872) (← links)
• THE TREE OF TUPLES OF A STRUCTURE (Q5070461) (← links)
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
• FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592) (← links)
• DEGREES OF CATEGORICITY ON A CONE VIA<i>η</i>-SYSTEMS (Q5738206) (← links)
• PUNCTUAL CATEGORICITY AND UNIVERSALITY (Q5858918) (← links)
• Индексное множество автоустойчивых упорядоченных абелевых групп (Q5878775) (← links)
• Fundamentals of Computation Theory (Q5900809) (← links)
• Computable Heyting algebras with distinguished atoms and coatoms (Q6117138) (← links)
• Decidable categoricity spectra for almost prime models (Q6597843) (← links)