The empty set, the singleton, and the ordered pair

نویسنده

  • Akihiro Kanamori
چکیده

For the modern set theorist the empty set ∅, the singleton {a}, and the ordered pair 〈x, y〉 are at the beginning of the systematic, axiomatic development of set theory, both as a field of mathematics and as a unifying framework for ongoing mathematics. These notions are the simplest building blocks in the abstract, generative conception of sets advanced by the initial axiomatization of Ernst Zermelo [1908a] and are quickly assimilated long before the complexities of Power Set, Replacement, and Choice are broached in the formal elaboration of the ‘set of’ {} operation. So it is surprising that, while these notions are unproblematic today, they were once sources of considerable concern and confusion among leading pioneers of mathematical logic like Frege, Russell, Dedekind, and Peano. In the development of modern mathematical logic out of the turbulence of 19th century logic, the emergence of the empty set, the singleton, and the ordered pair as clear and elementary set-theoretic concepts serves as a motif that reflects and illuminates larger and more significant developments in mathematical logic: the shift from the intensional to the extensional viewpoint, the development of type distinctions, the logical vs. the iterative conception of set, and the emergence of various concepts and principles as distinctively set-theoretic rather than purely logical. Here there is a loose analogy with Tarski’s recursive definition of truth for formal languages: The mathematical interest lies mainly in the procedure of recursion and the attendant formal semantics in model theory, whereas the philosophical interest lies mainly in the basis of the recursion, truth and meaning at the level of basic predication. Circling back to the beginning, we shall see how central the empty set, the singleton, and the ordered pair were, after all.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The 2-dimension of a Tree

Let $x$ and $y$ be two distinct vertices in a connected graph $G$. The $x,y$-location of a vertex $w$ is the ordered pair of distances from $w$ to $x$ and $y$, that is, the ordered pair $(d(x,w), d(y,w))$. A set of vertices $W$ in $G$ is $x,y$-located if any two vertices in $W$ have distinct $x,y$-location.A set $W$ of vertices in $G$ is 2-located if it is $x,y$-located, for some distinct...

متن کامل

CATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS

In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...

متن کامل

Math 20201: Algebraic Structures I (sections 1-5)

Definition. A binary operation * on a non-empty set S is a rule that assigns to each ordered pair of elements of elements of S a uniquely determined element of S. The element assigned to the ordered pair (a, b) with a, b ∈ S is denoted by a * b. Remark. In other words, a binary operarion of a set S is a function * : S×S → S from the Cartesian product S × S to the set S. The only difference is t...

متن کامل

Pair-wise Envy Free and Stable Matchings for Two-sided Systems with Techniques

Introduction: The two-sided matching model of Gale and Shapley (1962) can be interpreted as one where a non-empty finite set of firms need to employ a non-empty finite set of workers. Further, each firm can employ at most one worker and each worker can be employed by at most one firm. Each worker has preferences over the set of firms and each firm has preferences over the set of workers. An ass...

متن کامل

Sampling of Multiple Variables Based on Partially Ordered Set Theory

We introduce a new method for ranked set sampling with multiple criteria. The method relaxes the restriction of selecting just one individual variable from each ranked set. Under the new method for ranking, units are ranked in sets based on linear extensions in partially order set theory with considering all variables simultaneously. Results willbe evaluated by a relatively extensive simulation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Bulletin of Symbolic Logic

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2003