Zwei Unentscheidbare Probleme Der Analysis

DOI10.1002/malq.19630091802zbMath0207.31002OpenAlexW2137359439MaRDI QIDQ5608008

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)

Related Items (10)

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

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