Computer Science Logic

DOI10.1007/11538363MaRDI QIDQ5394582zbMATH OpenOpenAlexFDO

Authors Marcin Mostowski, Konrad Zdanowski

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11538363

zbMATH Keywords

arithmeticcomplete setscoprimalityfinite arithmeticfinite modelsFM-representabilityinterpretations

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Models of arithmetic and set theory (03C62)

Recommendations

• scientific article; zbMATH DE number 4110684
• scientific article; zbMATH DE number 3926911
• scientific article; zbMATH DE number 221693
• Complexity of logical theories involving coprimality
• Arithmetic of divisibility in finite models

Cited in

(4)

• Complexity of logical theories involving coprimality
• Theories of arithmetics in finite models
• Theories of initial segments of standard models of arithmetics and their complete extensions
• On the coprimeness relation from the viewpoint of monadic second-order logic

This page was built for publication: Computer Science Logic

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