Talk:Beth definability
Add topic | This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Requested move 6 October 2026
[edit]
 | It has been proposed in this section that Beth definability be renamed and moved to Beth definability theorem. A bot will list this discussion on the requested moves current discussions subpage within an hour of this tag being placed. The discussion may be closed 7 days after being opened, if consensus has been reached (see the closing instructions). Please base arguments on article title policy, and keep discussion succinct and civil. Please use {{subst:requested move}}. Do not use {{requested move/dated}} directly. |
Beth definability → Beth definability theorem – The article is specifically about the theorem generally known as the Beth definability theorem, rather than about Beth definability, which is a less commonly used term for the Beth property of mathematical logic that is actually a real thing (what this theorem is about, and which may deserve its own page). Also, the convention for these theorems is to have theorem at the end of the name (eg Los Tarski preservation theorem, or Tarski's undefinability theorem) Hijiri Suzuki (talk) 00:55, 6 October 2026 (UTC)