Gandy's theorem for abstract structures without the equality test

zbMATH Open1273.03123MaRDI QIDQ3408145FDOQ3408145

Authors: M. V. Korovina 

Publication date: 24 February 2010

Recommendations

• Fixed points on the real numbers without the equality test
• \(\Pi_1^0\)-positive inductive definability on abstract structures
• A Gandy theorem for abstract structures and applications to first-order definability
• Combinatory completeness without classical equality
• On Σ‐definability without equality over the real numbers

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Inductive definability (03D70)

Cited In (2)

• Computable elements and functions in effectively enumerable topological spaces
• Fixed points on the real numbers without the equality test

This page was built for publication: Gandy's theorem for abstract structures without the equality test

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