Protoalgebraic logics

There exist important deductive systems, such as the non-normal modal logics, that are not proper subjects of classical algebraic logic in the sense that their metatheory cannot be reduced to the equational metatheory of any particular class of algebras. Nevertheless, most of these systems are amenable to the methods of universal algebra when applied to the matrix models of the system. In the present paper we consider a wide class of deductive systems of this kind called protoalgebraic logics. These include almost all (non-pathological) systems of prepositional logic that have occurred in the literature. The relationship between the metatheory of a protoalgebraic logic and its matrix models is studied. The following results are obtained for any finite matrix model U of a filter-distributive protoalgebraic logic : (I) The extension _U of is finitely axiomatized (provided has only finitely many inference rules); (II) _U has only finitely many extensions.     

Varieties of Monadic Heyting Algebras. Part III

This paper is the concluding part of [1] and [2], and it investigates the inner structure of the lattice (MHA) of all varieties of monadic Heyting algebras. For every n , we introduce and investigate varieties of depth n and cluster n, and present two partitions of (MHA), into varieties of depth n, and into varieties of cluster n. We pay a special attention to the lower part of (MHA) and investigate finite and critical varieties of monadic Heyting algebras in detail. In particular, we prove that there exist exactly thirteen critical varieties in (MHA) and that it is decidable whether a given variety of monadic Heyting algebras is finite or not. The representation of (MHA) is also given. All these provide us with a satisfactory insight into (MHA). Since (MHA) is dual to the lattice NExtMIPC of all normal extensions of the intuitionistic modal logic MIPC, we also obtain a clearer picture of the lattice structure of intuitionistic modal logics over MIPC.     

The completeness of S

The subsystem S of Parry's AI [10] (obtained by omitting modus ponens for the material conditional) is axiomatized and shown to be strongly complete for a class of three valued Kripke style models. It is proved that S is weakly complete for the class of consistent models, and therefore that Ackermann's rule is admissible in S. It also happens that S is decidable and contains the Lewis system S4 on translation — though these results are not presented here. S is arguably the most relevant relevant logic known at this time to be decidable.I wish to thank Jill Pipher and Professora Nuel D. Belnap, Jr. and David Kaplan for their helpful comments on an earlier version of this paper.     

An almost general splitting theorem for modal logic

Given a normal (multi-)modal logic a characterization is given of the finitely presentable algebras A whose logics L A split the lattice of normal extensions of . This is a substantial generalization of Rautenberg [10] and [11] in which is assumed to be weakly transitive and A to be finite. We also obtain as a direct consequence a result by Blok [2] that for all cycle-free and finite A L A splits the lattice of normal extensions of K. Although we firmly believe it to be true, we have not been able to prove that if a logic splits the lattice of extensions of then is the logic of an algebra finitely presentable over ; in this respect our result remains partial.     

An application of a Theorem of Ash to finite covers

The technique of covers is now well established in semigroup theory. The idea is, given a semigroup S, to find a semigroup having a better understood structure than that of S, and an onto morphism of a specific kind from to S. With the right conditions on , the behaviour of S is closely linked to that of . If S is finite one aims to choose a finite . The celebrated results for inverse semigroups of McAlister in the 1970s form the flagship of this theory.Weakly left quasi-ample semigroups form a quasivariety (of algebras of type(2, 1)), properly containing the classes of groups, and of inverse, left ample, and weakly left ample semigroups. We show how the existence of finite proper covers for semigroups in this quasivariety is a consequence of Ashs powerful theorem for pointlike sets. Our approach is to obtain a cover of a weakly left quasi-ample semigroup S as a subalgebra of S × G, where G is a group. It follows immediately from the fact that weakly left quasi-ample semigroups form a quasivariety, that is weakly left quasi-ample. We can then specialise our covering results to the quasivarieties of weakly left ample, and left ample semigroups. The latter have natural representations as (2, 1)-subalgebras of partial (one-one) transformations, where the unary operation takes a transformation to the identity map in the domain of . In the final part of this paper we consider representations of weakly left quasi-ample semigroups.This work was supported by the London Mathematical Society, Fundação para a Ciência e a Tecnologia, Centro de Álgebra da Universidade de Lisboa, Centro de Matemática da Universidade do Porto and projects POCTI/32440/MAT/2000 and POCTI/32817/Mat/2000 of FEDER.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko     

On Extensions of Intermediate Logics by Strong Negation

In this paper we will study the properties of the least extension n() of a given intermediate logic by a strong negation. It is shown that the mapping from to n() is a homomorphism of complete lattices, preserving and reflecting finite model property, frame-completeness, interpolation and decidability. A general characterization of those constructive logics is given which are of the form n (). This summarizes results that can be found already in [13,14] and [4]. Furthermore, we determine the structure of the lattice of extensions of n(LC).     

On modal logic with an intuitionistic base

A definition of the concept of Intuitionist Modal Analogue is presented and motivated through the existence of a theorem preserving translation fromMIPC (see [2]) to a bimodalS ⁴–S⁵ calculus.Allatum est die 9 Septembris 1975     

Construction of monadic three-valued Łukasiewicz algebras

The notion of monadic three-valued ukasiewicz algebras was introduced by L. Monteiro ([12], [14]) as a generalization of monadic Boolean algebras. A. Monteiro ([9], [10]) and later L. Monteiro and L. Gonzalez Coppola [17] obtained a method for the construction of a three-valued ukasiewicz algebra from a monadic Boolea algebra. In this note we give the construction of a monadic three-valued ukasiewicz algebra from a Boolean algebra B where we have defined two quantification operations and ^* such that ^*x=^*x (where ^*x=-^*-x). In this case we shall say that and ^* commutes. If B is finite and is an existential quantifier over B, we shall show how to obtain all the existential quantifiers ^* which commute with .Taking into account R. Mayet [3] we also construct a monadic three-valued ukasiewicz algebra from a monadic Boolean algebra B and a monadic ideal I of B. The most essential results of the present paper will be submitted to the XXXIX Annual Meeting of the Unión Matemática Argentina (October 1989, Rosario, Argentina).     

Relevant analytic tableaux

Tableau formulations are given for the relevance logics E (Entailment), R (Relevant implication) and RM (Mingle). Proofs of equivalence to modus-ponens-based formulations are vialeft-handed Gentzen sequenzen-kalküle. The tableau formulations depend on a detailed analysis of the structure of tableau rules, leading to certain global requirements. Relevance is caught by the requirement that each node must be used; modality is caught by the requirement that only certain rules can cross a barrier. Open problems are discussed.     

A non-finitely based quasi-variety of De Morgan algebras

In this paper we exhibit a non-finitely based, finitely generated quasi-variety of De Morgan algebras and determine the bottom of the lattices of sub-quasi-varieties of Kleene and De Morgan algebras.Supported by Vicerrectoría Académica de la Facultad de Ciencias and by División de Investigación, Sede Bogotá of the Universidad Nacional de Colombia.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko     

Some properties of two measures of multivariate association

Two kinds of measures of multivariate association, based on Wilks' and the Bartlett-Nanda-Pillai trace criterionV, respectively, are compared in terms of properties of the univariateR ² which they generalize. A unified set of derivations of the properties is provided which are self-contained and not restricted to decompositions in canonical variates. One conclusion is that asymmetric index based on allows generalization of the multiplicative decomposition ofR ² in terms of squared partial correlations, but not the additive decomposition in terms of squared semipartial correlations, while the reverse is true for anasymmetric index based onV.We are indebted to Jos M. F. ten Berge for some fruitful discussions.     

A Generalization of the Łukasiewicz Algebras

We introduce the variety _n ^m , m 1 and n 2, of m-generalized ukasiewicz algebras of order n and characterize its subdirectly irreducible algebras. The variety _n ^m is semisimple, locally finite and has equationally definable principal congruences. Furthermore, the variety _n ^m contains the variety of ukasiewicz algebras of order n.     

Undecidability and intuitionistic incompleteness

Let S be a deductive system such that S-derivability (s) is arithmetic and sound with respect to structures of class K. From simple conditions on K and s, it follows constructively that the K-completeness of s implies MP(S), a form of Markov's Principle. If s is undecidable then MP(S) is independent of first-order Heyting arithmetic. Also, if s is undecidable and the S proof relation is decidable, then MP(S) is independent of second-order Heyting arithmetic, HAS. Lastly, when s is many-one complete, MP(S) implies the usual Markov's Principle MP.An immediate corollary is that the Tarski, Beth and Kripke weak completeness theorems for the negative fragment of intuitionistic predicate logic are unobtainable in HAS. Second, each of these: weak completeness for classical predicate logic, weak completeness for the negative fragment of intuitionistic predicate logic and strong completeness for sentential logic implics MP. Beth and Kripke completeness for intuitionistic predicate or sentential logic also entail MP.These results give extensions of the theorem of Gödel and Kreisel (in [4]) that completeness for pure intuitionistic predicate logic requires MP. The assumptions of Gödel and Kreisel's original proof included the Axiom of Dependent Choice and Herbrand's Theorem, no use of which is explicit in the present article.     

Internal approach to external sets and universes

In this article we show how the universe of HST, Hrbaek set theory (a nonstandard set theory of external type, which includes, in particular, the ZFC Replacement and Separation schemata for all formulas in the language containing the membership and standardness predicates, and Saturation for standard size families of internal sets, but does not include the Power set axiom) admits a system of subuniverses which keep the Replacement, model Power set and Choice (in fact all of ZFC, with the exception of the Regularity axiom, which indeed is replaced by the Regularity over the internal subuniverse), and also keep as much of Saturation as it is necessary.This gives sufficient tools to develop the most complicated topics in nonstandard analysis, such as Loeb measures.Partially supported by AMS grants in 1993 – 1995 and DFG grants in 1994 – 1995. Robert Goldblatt     

Finite basis problems and results for quasivarieties

Let be a finite collection of finite algebras of finite signature such that SP( ) has meet semi-distributive congruence lattices. We prove that there exists a finite collection ₁ of finite algebras of the same signature, , such that SP( ₁) is finitely axiomatizable.We show also that if , then SP( ₁) is finitely axiomatizable. We offer new proofs of two important finite basis theorems of D. Pigozzi and R. Willard. Our actual results are somewhat more general than this abstract indicates.While working on this paper, the first author was partially supported by the Hungarian National Foundation for Scientific Research (OTKA) grant no. T37877 and the second author was supported by the US National Science Foundation grant no. DMS-0245622.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko     

The relationship of sexual attitudes,attitudes about women,and racial attitudes in white males

A questionnaire measuring sexual attitudes, attitudes about women, and racial attitudes was administered to 350 White male college students. Sexual attitudes characterized by sexual guilt, emphasis on personal and social control of sexual expression, and depersonalization of sex were significantly positively correlated (p<.001) with attitudes that typified women in terms of traditional masculine—feminine stereotypes and good (nonsexual)—bad (sexual) dichotomies. These stereotyped and dichotomous attitudes about women and constricted and depersonalized sexual attitudes were both significantly positively correlated (p<.001) with negative racial attitudes. The implications of these results and other research suggested by this investigation are discussed.This report is based on a dissertation submitted in partial fulfillment of the requirements for the Ph.D. degree at Michigan State University, 1973. The author would like to express appreciation to Dozier W. Thornton for continued guidance and assistance as dissertation advisor. In addition, the author gratefully acknowledges the assistance of Donald L. Grummon, Andrew M. Barclay, and Jeanne E. Gullahorn, all of whom served on the dissertation committee.     

MMPI-2 Assessment of Varying Levels of Posttraumatic Stress in Vietnam Combat Veterans

The effectiveness of the MMPI-2 in the detection of posttraumatic stress (PTS) symptomatology was investigated. Forty-nine veterans at a VA posttraumatic stress clinic were evaluated for PTS symptomatology according to DSM-III-R criteria. The ability of the MMPI-2 to differentiate between Vietnam combat veterans (VCV) who met DSM-III-R criteria for posttraumatic stress disorder (PTSD; N = 36) and those who reported varying levels of posttraumatic stress symptoms (PTSS; N = 13) was examined. Overall, the MMPI-2 was effective in differentiating between the two groups of veterans. Of the 15 MMPI-2 scales used to evaluate PTS symptomatology, 12 significantly differentiated veterans with PTSD from those with PTSS. Diagnostic efficiency statistics for the MMPI-2 PTSD scales (PS and PK) were calculated at four cutoff points (T 65, 70, 75, and 80). The PS Scale was the most robust and effective index in differentiating between veterans with PTSD and those with PTSS. Implications for the assessment of varying degrees of PTS are discussed.     

Syntactical results on the arithmetical completeness of modal logic

In this paper the PA-completeness of modal logic is studied by syntactical and constructive methods. The main results are theorems on the structure of the PA-proofs of suitable arithmetical interpretationsS of a modal sequentS, which allow the transformation of PA-proofs ofS into proof-trees similar to modal proof-trees. As an application of such theorems, a proof of Solovay's theorem on arithmetical completeness of the modal system G is presented for the class of modal sequents of Boolean combinations of formulas of the form p _i,m _i=0, 1, 2, ... The paper is the preliminary step for a forthcoming global syntactical resolution of the PA-completeness problem for modal logic.     

The Poznań school methodology of idealization and concretization from the point of view of a revised structuralist theory conception

My thesis is that some methodological ideas of the Pozna school, i.e., the principles of idealization and concretization (factualization), and the correspondence principle can be represented rather successfully using the relations of theoretization and specialization of revised structuralism.Let <n(i), t(j)> (i=1,...m, j=1,...k) denote the conceptual apparatus of a theory T, and a class M={} (i=1,...m, j=1,...k) the models of T. The n-components refer to the values of dependent variables and t-components to the values of independent variables of the theory. The n- and t-components in turn represent appropriate concepts. Consider T ^* as a conceptual enrichment of T with concepts <n(i ^*), t(j ^*)> (i<i ^* or j<j ^*) and models M ^*={<D ^*, n(i ^*), t(j ^*)>}. If the classes M and M ^* are suitably related, then the situation illustrates both the case of the theoretization-relation of (revised) structuralism and of the factualization-principle of the Pozna school.Assume now that the concepts n(i), t(j) of T for some i, j are operationalized using some special assumptions generating appropriate empirical values n and t for these concepts. Let M denote the class {<D,...n,...t,...>} which is formed by substituting n and t for values of concepts n(i), t(j) in the elements of M. If the classes M and M are related in a suitable way then the situation is an example of both the specialization-relation of (revised) structuralism and the concretization-principle of the Pozna school. The correspondence principle in turn can be represented as a limiting case of the theoretization-relation of (revised) structuralism.Many thanks to my anonymous referees for critical and fruitful comments and special thanks to Dr. Carol Norris for correcting the language of this paper.