PROPOSITIONAL LOGIC,FRAMES, AND FUZZY ALGEBRA

Abstract

This paper offers a new look at such things as the fuzzy subalgebras and congruences of an algebra, the fuzzy ideals of a ring or a lattice, and similar entities, by exhibiting them as the models, in the chosen frame T of truth values, of naturally corresponding propositional theories. This provides a systematic approach to the study of the partially ordered sets formed by these various entities, and we demonstrate its usefulness by employing it to derive a number of results, some old and some new, concerning these partially ordered sets. In particular, we prove they are complete lattices, algebraic or continuous, depending on whether T is algebraic or continuous, respectively (Proposition 3); they satisfy the same lattice identities for arbitrary T that hold in the case T = 2 (Corollary of Proposition 4); and they are coherent frames for any coherent T whenever this is the case for T = 2 (Proposition 6). In addition we show, generalizing a result by Makamba and Murali [10], that the familiar classical situations where the congruences of an algebra correspond to certain other entities, such as the normal subgroups of a group or the ideals of a ring, extend to the fuzzy case by proving that the corresponding propositional theories are equivalent (Proposition 2). Further, we obtain the result of Gupta and Kantroo [5] that the fuzzy radical ideals of a commutative ring with unit are the meets of fuzzy prime ideals for arbitrary continuous T in place of the unit interval, using basic facts concerning continuous frames (Proposition 7).     

Groupwise dense families

We show that the Filter Dichotomy Principle implies that there are exactly four classes of ideals in the set of increasing functions from the natural numbers. We thus answer two open questions on consequences of ? < ?. We show that ? < ? implies that ? = ?, and that Filter Dichotomy together with ? < ? implies ? < ?. The technical means is the investigation of groupwise dense sets, ideals, filters and ultrafilters. With related techniques we prove the new inequality ?≤ cf(?). Received: 9 October 1998 / Revised version: 18 August 1999 / Published online: 21 December 2000     

Two applications of Boolean models

Semantical arguments, based on the completeness theorem for first-order logic, give elegant proofs of purely syntactical results. For instance, for proving a conservativity theorem between two theories, one shows instead that any model of one theory can be extended to a model of the other theory. This method of proof, because of its use of the completeness theorem, is a priori not valid constructively. We show here how to give similar arguments, valid constructively, by using Boolean models. These models are a slight variation of ordinary first-order models, where truth values are now regular ideals of a given Boolean algebra. Two examples are presented: a simple conservativity result and Herbrand's theorem. Received December 5, 1995     

The stable set of associated prime ideals of a polymatroidal ideal

The associated prime ideals of powers of polymatroidal ideals are studied, including the stable set of associated prime ideals of this class of ideals. It is shown that polymatroidal ideals have the persistence property and for transversal polymatroids and polymatroidal ideals of Veronese type the index of stability and the stable set of associated ideals is determined explicitly.     

On the constructive Dedekind reals

In order to build the collection of Cauchy reals as a set in constructive set theory, the only power set-like principle needed is exponentiation. In contrast, the proof that the Dedekind reals form a set has seemed to require more than that. The main purpose here is to show that exponentiation alone does not suffice for the latter, by furnishing a Kripke model of constructive set theory, Constructive Zermelo–Fraenkel set theory with subset collection replaced by exponentiation, in which the Cauchy reals form a set while the Dedekind reals constitute a proper class.     

Proof-theoretic conservations of weak weak intuitionistic constructive set theories

The paper aims to provide precise proof theoretic characterizations of Myhill–Friedman-style “weak” constructive extensional set theories and Aczel–Rathjen analogous constructive set theories both enriched by Mostowski-style collapsing axioms and/or related anti-foundation axioms. The main results include full intuitionistic conservations over the corresponding purely arithmetical formalisms that are well known in the reverse mathematics – which strengthens analogous results obtained by the author in the 80s. The present research was inspired by the more recent Sato-style “weak weak” classical extensional set theories whose proof theoretic strengths are shown to strongly exceed the ones of the intuitionistic counterparts in the presence of the collapsing axioms.     

A nilregular element property

An element a of a commutative ring R is nilregular if and only if x is nilpotent whenever ax is nilpotent. More generally, an ideal I of R is nilregular if and only if x is nilpotent whenever ax is nilpotent for all a ∈ I . We give a direct proof that if R is Noetherian, then every nilregular ideal contains a nilregular element. In constructive mathematics, this proof can then be seen as an algorithm to produce nilregular elements of nilregular ideals whenever R is coherent, Noetherian, and discrete. As an application, we give a constructive proof of the Eisenbud-Evans-Storch theorem that every algebraic set in n-dimensional affine space is the intersection of n hypersurfaces.Received: 6 September 2004     

On the stable set of associated prime ideals of a monomial ideal

It is shown that any set of nonzero monomial prime ideals can be realized as the stable set of associated prime ideals of a monomial ideal. Moreover, an algorithm is given to compute the stable set of associated prime ideals of a monomial ideal.     

Congruences and ideals on Boolean modules: a heterogeneous point of view

Definitions for heterogeneous congruences and heterogeneous ideals on a Boolean module $\mathcal {M}$ are given and the respective lattices $\mathrm{Cong}\mathcal {M}$ and $\mathrm{Ide}\mathcal {M}$ are presented. A characterization of the simple bijective Boolean modules is achieved differing from that given by Brink in a homogeneous approach. We construct the smallest and the greatest modular congruence having the same Boolean part. The same is established for modular ideals. The notions of kernel of a modular congruence and the congruence induced by a modular ideal are introduced to describe an isomorphism between $\mathrm{Cong}\mathcal {M}$ and $\mathrm{Ide}\mathcal {M}$. This isomorphism leads us to conclude that the class of the Boolean module is ideal determined.     

Distinguishing groupwise density numbers

We show that is consistent, where is the groupwise density number and is the groupwise density number for ideals. This answers a question of Heike Mildenberger. Partially supported by Grant-in-Aid for Scientific Research (C) 17540116, Japan Society for the Promotion of Science.     

BCK/BCI-代数的Ω-模糊点理想

给定Ω-集合,引入BCK／BCI-代数的Ω-模糊点理想的概念,给出合适的例子。同时,将Ω-模糊点理想与模糊点理想进行相互刻画。     

Cohen-Macaulay monomial ideals with given radical

We study the set of Cohen-Macaulay monomial ideals with a given radical. Among this set of ideals are the so-called Cohen-Macaulay modifications. Not all Cohen-Macaulay squarefree monomial ideals admit nontrivial Cohen-Macaulay modifications. It is shown that if there exists one such modification, then there exist indeed infinitely many.     

Generalizing realizability and Heyting models for constructive set theory

This article presents a common generalization of the two main methods for obtaining class models of constructive set theory. Heyting models are a generalization of the Boolean models for classical set theory which are a variant of forcing, while realizability is a decidedly constructive method that has first been developed for number theory by Kleene and was later very fruitfully adapted to constructive set theory. In order to achieve the generalization, a new kind of structure (applicative topologies) is introduced, which contains both elements of formal topology and applicative structures. This approach not only deepens the understanding of class models and leads to more efficiency in proofs about these kinds of models, but also makes it possible to prove new results about the two special cases that were not known before and to construct new models.     

BCK-代数的Ω-模糊正定关联理想

给定一个集合Ω,引入了BCK-代数的Ω-模糊正定关联理想的概念,给出了一些恰当的例子,讨论了BCK-代数的Ω-模糊理想与Ω-模糊正定关联理想的关系.利用模糊正定关联理想,刻画了Ω-模糊正定关联理想.反之,模糊正定关联理想通过Ω-模糊正定关联理想来构造.证明了Ω-模糊正定关联理想(Ω-模糊理想)的同态原象仍是Ω-模糊理想(Ω-模糊理想).     

Role of operator semirings in characterizing Γ-semirings in terms of fuzzy subsets

The operator semirings of a ??-semiring have been brought into use to study ??-semiring in terms of fuzzy subsets. This is accomplished by obtaining various relationships between the set of all fuzzy ideals of a ??-semiring and the set of all fuzzy ideals of its left operator semiring such as lattice isomorphism between the sets of fuzzy ideals of a ??-semiring and its operator semirings.     

Ideals with bases of unbounded Borel complexity

We present several naturally defined σ‐ideals which have Borel bases but, unlike for the classical examples, these ideals are not of bounded Borel complexity. We investigate set‐theoretic properties of such σ‐ideals.     

Computability in structures representing a Scott set

Continuing work begun in [10], we utilize a notion of forcing for which the generic objects are structures and which allows us to determine whether these “generic” structures compute certain sets and enumerations. The forcing conditions are bounded complexity types which are consistent with a given theory and are elements of a given Scott set. These generic structures will “represent” this given Scott set, in the sense that the structure has a certain weak saturation property with respect to bounded complexity types in the Scott set. For example, if ? is a nonstandard model of PA, then ? represents the Scott set ? = n∈ω | ?⊧“the nth prime divides a” | a∈?. The notion of forcing yields two main results. The first characterizes the sets of natural numbers computable in all models of a given theory representing a given Scott set. We show that the characteristic function of such a set must be enumeration reducible to a complete existential type which is consistent with the given theory and is an element of the given Scott set. The second provides a sufficient condition for the existence of a structure ? such that ? represents a countable jump ideal and ? does not compute an enumeration of a given family of sets ?. This second result is of particular interest when the family of sets which cannot be enumerated is ? = Rep[Th(?)]. Under this additional assumption, the second result generalizes a result on TA [6] and on certain other completions of PA [10]. For example, we show that there also exist models of completions of ZF from which one cannot enumerate the family of sets represented by the theory. Received: 8 October 1997 / Published online: 25 January 2001