Arithmetic of divisibility in finite models

DOI10.1002/MALQ.200310086MaRDI QIDQ4459597zbMATH OpenOpenAlexFDO

Authors Marcin Mostowski, Anna E. Wasilewska

Publication date 29 March 2004

Published in MLQ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200310086

zbMATH Keywords

undecidabilitydivisibilityfinite modelFM-representabilityIS-interpretability

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Decidability of theories and sets of sentences (03B25) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• scientific article; zbMATH DE number 221693
• Foundations of Software Science and Computational Structures
• scientific article; zbMATH DE number 3933028
• New Computational Paradigms
• Definability and decidability issues in extensions of the integers with the divisibility predicate

Cited in

(11)

• Division in the Theory S02+ of Bounded Arithmetic.
• Theories of initial segments of standard models of arithmetics and their complete extensions
• scientific article; zbMATH DE number 3875247 (Why is no real title available?)
• Theories of arithmetics in finite models
• Representability of functions in finite models. Arithmetical theories
• scientific article; zbMATH DE number 3933028 (Why is no real title available?)
• Foundations of Software Science and Computational Structures
• 2004 Summer Meeting of the Association for Symbolic Logic
• The elementary theory of the natural lattice is finitely axiomatizable
• Proper divisibility in computable rings
• Computer Science Logic

This page was built for publication: Arithmetic of divisibility in finite models

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