Effective content of field theory
From MaRDI portal
Cited in
(69)- Effective categoricity of abelian p-groups
- Recursive linear orders with recursive successivities
- Recursive properties of Euclidean domains
- Countable algebra and set existence axioms
- Recursive categoricity and recursive stability
- Recursion theory and ordered groups
- Recursion theory on fields and abstract dependence
- Recursively presented games and strategies
- Countable thin ^0_1 classes
- Hyperarithmetical relations in expansions of recursive structures
- A rank one cohesive set
- A theory of nonmonotonic rule systems I
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Degree spectra and computable dimensions in algebraic structures
- \(\Pi_{1}^{0}\) classes and orderable groups
- The complexity of primes in computable unique factorization domains
- The computable dimension of ordered abelian groups
- Categoricity spectra of computable structures
- Computable procedures for fields
- The computational complexity of module socles
- The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees
- Ideals in computable rings
- Effective categoricity of equivalence structures
- Computable abelian groups
- Computable dimension for ordered fields
- Describing free groups
- An introduction to computable model theory on groups and fields
- Iterated effective embeddings of abelian p-groups
- Irreducibles and Primes in Computable Integral Domains
- R. e. presented linear orders
- Is it harder to factor a polynomial or to find a root?
- Computable completely decomposable groups
- Maximality in effective topology
- Degrees of recursively enumerable topological spaces
- Computable categoricity of trees of finite height
- Spectra of Algebraic Fields and Subfields
- d-computable categoricity for algebraic fields
- Simplicity in effective topology
- Effective aspects of profinite groups
- Degrees of orders on torsion-free abelian groups
- Effective Galois theory
- Strong reducibilities
- Infinite dimensional proper subspaces of computable vector spaces
- On the ranked points of a Π10 set
- Ordered Groups: A Case Study in Reverse Mathematics
- Degree Spectra of Relations on Computable Structures
- Degrees containing members of thin _1⁰ classes are dense and co-dense
- Torsion-free abelian groups with optimal Scott families
- Orders on magmas and computability theory
- Computable topological groups and Pontryagin duality
- Effectively closed subgroups of the infinite symmetric group
- Independence in computable algebra
- Proper divisibility in computable rings
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Computable categoricity for algebraic fields with splitting algorithms
- Categoricity properties for computable algebraic fields
- Separating notions in effective topology
- Direct construction of Scott ideals
- COMPUTABLY COMPACT METRIC SPACES
- Friedberg splittings of recursively enumerable sets
- Recursive properties of relations on models
- Computably locally compact groups and their closed subgroups
- Computable formal contexts
- Computable topological groups
- Comparing notions of presentability in Polish spaces and Polish groups
- Complexities of theories of profinite subgroups of S_ via tree presentations
- The given
- The complexity of finding SUBSEQ(A)
- Complexity-theoretic algebra. II: Boolean algebras
This page was built for publication: Effective content of field theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922662)
