A compactness theorem for linear equations (Q2563454): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The relationship between two weak forms of the axiom of choice / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00370839 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073587745 / rank | |||
Normal rank | |||
Latest revision as of 09:10, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A compactness theorem for linear equations |
scientific article |
Statements
A compactness theorem for linear equations (English)
0 references
12 December 1996
0 references
The Boolean prime ideal theorem (BPI) is known to be equivalent to the assertion that a system \(\Sigma\) of equations over a finite field \(F\) has a solution if each finite subsystem has one. For the field of real numbers the assertion is known to be false for countable \(\Sigma\). \textit{A. Abian} [Arch. Math., Brno 12, 43-44 (1976; Zbl 0351.15004)] has shown that for arbitrary fields the assertion holds if \(\Sigma\) consists of linear equations only. Seemingly unaware of this paper, the authors reproduce Abian's result and counterexample.
0 references
axiom of choice
0 references
Boolean prime ideal theorem
0 references
linear equations
0 references
