Reference Fixing and the Paradoxes

I defend the hypothesis that the semantic paradoxes, the paradoxes about collections, and the sorites paradoxes, are all paradoxes of reference fixing: they show that certain conventionally adopted and otherwise functional reference-fixing principles cannot provide consistent assignments of reference to certain relevant expressions in paradoxical cases. I note that the hypothesis has interesting implications concerning the idea of a unified account of the semantic, collection and sorites paradoxes, as well as about the explanation of their “recalcitrance”. I also note that it does not necessarily imply that one should not expect the sometimes hoped for “unique” solution to a paradox of these kinds

Exploring subsethood to determine firing strength in non-singleton fuzzy logic systems

Real world environments face a wide range of sources of noise and uncertainty. Thus, the ability to handle various uncertainties, including noise, becomes an indispensable element of automated decision making. Non-Singleton Fuzzy Logic Systems (NSFLSs) have the potential to tackle uncertainty within the design of fuzzy systems. The firing strength has a significant role in the accuracy of FLSs, being based on the interaction of the input and antecedent fuzzy sets. Recent studies have shown that the standard technique for determining firing strengths risks substantial information loss in terms of the interaction of the input and antecedents. Recently, this issue has been addressed through exploration of alternative approaches which employ the centroid of the intersection (cen-NS) and the similarity (sim-NS) between input and antecedent fuzzy sets. This paper identifies potential shortcomings in respect to the previously introduced similarity-based NSFLSs in which firing strength is defined as the similarity between an input FS and an antecedent. To address these shortcomings, this paper explores the potential of the subsethood measure to generate a more suitable firing level (sub-NS) in NSFLSs featuring various noise levels. In the experiment, the basic waiter tipping fuzzy logic system is used to examine the behaviour of sub-NS in comparison with the current approaches. Analysis of the results shows that the sub-NS approach can lead to more stable behaviour in real world applications

Necessitism and Unrestricted Quantification

As Williamson puts it, ‘necessitism’ is the metaphysical view that claims that “necessarily everything is necessarily something”. As that claim involves modal unrestricted quantification, the necessitist must accept it as a part of an intelligible discourse. Here, I present one of the main objections that have been presented against the intelligibility of unrestricted quantification: the objection based on the so-called All-in-One Principle. I then propose possible strategies that the necessitist could adopt to shield themselves from the objection

The Sorites, Content Fixing, and the Roots of Paradox

The presentation of the “dual picture of vagueness” in my earlier work is supplemented here with a number of additional considerations. I emphasize how the picture lends itself naturally to treatments of the contribution of a typical degree adjective to propositional content and to truth conditions. A number of reasonable refinements of the picture are presented, especially concerning occasions of use of a degree adjective in which a class containing a sorites series is somehow involved in content fixing, but in such a way that an extension ultimately gets fixed for the predicate. I also develop the observation that standard theories of the logical and semantic paradoxes rely on the idea that the content-fixing mechanisms for the paradoxical expressions work well in general but fail in some localized cases, and that while standard theories of the sorites paradox are clearly not based on this idea at all, the dual theory is fully based on the idea. Next, I offer a few remarks on some recent theories of vagueness and the sorites that are broadly in the spirit of the dual picture, emphasizing the aspects where the latter compares favorably against those recent theories. Finally, the question whether the dual theory is statable with truth according to the theory itself is considered in more detail than in my earlier presentation

The use of data-mining for the automatic formation of tactics

This paper discusses the usse of data-mining for the automatic formation of tactics. It was presented at the Workshop on Computer-Supported Mathematical Theory Development held at IJCAR in 2004. The aim of this project is to evaluate the applicability of data-mining techniques to the automatic formation of tactics from large corpuses of proofs. We data-mine information from large proof corpuses to find commonly occurring patterns. These patterns are then evolved into tactics using genetic programming techniques

Logic of agreement: Foundations, semantic system and proof theory

AbstractIn this paper a multi-valued propositional logic — logic of agreement — in terms of its model theory and inference system is presented. This formal system is the natural consequence of a new way to approach concepts as commonsense knowledge, uncertainty and approximate reasoning — the point of view of agreement. Particularly, it is discussed a possible extension of the Classical Theory of Sets based on the idea that, instead of trying to conceptualize sets as “fuzzy” or “vague” entities, it is more adequate to define membership as the result of a partial agreement among a group of individual agents. Furthermore, it is shown that the concept of agreement provides a framework for the development of a formal and sound explanation for concepts (e.g. fuzzy sets) which lack formal semantics. According to the definition of agreement, an individual agent agrees or not with the fact that an object possesses a certain property. A clear distinction is then established, between an individual agent — to whom deciding whether an element belongs to a set is just a yes or no matter — and a commonsensical agent — the one who interprets the knowledge shared by a certain group of people. Finally, the logic of agreement is presented and discussed. As it is assumed the existence of several individual agents, the semantic system is based on the perspective that each individual agent defines her/his own conceptualization of reality. So the semantics of the logic of agreement can be seen as being similar to a semantics of possible worlds, one for each individual agent. The proof theory is an extension of a natural deduction system, using supported formulas and incorporating only inference rules. Moreover, the soundness and completeness of the logic of agreement are also presented

On the non-necessity of levels in phonology, grammar and ‘abstract semantics’

This paper argues that the abstract levels which are typically recognised in linguistics -- whether within phonology (e.g. the levels of distinctive features, phonemics/phonematics, and phonotactics), grammar (e.g. morphology and syntax), or 'abstract semantics' -- are unnecessary. Although such levels correspond to an intuitively plausible model of natural languages, even natural languages are not fully constructed in the way these levels suggest, while other semiotic systems may be organisationally extremely different from the situation implied by these levels. In order to provide elegant (simple) and intuitively reasonable accounts of the relevant facts of language linguistic theories need to be significantly modified. 'Translating' into the specific technical terms of extended axiomatic functionnalism, the theory which is the focus of this paper, this means that the levels of ontidics (cenidics/phonidics, logidics/lexidics, delidics), ontematics (cenematics/phonematics, logematics/lexematics, delematics), and ontotactics (cenotactics/phonotactics, logotactics/lexotactics, delotactics) which are currently recognised in the system ontology of the theory are unnecessary. The entire theory of extended axiomatic functionalism, as well as the descriptions which it yields, can be simplified and made more coherent by removing these as separate theoretical levels, and recognising that their proper significance is as generalizing labels for describing how some kinds of semiotic systems -- and particularly natural languages -- are at least partially organised

Topological set theories and hyperuniverses

We give a new set theoretic system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK and the theory of hyperuniverses. On the other hand, it retains most of the expressiveness of these theories and has the same consistency strength as ZF. We single out the additional axiom of the universal set as the one that increases the consistency strength to that of GPK and explore several other axioms and interrelations between those theories. Hyperuniverses are a natural class of models for theories with a universal set. The Aleph_0- and Aleph_1-dimensional Cantor cubes are examples of hyperuniverses with additivity Aleph_0, because they are homeomorphic to their hyperspace. We prove that in the realm of spaces with uncountable additivity, none of the generalized Cantor cubes has that property. Finally, we give two complementary constructions of hyperuniverses which generalize many of the constructions found in the literature and produce initial and terminal hyperuniverses