Theories of initial segments of standard models of arithmetics and their complete extensions

DOI10.1016/j.tcs.2011.04.030zbMath1221.03026OpenAlexW2046181205MaRDI QIDQ549718

Jerzy Tomasik, Konrad Zdanowski, Michał Krynicki

Publication date: 18 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.030

zbMATH Keywords

arithmeticfinite modelsdecidabilityPresburger arithmeticfinite arithmetic

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model theory.
• Category localization semantics for specification refinements
• Theories of arithmetics in finite models
• Reduced direct products
• On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
• Arithmetical definability over finite structures
• Arithmetic of divisibility in finite models
• Arithmetic, first-order logic, and counting quantifiers
• Truth definitions in finite models
• A finite model-theoretical proof of a property of bounded query classes within PH
• Computer Science Logic
• An axiomatic basis for computer programming
• New Computational Paradigms

This page was built for publication: Theories of initial segments of standard models of arithmetics and their complete extensions