scientific article; zbMATH DE number 1531924

MaRDI QIDQ4513967zbMATH OpenFDO

Authors Rodney G. Downey, Jeffrey Remmel

Publication date 16 January 2002

zbMATH Keywords

algorithmic propertiesBoolean algebrascomputable algebracomputable combinatoricscomputable graph theorycomputable structuresdecidabilitygroups of computable automorphismslatticeslinear orderingsordered groupspartial orderingpolynomial-time computabilitysurveyundecidability

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Recommendations

• An introduction to computable model theory on groups and fields
• Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and combinatorics
• scientific article; zbMATH DE number 1390022
• Computability and computable models
• scientific article; zbMATH DE number 1303201

Cited in

(10)

• Degree spectra and computable dimensions in algebraic structures
• Computable torsion abelian groups
• Computable presentability of countable linear orders
• Equivalence between Fraïssé's conjecture and Jullien's theorem
• Prime models of theories of computable linear orderings
• An introduction to computable model theory on groups and fields
• Some Questions in Computable Mathematics
• Computable completely decomposable groups
• Left-orderable computable groups
• COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513967)