Related papers: The Notion "Pathology" in Set Theory

In extremal set theory our usual goal is to find the maximal size of a family of subsets of an $n$-element set satisfying a condition. A condition is called chain-dependent, if it is satisfied for a family if and only if it is satisfied for…

In Carnot-Caratheodory or sub-Riemannian geometry, one of the major open problems is whether the conclusions of Sard's theorem holds for the endpoint map, a canonical map from an infinite-dimensional path space to the underlying…

Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…

We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential. Also,…

The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…

In the framework of certain general probability theories of single systems, we identify various nonclassical features such as incompatibility, multiple pure-state decomposability, measurement disturbance, no-cloning and the impossibility of…

In this paper, we argue that while the concept of a set-theoretic paradox (or paradoxical set) can be relatively well-defined within a formal setting, the concept of a set-theoretic hypodox (or hypodoxical set) remains significantly less…

We observe that some natural mathematical definitions are lifting properties relative to simplest counterexamples, namely the definitions of surjectivity and injectivity of maps, as well as of being connected, separation axioms $T_0$ and…

In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…

We classify the propositional modal validities arising from the category of sets under its natural classes of morphisms. The resulting validities depend on the morphism class, the size of the world, and the permitted substitution instances.…

The methodology used here might provide a neat method of examining paradoxes and ways to circumvent them. Most of the known set theoretic paradoxes (Russell's, Cantor's, Burali-Forti's,..) can be paralleled here and examined. This account…

Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of…

We try a conceptual analysis of inheritance diagrams, first in abstract terms, and then compare to "normality" and the "small/big sets" of preferential and related reasoning. The main ideas are about nodes as truth values and information…

We study subsets of countable recursively saturated models of $\mathsf{PA}$ which can be defined using pathologies in satisfaction classes. More precisely, we characterize those subsets $X$ such that there is a satisfaction class $S$ where…

Soft set theory provides a direct framework for parameterized decision modeling by assigning to each attribute (parameter) a subset of a given universe, thereby representing uncertainty in a structured way [1, 2]. Over the past decades, the…

Intuitive Set Theory (IST) is defined as the theory we get, when we add Axiom of Monotonicity and Axiom of Fusion to Zermelo-Fraenkel set theory. In IST, Continuum Hypothesis is a theorem, Axiom of Choice is a theorem, Skolem paradox does…

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

We begin with a context more general than set theory. The basic ingredients are essentially the object and functor primitives of category theory, and the logic is weak, requiring neither the Law of Excluded Middle nor quantification. Inside…

The cumulative hierarchy conception of set, which is based on the conception that sets are inductively generated from "former" sets, is generally considered a good way to create a set conception that seems safe from contradictions. This…

In these self-contained low prerequisite introductory notes we first present (in part 1) basic concepts of set theory and algebra without explicit category theory. We then present (in part 2) basic category theory involving a somewhat…