scientific article; zbMATH DE number 1985597

MaRDI QIDQ4429280zbMATH OpenFDO

Authors Ivan Korec

Publication date 25 September 2003

Full work available at URL https://eudml.org/doc/23804

zbMATH Keywords

quadratic formselementary definabilityundecibable theories

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Polynomials and matrices (11C99)

Recommendations

• Arithmetic definability by formulas with two quantifiers
• scientific article; zbMATH DE number 3904673
• Arithmetic-analytic properties of binary positive-definite quadratic forms
• Arithmetical definability and computational complexity
• scientific article; zbMATH DE number 5267925
• Publication:4942333
• On explicit definability in arithmetic
• Implicit definability in arithmetic
• scientific article; zbMATH DE number 1467185

Cites work

• scientific article; zbMATH DE number 1059204 (Why is no real title available?)
• Definability and decision problems in arithmetic
• Definability, decidability, complexity

Cited in

(2)

• Arithmetic definability by formulas with two quantifiers
• scientific article; zbMATH DE number 1046302 (Why is no real title available?)

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