Effective content of field theory
From MaRDI portal
Publication:3922662
DOI10.1016/0003-4843(79)90011-1zbMath0469.03028OpenAlexW2010770007MaRDI QIDQ3922662
Publication date: 1979
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(79)90011-1
Galois extensionalgebraically closed fieldformally real fieldcounterexamplespriority argumentsreal closuresfields of characteristic zeroalgebraic closuresKronecker-type elimination theory
Connections between field theory and logic (12L99) Theory of numerations, effectively presented structures (03D45)
Related Items
Degree spectra and computable dimensions in algebraic structures ⋮ \(\Pi_{1}^{0}\) classes and orderable groups ⋮ The computational complexity of module socles ⋮ The computable dimension of ordered abelian groups ⋮ An introduction to computable model theory on groups and fields ⋮ Ordered Groups: A Case Study in Reverse Mathematics ⋮ A rank one cohesive set ⋮ Computable dimension for ordered fields ⋮ Recursive categoricity and recursive stability ⋮ The complexity of finding SUBSEQ\((A)\) ⋮ Recursion theory and ordered groups ⋮ A theory of nonmonotonic rule systems I ⋮ Computable completely decomposable groups ⋮ Degrees containing members of thin Π10 classes are dense and co-dense ⋮ Torsion-free abelian groups with optimal Scott families ⋮ Iterated effective embeddings of abelian p-groups ⋮ Orders on magmas and computability theory ⋮ Degrees of orders on torsion-free abelian groups ⋮ Infinite dimensional proper subspaces of computable vector spaces ⋮ Separating notions in effective topology ⋮ Direct construction of Scott ideals ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Recursion theory on fields and abstract dependence ⋮ Irreducibles and Primes in Computable Integral Domains ⋮ Complexity-theoretic algebra. II: Boolean algebras ⋮ Computability-theoretic and proof-theoretic aspects of partial and linear orderings ⋮ Ideals in computable rings ⋮ Independence in computable algebra ⋮ Proper divisibility in computable rings ⋮ Maximality in effective topology ⋮ Degrees of recursively enumerable topological spaces ⋮ Recursively presented games and strategies ⋮ The complexity of primes in computable unique factorization domains ⋮ Friedberg splittings of recursively enumerable sets ⋮ Recursive properties of relations on models ⋮ Spectra of Algebraic Fields and Subfields ⋮ Countable thin \(\Pi^0_1\) classes ⋮ R. e. presented linear orders ⋮ Effective categoricity of equivalence structures ⋮ Is it harder to factor a polynomial or to find a root? ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Computable topological groups and Pontryagin duality ⋮ Effectively closed subgroups of the infinite symmetric group ⋮ Categoricity spectra of computable structures ⋮ Computable categoricity of trees of finite height ⋮ Effective categoricity of abelian \(p\)-groups ⋮ FOUNDATIONS OF ONLINE STRUCTURE THEORY ⋮ Effective Galois theory ⋮ d-computable categoricity for algebraic fields ⋮ On the ranked points of a Π10 set ⋮ Describing free groups ⋮ Simplicity in effective topology ⋮ Computable categoricity for algebraic fields with splitting algorithms ⋮ Categoricity properties for computable algebraic fields ⋮ Effective aspects of profinite groups ⋮ The given ⋮ Strong reducibilities ⋮ Recursive linear orders with recursive successivities ⋮ The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees ⋮ Recursive properties of Euclidean domains ⋮ Countable algebra and set existence axioms ⋮ Hyperarithmetical relations in expansions of recursive structures ⋮ Degree Spectra of Relations on Computable Structures ⋮ Computable procedures for fields
