A compactness theorem for linear equations

Studia Logica 57 (2-3):355 - 357 (1996)
  Copy   BIBTEX


It is proved that a system of linear equations over an arbitrary field has a solution if every finite subsystem has a solution provided that the set of variables can be well ordered.



    Upload a copy of this work     Papers currently archived: 94,385

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Two conjectures on the arithmetic in ℝ and ℂ†.Apoloniusz Tyszka - 2010 - Mathematical Logic Quarterly 56 (2):175-184.
Matrix Algorithms in MATLAB.Ong U. Routh - 2016 - London: Academic Press.
Hilbert's 10th Problem for solutions in a subring of Q.Agnieszka Peszek & Apoloniusz Tyszka - 2019 - Scientific Annals of Computer Science 29 (1):101-111.
Model completion of Lie differential fields.Yoav Yaffe - 2001 - Annals of Pure and Applied Logic 107 (1-3):49-86.
Ax–Schanuel for linear differential equations.Vahagn Aslanyan - 2018 - Archive for Mathematical Logic 57 (5-6):629-648.
An Analysis of Errors Made in the Solution of Simple Linear Equations.Richard Hall - 2002 - Philosophy of Mathematics Education Journal 15.
The linear logic of multisets.A. Tzouvaras - 1998 - Logic Journal of the IGPL 6 (6):901-916.


Added to PP

25 (#632,373)

6 months
6 (#731,878)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On vector spaces over specific fields without choice.Paul Howard & Eleftherios Tachtsis - 2013 - Mathematical Logic Quarterly 59 (3):128-146.

Add more citations

References found in this work

No references found.

Add more references