Intuitionistic modal logic and set theory

1991 ◽  
Vol 56 (2) ◽  
pp. 497-516 ◽  
Author(s):  
K. Lano

The mathematical treatment of the concepts of vagueness and approximation is of increasing importance in artificial intelligence and related research. The theory of fuzzy sets was created by Zadeh [Z] to allow representation and mathematical manipulation of situations of partial truth, and proceeding from this a large amount of theoretical and applied development of this concept has occurred. The aim of this paper is to develop a natural logic and set theory that is a candidate for the formalisation of the theory of fuzzy sets. In these theories the underlying logic of properties and sets is intuitionistic, but there is a subset of formulae that are ‘crisp’, classical and two-valued, which represent the certain information. Quantum logic or logics weaker than intuitionistic can also be adopted as the basis, as described in [L]. The relationship of this theory to the intensional set theory MZF of [Gd] and the global intuitionistic set theory GIZF of Takeuti and Titani [TT] is also treated.

Author(s):  
Georg Peters

It is well accepted that in many real life situations information is not certain and precise but rather uncertain or imprecise. To describe uncertainty probability theory emerged in the 17th and 18th century. Bernoulli, Laplace and Pascal are considered to be the fathers of probability theory. Today probability can still be considered as the prevalent theory to describe uncertainty. However, in the year 1965 Zadeh seemed to have challenged probability theory by introducing fuzzy sets as a theory dealing with uncertainty (Zadeh, 1965). Since then it has been discussed whether probability and fuzzy set theory are complementary or rather competitive (Zadeh, 1995). Sometimes fuzzy sets theory is even considered as a subset of probability theory and therefore dispensable. Although the discussion on the relationship of probability and fuzziness seems to have lost the intensity of its early years it is still continuing today. However, fuzzy set theory has established itself as a central approach to tackle uncertainty. For a discussion on the relationship of probability and fuzziness the reader is referred to e.g. Dubois, Prade (1993), Ross et al. (2002) or Zadeh (1995). In the meantime further ideas how to deal with uncertainty have been suggested. For example, Pawlak introduced rough sets in the beginning of the eighties of the last century (Pawlak, 1982), a theory that has risen increasing attentions in the last years. For a comparison of probability, fuzzy sets and rough sets the reader is referred to Lin (2002). Presently research is conducted to develop a Generalized Theory of Uncertainty (GTU) as a framework for any kind of uncertainty whether it is based on probability, fuzziness besides others (Zadeh, 2005). Cornerstones in this theory are the concepts of information granularity (Zadeh, 1979) and generalized constraints (Zadeh, 1986). In this context the term Granular Computing was first suggested by Lin (1998a, 1998b), however it still lacks of a unique and well accepted definition. So, for example, Zadeh (2006a) colorfully calls granular computing “ballpark computing” or more precisely “a mode of computation in which the objects of computation are generalized constraints”.


Author(s):  
Charles Kinney ◽  
Dean B. Edwards

This paper presents a method for developing a fuzzy logic trail finding algorithm using a technique called embedding human knowledge. The trail finding algorithm was trained to find the pixels in images that closely resemble those that were classified as belonging to a forest trail by a human analyst. The relationship of the fuzzy logic system to a classical logic system is discussed as a method for training the fuzzy sets to mimic a human. The results show that the method outlined in this paper reduced the error in the fuzzy logic system by 99%. More generally, this method can be applied to many different situations to find features in images quickly and effectively.


1997 ◽  
Vol 15 (1) ◽  
pp. 1-29 ◽  
Author(s):  
René Van Egmond ◽  
David Butler

This is a music-theoretical study of the relationship of two-, three-, four-, five-, and six-member subsets of the major (pure minor), harmonic minor, and melodic (ascending) minor reference collections, using pitchclass set analytic techniques. These three collections will be referred to as the diatonic sets. Several new terms are introduced to facilitate the application of pitch-class set theory to descriptions of tonal pitch relations and to retain characteristic intervallic relationships in tonal music typically not found in discussions of atonal pitch-class relations. The description comprises three parts. First, pitch sets are converted to pitchclass sets. Second, the pitch- class sets are categorized by transpositional types. Third, the relations of these transpositional types are described in terms of their key center and modal references to the three diatonic sets. Further, it is suggested that the probability of a specific key interpretation by a listener may depend on the scale-degree functions of the tones.


Author(s):  
John P. Burgess

In the late nineteenth century, Georg Cantor created mathematical theories, first of sets or aggregates of real numbers (or linear points), and later of sets or aggregates of arbitrary elements. The relationship of element a to set A is written a∈A; it is to be distinguished from the relationship of subset B to set A, which holds if every element of B is also an element of A, and which is written B⊆A. Cantor is most famous for his theory of transfinite cardinals, or numbers of elements in infinite sets. A subset of an infinite set may have the same number of elements as the set itself, and Cantor proved that the sets of natural and rational numbers have the same number of elements, which he called ℵ0; also that the sets of real and complex numbers have the same number of elements, which he called c. Cantor proved ℵ0 to be less than c. He conjectured that no set has a number of elements strictly between these two. In the early twentieth century, in response to criticism of set theory, Ernst Zermelo undertook its axiomatization; and, with amendments by Abraham Fraenkel, his have been the accepted axioms ever since. These axioms help distinguish the notion of a set, which is too basic to admit of informative definition, from other notions of a one made up of many that have been considered in logic and philosophy. Properties having exactly the same particulars as instances need not be identical, whereas sets having exactly the same elements are identical by the axiom of extensionality. Hence for any condition Φ there is at most one set {x|Φ(x)} whose elements are all and only those x such that Φ(x) holds, and {x|Φ(x)}={x|Ψ(x)} if and only if conditions Φ and Ψ hold of exactly the same x. It cannot consistently be assumed that {x|Φ(x)} exists for every condition Φ. Inversely, the existence of a set is not assumed to depend on the possibility of defining it by some condition Φ as {x|Φ(x)}. One set x0 may be an element of another set x1 which is an element of x2 and so on, x0∈x1∈x2∈…, but the reverse situation, …∈y2∈y1∈y0, may not occur, by the axiom of foundation. It follows that no set is an element of itself and that there can be no universal set y={x|x=x}. Whereas a part of a part of a whole is a part of that whole, an element of an element of a set need not be an element of that set. Modern mathematics has been greatly influenced by set theory, and philosophies rejecting the latter must therefore reject much of the former. Many set-theoretic notations and terminologies are encountered even outside mathematics, as in parts of philosophy: pair {a,b} {x|x=a or x=b} singleton {a} {x|x=a} empty set ∅ {x|x≠x} union ∪X {a|a∈A for some A∈X} binary union A∪B {a|a∈A or a∈B} intersection ∩X {a|a∈A for all A∈X} binary intersection A∩B {a|a∈A and a∈B} difference A−B {a|a∈A and not a∈B} complement A−B power set ℘(A) {B|B⊆A} (In contexts where only subsets of A are being considered, A-B may be written -B and called the complement of B.) While the accepted axioms suffice as a basis for the development not only of set theory itself, but of modern mathematics generally, they leave some questions about transfinite cardinals unanswered. The status of such questions remains a topic of logical research and philosophical controversy.


2019 ◽  
Vol 9 (1) ◽  
pp. 53-69
Author(s):  
Urszula Idziak ◽  
Bartosz Piotr Bednarczyk

Abstract In our paper, we redefine the category of “family” denoting the relationship of selected members of a post-noble/post-aristocratic milieu in Poland using Alain Badiou’s terminology. Badiou’s ontology based on a mathematical set theory and a generic theory is the most developed, complex, and revolutionary ontology of the 20th and 21st centuries. However, it is rarely adapted to new empirical studies probably because of its novelty and complexity. We do not intend to use the empirical case study made by Smoczynski–Zarycki to inform our argument but instead perform a translation of the Durkheim–Lacanian theoretical standpoint from “Totem…” into the category of “singularity” [singularité] in its relation to “the state of situation” [état de la situation] from “Being and Event” (Badiou 2005). This approach seeks to find a universalizing potential of nobility that will allow it to become a relevant subject for truth procedure analysis.


2010 ◽  
Vol 3 (4) ◽  
pp. 568-599
Author(s):  
LUCIUS T. SCHOENBAUM

We introduce an extension of the propositional calculus to include abstracts of predicates and quantifiers, employing a single rule along with a novel comprehension schema and a principle of extensionality, which are substituted for the Bernays postulates for quantifiers and the comprehension schemata of ZF and other set theories. We prove that it is consistent in any finite Boolean subset lattice. We investigate the antinomies of Russell, Cantor, Burali-Forti, and others, and discuss the relationship of the system to other set-theoretic systems ZF, NBG, and NF. We discuss two methods of axiomatizing higher order quantification and abstraction, and then very briefly discuss the application of one of these methods to areas of mathematics outside of logic.


2002 ◽  
Vol 67 (4) ◽  
pp. 1295-1322 ◽  
Author(s):  
Robert S. Lubarsky

There has been increasing interest in intuitionistic methods over the years. Still, there has been relatively little work on intuitionistic set theory, and most of that has been on intuitionistic ZF. This investigation is about intuitionistic admissibility and theories of similar strength.There are several more particular goals for this paper. One is just to get some more Kripke models of various set theories out there. Those papers that have dealt with IZF usually were more proof-theoretic in nature, and did not provide models. Furthermore, the inspirations for many of the constructions here are classical forcing arguments. Although the correspondence between the forcing and the Kripke constructions is not made tight, the relationship between these two methods is of interest (see [6] for instance) and some examples, even if only suggestive, should help us better understand the relationship between forcing and Kripke constructions. Along different lines, the subject of least and greatest fixed points of inductive definitions, while of interest to computer scientists, has yet to be studied constructively, and probably holds some surprises. Admissibility is of course the proper set-theoretic context for this study. Finally, while most of the classical material referred to here has long been standard, some of it has not been well codified and may even be unknown, so along the way we'll even fill in a gap in the classical literature.The next section develops the basics of IKP, including some remarks on fixed points of inductive definitions.


2013 ◽  
Vol 19 (3) ◽  
Author(s):  
Drew F. Nobile

This paper presents a framework for analyzing the interval structure of pitch-class segments (ordered pitch-class sets). An “interval permutation” is a reordering of the intervals that arise between adjacent members of these pitch-class segments. Because pitch-class segments related by interval permutation are not necessarily members of the same set-class, this theory has the capability to demonstrate aurally significant relationships between sets that are not related by transposition or inversion. I begin with a theoretical investigation of interval permutations followed by a discussion of the relationship of interval permutations to traditional pitch-class set theory, specifically focusing on how various set-classes may be related by interval permutation. A final section applies these theories to analyses of several songs from Schoenberg’s op. 15 song cycle The Book of the Hanging Gardens.


Sign in / Sign up

Export Citation Format

Share Document