Weak arithmetics (Q5941252)

From MaRDI portal

Revision as of 19:22, 3 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 1635417

Language	Label	Description	Also known as
English	Weak arithmetics	scientific article; zbMATH DE number 1635417

Statements

scholarly article

0 references

Weak arithmetics (English)

0 references

Theoretical Computer Science

0 references

publication date

20 August 2001

0 references

zbMATH Keywords

weak arithmetics

0 references

MaRDI profile type

MaRDI publication profile

0 references

On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

0 references

Saturation and stability in the theory of computation over the reals

0 references

0 references

Computer science and the fine structure of Borel sets

0 references

Maximal fields with valuations

0 references

Diophantine induction

0 references

0 references

0 references

Two Applications of Logic to Mathematics

0 references

Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0304-3975(00)00106-7

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5941252

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5941252&oldid=34282526"