Zwei Unentscheidbare Probleme Der Analysis

DOI10.1002/MALQ.19630091802MaRDI QIDQ5608008zbMATH OpenOpenAlexFDO

Authors Bruno Scarpellini

Publication date 1963

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35)

Cited in

(10)

• Undecidability and incompleteness in classical mechanics
• A notion of mechanistic theory
• Hypercomputation: Philosophical issues
• Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
• Undecidability through Fourier series
• Decision problems for differential equations
• Physical computability theses
• The complexity of proving chaoticity and the Church-Turing thesis
• Recursive analysis of singular ordinary differential equations
• A note on discreteness and virtuality in analog computing

This page was built for publication: Zwei Unentscheidbare Probleme Der Analysis

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