Turing-machines and the Entscheidungsproblem

descriptionPublicationkeyboard_double_arrow_right Article , Part of book or chapter of book 01 Jun 1962 Germany English Publisher:Springer Science and Business Media LLCJournal:Mathematische Annalen, volume 148, pages 201-213 (issn: 0025-5831, eissn: 1432-1807,

Copyright policy )

Authors: BÜCHI, J.R.;

doi: 10.1007/bf01470748 , 10.1007/978-1-4613-8928-6_34

Turing-machines and the Entscheidungsproblem

- Summary
- Subjects
- Metrics

Abstract

Let Q be the set of all sentences of elementary quantification theory (without equality). In its semantic version Hilbert’s Entscheidungsproblem for a class X ⊇ Q of sentences is, [X]: To find a method which for every S ∈ X yields a decision as to whether or not S is satisfiable.

Country

Germany

Related Organizations

DigiZeitschriften
Germany

Keywords

510.mathematics, mathematical logic, Article

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	60
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average