Pages that link to "Item:Q3231245"

The following pages link to Effective procedures in field theory (Q3231245):

Displaying 24 items.

• Orders on computable rings (Q5119902) (← links)
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
• FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592) (← links)
• Computable categoricity for algebraic fields with splitting algorithms (Q5246987) (← links)
• Categoricity properties for computable algebraic fields (Q5246988) (← links)
• The complexity of ascendant sequences in locally nilpotent groups (Q5418658) (← links)
• The Church-Turing Thesis over Arbitrary Domains (Q5452180) (← links)
• (Q5518362) (← links)
• A notion of effectiveness in arbitrary structures (Q5549807) (← links)
• Computable Algebraic Structures and Nonstandard Arithmetic (Q5566510) (← links)
• Computable Fields and Arithmetically Definable Ordered Fields (Q5636867) (← links)
• A decision method for $p$-adic integral zeros of diophantine equations (Q5719471) (← links)
• 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms (Q5741344) (← links)
• Computing on the Banach space C [ 0 , 1 ] (Q5859846) (← links)
• Primitive recursive ordered fields and some applications (Q5880940) (← links)
• An undecidable linear order that is \(n\)-decidable for all \(n\) (Q5937834) (← links)
• Automatic presentations of structures (Q6064290) (← links)
• On the effective universality of mereological theories (Q6094132) (← links)
• Computable Heyting algebras with distinguished atoms and coatoms (Q6117138) (← links)
• Embeddings into left‐orderable simple groups (Q6134473) (← links)
• Computably and punctually universal spaces (Q6614035) (← links)
• Computability in infinite Galois theory and algorithmically random algebraic fields (Q6641590) (← links)
• Computable presentations of C*-algebras (Q6642886) (← links)
• Degrees of categoricity and treeable degrees (Q6649852) (← links)