No label defined (Q3801532)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4068843
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4068843 |
Statements
1987
0 references
systems of linear equations
0 references
first order languages
0 references
satisfiability
0 references
completeness
0 references
compactness
0 references
0.7508394718170166
0 references
0.7496122717857361
0 references
0.7479445934295654
0 references
0.7479445934295654
0 references
0.7263209819793701
0 references
The aim of this paper is to show the close analogy between systems of linear equations over a field R and model-theoretic notions of first order languages. The linear equation \(0=0\) is called a tautology and an equation of the form \(r=0\) with a nonzero \(r\in R\) is called a contradiction; and the basic notion of the linear equation E being true in a model M (in symbols \(M\vDash E)\), is used to define satisfiability of a system \(\Sigma\) of linear equations. After the definition for a system of linear equations being consistent and a series of lemmas, the author finally proves the extended completeness theorem, which implies that every consistent system has a solution, a compactness theorem and a local compactness theorem.
0 references