Consistent and Inconsistent System

Keyword(s):  
2011 ◽  
Vol 2011 ◽  
pp. 1-5 ◽  
Author(s):  
Czesław Stępniak

The least squares problem appears, among others, in linear models, and it refers to inconsistent system of linear equations. A crucial question is how to reduce the least squares solution in such a system to the usual solution in a consistent one. Traditionally, this is reached by differential calculus. We present a purely algebraic approach to this problem based on some identities for nonhomogeneous quadratic forms.


1950 ◽  
Vol 15 (1) ◽  
pp. 25-32 ◽  
Author(s):  
Hao Wang

The main purpose of this paper is to present a formal systemPin which we enjoy a smooth-running technique and which countenances a universe of classes which is symmetrical as between large and small. More exactly,Pis a system which differs from the inconsistent system of [1] only in the introduction of a rather natural new restrictive condition on the defining formulas of the elements (sets, membership-eligible classes). It will be proved that if the weaker system of [2] is consistent, thenPis also consistent.After the discovery of paradoxes, it may be recalled, Russell and Zermelo in the same year proposed two different ways of safeguarding logic against contradictions (see [3], [4]). Since then various simplifications and refinements of these systems have been made. However, in the resulting systems of Zermelo set theory, generation of classes still tends to be laborious and uncertain; and in the systems of Russell's theory of types, complications in the matter of reduplication of classes and meaningfulness of formulas remain. In [2], Quine introduced a system which seems to be free from all these complications. But later it was found out that in it there appears to be an unavoidable difficulty connected with mathematical induction. Indeed, we encounter the curious situation that although we can prove in it the existence of a class V of all classes, and we can also prove particular existence theorems for each of infinitely many classes, nobody has so far contrived to prove in it that V is an infinite class or that there exists an infinite class at all.


1999 ◽  
Vol 28 (1) ◽  
pp. 94-99
Author(s):  
Nkulu Kabuya

This paper reconsiders claims that the Swahili of the Congo Copperbelt area has a limited noun class system and an inconsistent system of agreement. It shows that there are, operating side-by-side with the simple system generally presented by scholars, a noun class and concord system of the original Bantu type, and that the prefixes of the latter are in free variation with those of their simplified versions. This free variation is discussed from grammatical, sociolinguistic, and stylistic perspectives. The conclusion reached is that by spreading change in its lexicon and morphosyntax, Congo Copperbelt Swahili has developed a system of singular/plural prefixes that will eventually replace the traditional class system.


1988 ◽  
Vol 17 (271) ◽  
Author(s):  
Erik Meineche Schmidt ◽  
Michael I. Schwartzbach

A <em>type hierarchy</em> for an imperative language defines an ordering on the types such that any application for small types may be reused for all larger types. The imperative facet makes this non-trivial; the straight-forward definitions will yield an inconsistent system. We introduce a new type constructor, the <em>partial product</em>, and show how to define a <em>consistent</em> hierarchy in the context of <em>fully recursive</em> types. A simple <em>polymorphism</em> is derived. By extending the types to include <em>stuctural invariants</em> we obtain a particularly appropriate notation for defining recursive types, that is superior to traditional type sums and products. We show how the ordering on types <em>extends</em> to an ordering on types with invariants. We allow the use of <em>least upper bounds</em> in type definitions and show how to resolve type equations involving these, and how to compute upper bounds of invariants.


1944 ◽  
Vol 9 (2) ◽  
pp. 42-45 ◽  
Author(s):  
J. C. C. McKinsey

We say that a system S of sentential calculus is an extension of a system R, if R and S have the same class of (meaningful) sentences, and every provable sentence of R is also provable in S. If the two classes of provable sentences do not coincide, we call S a proper extension of R.By a complete system of sentential calculus is meant one which is itself consistent, but has no consistent proper extensions. Thus one cannot add a new independent primitive sentence to a complete system without obtaining an inconsistent system. The usual two-valued sentential calculus is complete in the sense defined.It has been shown by Lindenbaum that every incomplete system of sentential calculus possesses at least one complete extension. In this paper we shall examine how many complete extensions there are of some of the Lewis systems of sentential calculus. We shall show that there is only one complete extension of S4 (and hence also of S5, which is an extension of S4), and that there are infinitely many complete extensions of S2 (and hence also of S1, since S2 is an extension of S1). We leave open the question how many complete extensions there are of S3.


2006 ◽  
Vol 99 (6) ◽  
pp. 419-423
Author(s):  
Joseph Ordinans

In working with 2 × 2 systems of equations, there are three possibilities: the two lines intersect at a point, called a consistent, independent system; the lines are parallel, called an inconsistent system; or the lines coincide, called a consistent, dependent system.


Sign in / Sign up

Export Citation Format

Share Document