Stratified systems of logic

Author(s):  
M. H. A. Newman

The suffixes used in logic to indicate differences of type may be regarded either as belonging to the formalism itself, or as being part of the machinery for deciding which rows of symbols (without suffixes) are to be admitted as significant. The two different attitudes do not necessarily lead to different formalisms, but when types are regarded as only one way of regulating the calculus it is natural to consider other possible ways, in particular the direct characterization of the significant formulae. Direct criteria for stratification were given by Quine, in his ‘New Foundations for Mathematical Logic’ (7). In the corresponding typed form of this theory ordinary integers are adequate as type-suffixes, and the direct description is correspondingly simple, but in other theories, including that recently proposed by Church(4), a partially ordered set of types must be used. In the present paper criteria, equivalent to the existence of a correct typing, are given for a general class of formalisms, which includes Church's system, several systems proposed by Quine, and (with some slight modifications, given in the last paragraph) Principia Mathematica. (The discussion has been given this general form rather with a view to clarity than to comprehensiveness.)

1971 ◽  
Vol 23 (5) ◽  
pp. 866-874 ◽  
Author(s):  
Raymond Balbes

For a distributive lattice L, let denote the poset of all prime ideals of L together with ∅ and L. This paper is concerned with the following type of problem. Given a class of distributive lattices, characterize all posets P for which for some . Such a poset P will be called representable over. For example, if is the class of all relatively complemented distributive lattices, then P is representable over if and only if P is a totally unordered poset with 0, 1 adjoined. One of our main results is a complete characterization of those posets P which are representable over the class of distributive lattices which are generated by their meet irreducible elements. The problem of determining which posets P are representable over the class of all distributive lattices appears to be very difficult.


1962 ◽  
Vol 14 ◽  
pp. 476-481 ◽  
Author(s):  
Bjarni Jónsson

In § 1 we give a characterization of a lattice L that is freely α-generated by a given partially ordered set P. In § 2 we obtain a representation of an element of such a lattice as a sum (product) of additively (multiplicatively) irreducible elements which, although not unique, has some of the desirable features of the canonical representation, in Whitman (2), of an element of a free lattice. The usefulness of this representation is illustrated in § 3, where some further arithmetic properties of these lattices are derived.We use + and . for the binary operations of lattice addition and multiplication, and Σ and II for the corresponding operations on arbitrary sets and sequences of lattice elements. In other respects the terminology will be the same as in Crawley and Dean (1).


1981 ◽  
Vol 46 (1) ◽  
pp. 101-120 ◽  
Author(s):  
James H. Schmerl

AbstractEvery ℵ0-categorical partially ordered set of finite width has a finitely axiomatizable theory. Every ℵ0-categorical partially ordered set of finite weak width has a decidable theory. This last statement constitutes a major portion of the complete (with three exceptions) characterization of those finite partially ordered sets for which any ℵ0-categorical partially ordered set not embedding one of them has a decidable theory.


1990 ◽  
Vol 01 (01) ◽  
pp. 23-48 ◽  
Author(s):  
V.S. SUBRAHMANIAN

Investigations into the semantics of logic programming have largely restricted themselves to the case when the set of truth values being considered is a complete lattice. While a few theorems have been obtained which make do with weaker structures, to our knowledge there is no semantical characterization of logic programming which does not require that the set of truth values be partially ordered. We derive here semantical results on logic programming over a space of truth values that forms a commutative pseudo-ring (an algebraic structure a bit weaker than a ring) with identity. This permits us to study the semantics of multi-valued logic programming having a (possibly) non-partially ordered set of truth values.


1981 ◽  
Vol 4 (3) ◽  
pp. 551-603
Author(s):  
Zbigniew Raś

This paper is the first of the three parts of work on the information retrieval systems proposed by Salton (see [24]). The system is defined by the notions of a partially ordered set of requests (A, ⩽), the set of objects X and a monotonic retrieval function U : A → 2X. Different conditions imposed on the set A and a function U make it possible to obtain various classes of information retrieval systems. We will investigate systems in which (A, ⩽) is a partially ordered set, a lattice, a pseudo-Boolean algebra and Boolean algebra. In my paper these systems are called partially ordered information retrieval systems (po-systems) lattice information retrieval systems (l-systems); pseudo-Boolean information retrieval systems (pB-systems) and Boolean information retrieval systems (B-systems). The first part concerns po-systems and 1-systems. The second part deals with pB-systems and B-systems. In the third part, systems with a partial access are investigated. The present part discusses the method for construction of a set of attributes. Problems connected with the selectivity and minimalization of a set of attributes are investigated. The characterization and the properties of a set of attributes are given.


1974 ◽  
Vol 17 (4) ◽  
pp. 406-413 ◽  
Author(s):  
Jürgen Schmidt

The main result of this paper is the theorem in the title. Only special cases of it seem to be known so far. As an application, we obtain a result on the unique extension of Galois connexions. As a matter of fact, it is only by the use of Galois connexions that we obtain the main result, in its present generality.


1972 ◽  
Vol 13 (4) ◽  
pp. 451-455 ◽  
Author(s):  
Stephen T. L. Choy

For a semigroup S let I(S) be the set of idempotents in S. A natural partial order of I(S) is defined by e ≦ f if ef = fe = e. An element e in I(S) is called a primitive idempotent if e is a minimal non-zero element of the partially ordered set (I(S), ≦). It is easy to see that an idempotent e in S is primitive if and only if, for any idempotent f in S, f = ef = fe implies f = e or f is the zero element of S. One may also easily verify that an idempotent e is primitive if and only if the only idempotents in eSe are e and the zero element. We let П(S) denote the set of primitive idempotent in S.


1994 ◽  
Vol 03 (02) ◽  
pp. 223-231
Author(s):  
TOMOYUKI YASUDA

A ribbon n-knot Kn is constructed by attaching m bands to m + 1n-spheres in the Euclidean (n + 2)-space. There are many way of attaching them; as a result, Kn has many presentations which are called ribbon presentations. In this note, we will induce a notion to classify ribbon presentations for ribbon n-knots of m-fusions (m ≥ 1, n ≥ 2), and show that such classes form a totally ordered set in the case of m = 2 and a partially ordered set in the case of m ≥ 1.


2018 ◽  
Vol 21 (4) ◽  
pp. 593-628 ◽  
Author(s):  
Cihan Okay

AbstractIn this paper, we study the homotopy type of the partially ordered set of left cosets of abelian subgroups in an extraspecial p-group. We prove that the universal cover of its nerve is homotopy equivalent to a wedge of r-spheres where {2r\geq 4} is the rank of its Frattini quotient. This determines the homotopy type of the universal cover of the classifying space of transitionally commutative bundles as introduced in [2].


Sign in / Sign up

Export Citation Format

Share Document