Arithmetical definability over finite structures

DOI10.1002/MALQ.200310041MaRDI QIDQ4419268zbMATH OpenOpenAlexFDO

Authors Troy Lee

Publication date 31 July 2003

Published in MLQ (Search for Journal in Brave)

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

zbMATH Keywords

arithmetical definabilityCrane Beach Conjecturedescriptive complexityfinite model theory

Mathematics Subject Classification ID

Model theory of finite structures (03C13) First-order arithmetic and fragments (03F30) Descriptive complexity and finite models (68Q19)

Recommendations

• A list of arithmetical structures complete with respect to the first-order definability
• scientific article; zbMATH DE number 440118
• Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$
• scientific article; zbMATH DE number 4110684
• Definability of Languages by Generalized First-Order Formulas over (N,+)

Cited in

(12)

• Structure and definability in general bounded arithmetic theories
• First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
• AXIOMS FOR FINITE COLLAPSE MODELS OF ARITHMETIC
• Theories of arithmetics in finite models
• Arithmetic definability by formulas with two quantifiers
• scientific article; zbMATH DE number 6984345 (Why is no real title available?)
• Constructivizable and non-constructivizable formal arithmetic structures
• Ranked structures and arithmetic transfinite recursion
• scientific article; zbMATH DE number 5267925 (Why is no real title available?)
• Theories of initial segments of standard models of arithmetics and their complete extensions
• A list of arithmetical structures complete with respect to the first-order definability
• Countable structures \(\Sigma \)-definable over classical continuous number systems

This page was built for publication: Arithmetical definability over finite structures

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