scientific article; zbMATH DE number 2144731

MaRDI QIDQ4657011zbMATH OpenFDO

Authors Martin Goldstern

Publication date 14 March 2005

zbMATH Keywords

arithmeticcomplexitydecidable theoryquantifier eliminationrecursive monounaryunar

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10) Computable structure theory, computable model theory (03C57) Undecidability and degrees of sets of sentences (03D35) Unary algebras (08A60)

Recommendations

• Unary quantifiers on finite models
• Recursive unary algebras and trees
• LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
• First-Order Queries over One Unary Function
• Computational complexity of logical theories of one successor and another unary function

Cited in

(2)

• LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
• Monotone recursive definition of predicates and its realizability interpretation

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