scientific article; zbMATH DE number 5267925

MaRDI QIDQ5459305zbMATH OpenFDO

Authors P. T. Dosanbaj

Publication date 25 April 2008

zbMATH Keywords

elementary definabilityfirst-order definabilityundecidable theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Basic properties of first-order languages and structures (03C07) First-order arithmetic and fragments (03F30)

Recommendations

• Arithmetical definability and computational complexity
• Arithmetical definability over finite structures
• Publication:4936685
• On arithmetic complexity of certain constructive logics
• scientific article; zbMATH DE number 1467185
• Arithmetic complexity of first-order definable subsets of recursive Boolean algebras
• Computable Structure Theory
• On arithmetic complexity of some constructive logics
• scientific article; zbMATH DE number 2063217
• Arithmetic complexity of the predicate logics of certain complete arithmetic theories

Cited in

(9)

• Stability of recursive structures in arithmetical degrees
• Structure and definability in general bounded arithmetic theories
• Arithmetic complexity of first-order definable subsets of recursive Boolean algebras
• scientific article; zbMATH DE number 3931010 (Why is no real title available?)
• Arithmetic definability by formulas with two quantifiers
• scientific article; zbMATH DE number 1985597 (Why is no real title available?)
• Constructivizable and non-constructivizable formal arithmetic structures
• Ranked structures and arithmetic transfinite recursion
• A list of arithmetical structures complete with respect to the first-order definability

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 Q5459305)