scientific article; zbMATH DE number 4068843
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.
- Affine systems of equations and counting infinitary logic
- Useful mathematical relationships embedded in Tversky's \textit{elimination by aspects} model.
- Equational fragments of systems for arithmetic.
- On the satisfiability of linear systems of equations for quantifiers
- A compactness theorem for linear equations
- Systems of equations in inductive sets
- Non-solvable spaces of linear equation systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801532)