A compactness theorem for linear equations
Studia Logica 57 (2-3):355 - 357 (1996)
Abstract
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.DOI
10.1007/bf00370839
My notes
Similar books and articles
Using path diagrams as a structural equation modelling tool.Peter Spirtes, Thomas Richardson, Chris Meek & Richard Scheines - unknown
A proofless proof of the Barwise compactness theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.
Proofs of the Compactness Theorem.Alexander Paseau - 2010 - History and Philosophy of Logic 31 (1):73-98.
Generalizations of Kochen and Specker's theorem and the effectiveness of Gleason's theorem.Itamar Pitowsky - 2003 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 35 (2):177-194.
Analytics
Added to PP
2009-01-28
Downloads
18 (#614,184)
6 months
1 (#447,993)
2009-01-28
Downloads
18 (#614,184)
6 months
1 (#447,993)
Historical graph of 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.
