We revisit a typological puzzle due to Horn (Doctoral Dissertation, UCLA, 1972) regarding the lexicalization of logical operators: in instantiations of the traditional square of opposition across categories and languages, the O corner, corresponding to ‘nand’ (= not and), ‘nevery’ (= not every), etc., is never lexicalized. We discuss Horn’s proposal, which involves the interaction of two economy conditions, one that relies on scalar implicatures and one that relies on markedness. We observe that in order to express markedness and to (...) account for a bigger typological puzzle, namely the absence of lexicalizations of ‘XOR’ (= exclusive or), ‘all-or-none’, and many other imaginable logical operators, one must restrict the basic lexicalizable elements to a small set of primitives. We suggest that an ordering based perspective, following Keenan and Faltz (Boolean semantics for natural language, 1985), makes the stipulated primitives that we arrive at more natural. We also propose a modification to Horn’s proposal, based on recent work on implicatures, in which only the implicature condition is operative and in which markedness is part of the definition of the alternatives for scalar implicatures rather than an independent condition. (shrink)

In this paper, we propose a method to design the pseudorandom number generator using three kinds of four-wing memristive hyperchaotic systems with different dimensions as multientropy sources. The principle of this method is to obtain pseudorandom numbers with good randomness by coupling XOR operation on the three kinds of FWMHSs with different dimensions. In order to prove its potential application in secure communication, the security of PRNG based on this scheme is analyzed from the perspective of cryptography. In addition, PRNG (...) has passed the NIST 800.22 and ENT test, which shows that PRNG has good statistical characteristics. Finally, an image encryption algorithm based on PRNG is adopted. In the encryption algorithm, the optimized Arnold matrix scrambling method and the diffusion processing based on XOR are used to obtain the final encrypted image. Through the evaluation of encryption performance, it is concluded that there is no direct relationship between the pristine image and encrypted image. The results show that the proposed image encryption scheme has good statistical output characteristics and security performance in line with cryptography. (shrink)

This article introduces a simple and effective new algorithm for image encryption using a chaotic system which is based on the magic squares. This novel 3D chaotic system is invoked to generate a random key to encrypt any color image. A number of chaotic keys equal to the size of the image are generated by this chaotic system and arranged into a matrix then divided into non-overlapped submatrices. The image to be encrypted is also divided into sub-images, and each sub-image (...) is multiplied by a magic matrix to produce another set of matrices. The XOR operation is then used on the resultant two sets of matrices to produce the encrypted image. The strength of the encryption method is tested in two folds. The first fold is the security analysis which includes key space analysis and sensitivity analysis. In the second fold, statistical analysis was performed, which includes the correlation coefficients, information entropy, the histogram, and analysis of differential attacks. Finally, the time of encryption and decryption was computed and show very good results. (shrink)

Topic of quantum chaos has begun to draw increasing attention in recent years. So, to ensure the security of digital image, an image encryption algorithm based on combining a hyperchaotic system and quantum 3D logistic map is proposed. This algorithm is applied in four stages. Initially, the key generator builds upon the foundation of mean for any row or column of the edges of the plain image. Its output value is used to yield initial conditions and parameters of the proposed (...) image encryption scheme. Next, it diffuses the plain image by the random sequences generated by 3D hyperchaotic system, and the diffusion process is realized by implementing XOR operation. Then, the diffused image and chaotic sequences are produced by the 3D quantum chaotic logistic map, expressed as a quantum superposition state using density matrix which is a representation of the state of a quantum system, and finally the resulting quantum image is then confused and diffused simultaneously by a unitary matrix generated by logistic chaos using XNOR operation to obtain the final cipher image. Because of the dependence on the plain image, the algorithm can frustrate the chosen-plaintext and known-plaintext attacks. Simulation results and theoretical analysis verify that the presented scheme has high safety performance, a good encryption effect, and a large key space. The method can effectively resist exhaustive, statistical, and differential attacks. Moreover, the encryption time of the proposed method is satisfactory, and the method can be efficiently used in practice for the secure transmission of image information. (shrink)

This article discusses the logic of the Epimenides Paradox using a graphical representation of the logical operators involved. The graphical representation of the Logical Operators is the one used in digital electronics. This method of investigation is very effective in revealing the hidden error in the reasoning that leads to the contradiction. The article explains the vicious circle that the mind goes through when trying to analyze the Paradox. Finally, the article proposes a solution of the Paradox with final conclusions (...) that are not paradoxical but simply counterintuitive. The endless deduction is generated by subsequent evaluations that take place on different levels. In its evaluation the Mind alternates a level of logical evaluation with a level of semantic evaluation. (shrink)

Emerging technologies such as cloud computing, augmented and virtual reality, artificial intelligence and robotics, among others, are transforming the field of manufacturing and industry as a whole in unprecedent ways. This fourth industrial revolution is consequentially changing how operators that have been crucial to industry success go about their practices in industrial environments. This short paper briefly introduces the notion of the Operator 4.0 as well as how this novel way of conceptualizing the human operator necessarily implicates human (...) values in the technologies that constitute it. Similarly, the design methodology known as value sensitive design (VSD) is drawn upon to discuss how these Operator 4.0 technologies can be design for human values and, conversely, how a potential value-sensitive Operator 4.0 can be used to strengthen the VSD methodology in developing novel technologies. (shrink)

This paper introduces the concept of Operator Contestability in AI systems: the principle that those overseeing AI systems (operators) must have the necessary control to be accountable for the decisions made by these algorithms. We argue that designers have a duty to ensure operator contestability. We demonstrate how this duty can be fulfilled by applying the'Design for Defeaters' framework, which provides strategies to embed tools within AI systems that enable operators to challenge decisions. Defeaters are designed to contest (...) either the justification for the AI’s data inputs (undercutting defeaters) or the validity of the conclusions drawn from that data (rebutting defeaters). To illustrate the necessity and application of this framework, we examine case studies such as AI-driven recruitment processes, where operators need tools and authority to uncover and address potential biases, and autonomous driving systems, where real-time decision-making is crucial. The paper argues that operator contestability requires ensuring that operators have (1) epistemic access to the relevant normative reasons and (2) the authority and cognitive capacity to act on these defeaters. By addressing these challenges, the paper emphasizes the importance of designing AI systems in a way that enables operators to effectively contest AI decisions, thereby ensuring that the appropriate individuals can take responsibility for the outcomes of human-AI interactions. (shrink)

I argue that ‘actually’ does not have a reading according to which it is synonymous with the actuality operator of modal logic, and propose an alternative account of ‘actually’. The cases that have been thought to show that ‘actually’ is synonymous with the actuality operator are modal and counterfactual sentences in which an embedded clause's evaluation is held fixed at the world of the context. In these cases, though, this embedded clause's evaluation is not due to the presence (...) of ‘actually’. As an alternative, I propose that ‘actually’ is a presupposition trigger along the lines of ‘even’ or ‘too’, and it signals that presupposed information states in the discourse are evolving in a non-standard way. (shrink)

The jump operator on the ω-enumeration degrees was introduced in [I.N. Soskov, The ω-enumeration degrees, J. Logic Computat. 17 1193–1214]. In the present paper we prove a jump inversion theorem which allows us to show that the enumeration degrees are first order definable in the structure of the ω-enumeration degrees augmented by the jump operator. Further on we show that the groups of the automorphisms of and of the enumeration degrees are isomorphic. In the second part of the (...) paper we study the jumps of the ω-enumeration degrees below . We define the ideal of the almost zero degrees and obtain a natural characterization of the class H of the ω-enumeration degrees below which are high n for some n and of the class L of the ω-enumeration degrees below which are low n for some n. (shrink)

Spin is a fundamental and distinctive property of the electron, having far-reaching implications. Yet its purely formal treatment often blurs the physical content and meaning of the spin operator and associated observables. In this work we propose to advance in disclosing the meaning behind the formalism, by first recalling some basic facts about the one-particle spin operator. Consistently informed by and in line with the quantum formalism, we then proceed to analyse in detail the spin projection operator (...) correlation function \=\left\langle \left \left \right\rangle \) for the bipartite singlet state, and show it to be amenable to an unequivocal probabilistic reading. In particular, the calculation of \\) entails a partitioning of the probability space, which is dependent on the directions \.\) The derivation of the CHSH- or other Bell-type inequalities, on the other hand, does not consider such partitioning. This observation puts into question the applicability of Bell-type inequalities to the bipartite singlet spin state. (shrink)

The paper is conceived as a first study on the Suszko operator. The purpose of this paper is to indicate the existence of close relations holding between the properties of the Suszko operator and the structural properties of the model class for various sentential logics. The emphasis is put on generality both of the results and methods of tackling the problems that arise in the theory of this operator. The attempt is made here to develop the theory (...) for non-protoalgebraic logics. (shrink)

It is a widely held view in philosophy that propositions perform a plethora of different theoretical roles. Amongst other things, they are believed to be the semantic values of sentences in contexts, the objects of attitudes, the contents of illocutionary acts, and the referents of that-clauses. This assumption is often combined with the claim that propositions have their truth-values eternally. In this paper I aim to show that these two assumptions are incompatible: propositions cannot both fulfill the mentioned roles and (...) be eternally true or false. Following Kaplan and Lewis’s Operator Argument, I argue that compositional semantic values of sentences in contexts do not correspond to eternal propositions. Thus, either we regard the non-eternal entities that in fact realize the semantic role of propositions as also fulfilling the remaining propositional roles, or we abandon the assumption that there is a unique realizer of all the roles. The Operator Argument has recently come under attack, mainly for its tense-logical assumptions. However, rejecting these assumptions is not a sufficient defense of the compatibility of the two claims, since the extensional alternative to the tense-logical framework does not allow us to universally retain eternal propositions as compositional semantic values of sentences either. (shrink)

It is a well known empirical observation that natural axiomatic theories are pre-well-ordered by consistency strength. For any natural theory $T$, the next strongest natural theory is $T+\mathsf{Con}_T$. We formulate and prove a statement to the effect that the consistency operator is the weakest natural way to uniformly extend axiomatic theories.

Tarski presented his definition of consequence operator to explain the most important notions which any logical consequence concept must contemplate. A Tarski space is a pair constituted by a nonempty set and a consequence operator. This structure characterizes an almost topological space. This paper presents an algebraic view of the Tarski spaces and introduces a modal propositional logic which has as a model exactly the closed sets of a Tarski space. • DOI:10.5007/1808-1711.2010v14n1p47.

There is no unique way to generalize the mass operator 0 2 −p · p to curved spacetimes. The possible generalizations using either an analytic or an algebraic (group-theoretic) approach are discussed. We investigate in detail three possibilities: (i) the generalized D'Alembertian $$- \tilde \square = - (1/\sqrt { - g} )(\partial /\partial x^v )(\sqrt { - g} g^{\mu v} {\text{ }}\partial /\partial x^\mu$$ (ii) the operator ( $- (\tilde \square + \tfrac{1}{6}{\text{R)}}$ , which is conformally invariant in (...) the massless case, and (iii) an operator suggested by Meggs for Robertson-Walker spacetimes. A criterion for choosing among the different possibilities is proposed. It is used to eliminate the Meggs operator, but is not stringent enough to decide between the other two. (shrink)

This note presents some new results from [1] about the Suszko operator and truth‐equational logics, following the works of Czelakowski [11] and Raftery [17]. It is proved that the Suszko operator relative to a truth‐equational logic preserves suprema and commutes with endomorphisms. Together with injectivity, proved by Raftery in [17], the Suszko operator relative to a truth‐equational logic is a structural representation, as defined in [15]. Furthermore, if is a quasivariety, then the Suszko operator relative to (...) a truth‐equational logic is continuous. Finally, it is proved that truth is equationally definable in the class if and only if is a ‐algebraic semantics for and the Suszko operator preserves suprema and commutes with substitutions. (shrink)

This paper deals with the proof theory of first-order applicative theories with non-constructive μ operator and a form of the bar rule, yielding systems of ordinal strength Γ0 and 20, respectively. Relevant use is made of fixed-point theories with ordinals plus bar rule.

To meet the growing demands for yet more efficient and safer traffic, traffic control is deployed in all modes of transportation. In maritime transportation, traffic control is performed by Vessel Traffic Services (VTS). This paper describes research which is focused upon measurement of VTS operator performance. The concept of situation awareness is introduced as a means to describe and quantify VTS operator performance. Situation awareness is tested in a full scale interactive simulator. A scoring system for VTS (...) class='Hi'>operator performance accounts for the specific characteristics of VTS operator work, such as accuracy and relevance of information. (shrink)

The paper argues, that a direct formalization of the way common sense thinks about the numerical identity of enduring entities, requires that traditional predicate logic is developed. If everyday language mirrors the world, then persons, organisms, organs, cells, and ordinary material things can lose some parts but nonetheless remain numerically exactly the same entity. In order to formalize this view, two new logical operators are introduced; and they bring with them some non-standard syntax. One of the operators is called ‘the (...) instantiation operator’; it is needed because the existential quantifier and its traditional relatives cannot do the job required. The other operator is called ‘the form-on-matter operator’, and it allows an individual (an instance of a form) to stay the same even though some of its parts (its constituting matter) is taken away from it. Also, a certain kind of predicates, called ‘nature terms’, is needed in order to represent what gives a particular its kind of identity. Both the operators and the nature terms introduced can be used in constructions of formal languages and formal systems, but no such constructions are made in the paper. The paper is structured as a comment on the philosophical problem called ‘the problem of the cats Tibbles and Tib’. (shrink)

In [2] a semantics for implication is offered that makes use of stories — sets of sentences assembled under various constraints. Sentences are evaluated at an actual world and in each member of a set of stories. A sentence B is true in a story s just when B s. A implies B iff for all stories and the actual world, whenever A is true, B is true. In this article the first-order language of [2] is extended by the addition (...) of the operator the story... says that..., as in The story Flashman among the Redskins says that Flashman met Sitting Bull. The resulting language is shown to be sound and complete. (shrink)

We show that Leitgeb’s dependence operator of Leitgeb is a \-operator and that this is best possible.

In this paper we derive the Schrödinger equation by comparing quantum statistics with classical statistical mechanics, identifying similarities and differences, and developing an operator functional equation which is solved in a completely algebraic fashion with no appeal to spatial invariances or symmetries.

This chapter examines the idea that the logical principles governing the knowledge operator are the root cause of the paradox. There are two such principles: the first is that knowledge implies truth, and the second is that knowledge distributes over conjunction, so that knowledge of a conjunction constitutes knowledge of the conjuncts. It is argued that the paradox cannot be avoided by questioning these principles.

It is well known that the structure of honest elementary degrees is a lattice with rather strong density properties. Let $\mbox{\bf a} \cup \mbox{\bf b}$ and $\mbox{\bf a} \cap \mbox{\bf b}$ denote respectively the join and the meet of the degrees $\mbox{\bf a}$ and $\mbox{\bf b}$ . This paper introduces a jump operator ( $\cdot'$ ) on the honest elementary degrees and defines canonical degrees $\mbox{\bf 0},\mbox{\bf 0}', \mbox{\bf 0}^{\prime \prime },\ldots$ and low and high degrees analogous to the (...) corresponding concepts for the Turing degrees. Among others, the following results about the structure of the honest elementary degrees are shown: There exist low degrees, and there exist degrees which are neither low nor high. Every degree above $\mbox{\bf 0}'$ is the jump of some degree, moreover, for every degree $\mbox{\bf c}$ above $\mbox{\bf 0}'$ there exist degrees $\mbox{\bf a},\mbox{\bf b}$ such that $\mbox{\bf c}=\mbox{\bf a} \cup \mbox{\bf b} = \mbox{{\bf a}}'=\mbox{\bf b}'$ . We have $\mbox{\bf a}'\cup \mbox{\bf b}' \leq (\mbox{\bf a}\cup\mbox{\bf b})'$ and $\mbox{\bf a}'\cap \mbox{\bf b}' \geq (\mbox{\bf a}\cap \mbox{\bf b})'$ . The jump operator is of course monotonic, i.e. $\mbox{\bf a}\leq\mbox{{\bf b}}\Rightarrow \mbox{\bf a}'\leq \mbox{\bf b}'$ . We prove that every situation compatible with $\mbox{\bf a}\leq\mbox{\bf b}\Rightarrow \mbox{\bf a}'\leq \mbox{\bf b}'$ is realized in the structure, e.g. we have incomparable degrees $\mbox{\bf a},\mbox{\bf b}$ such that $\mbox{\bf a}'<\mbox{\bf b}'$ and incomparable degrees $\mbox{\bf a},\mbox{\bf b}$ such that $\mbox{\bf a}' = \mbox{\bf b}'$ etcetera. We are able to prove all these results without the traditional recursion theoretic constructions. Our proof method relies on the fact that the growth of the functions in a degree is bounded. This technique also yields a very simple proof of an old result, namely that the structure is a lattice. (shrink)

An explicit expression of the “Wigner operator” is derived, such that the Wigner function of a quantum state is equal to the expectation value of this operator with respect to the same state. This Wigner operator leads to a representation-independent procedure for establishing the correspondence between the inhomogeneous symplectic group applicable to linear canonical transformations in classical mechanics and the Weyl-metaplectic group governing the symmetry of unitary transformations in quantum mechanics.

A characterisation of a type of weak-operator continuous linear functional on certain linear subsets of B, where H is a Hilbert space, is derived within Bishop-style constructive mathematics.

Starting from the formal expressions of the hydrodynamical (or “local”) quantities employed in the applications of Clifford algebras to quantum mechanics, we introduce—in terms of the ordinary tensorial language—a new definition for the field of a generic quantity. By translating from Clifford into tensor algebra, we also propose a new (nonrelativistic) velocity operator for a spin- ${\frac{1}{2}}$ particle. This operator appears as the sum of the ordinary part p/m describing the mean motion (the motion of the center-of-mass), and (...) of a second part associated with the so-called Zitterbewegung, which is the spin “internal” motion observed in the center-of-mass frame (CMF). This spin component of the velocity operator is nonzero not only in the Pauli theoretical framework, i.e., in the presence of external electromagnetic fields with a nonconstant spin function, but also in the Schrödinger case, when the wavefunction is a spin eigenstate. Thus, one gets even in the latter case a decomposition of the velocity field for the Madelung fluid into two distinct parts, which constitutes the nonrelativistic analogue of the Gordon decomposition for the Dirac current. Explicit calculations are presented for the velocity field in the particular cases of the hydrogen atom, of a spherical well potential, and of an electron in a uniform magnetic field. We find, furthermore, that the Zitterbewegung motion involves a velocity field which is solenoidal, and that the local angular velocity is parallel to the spin vector. In the presence of a nonuniform spin vector (Pauli case) we have, besides the component of the local velocity normal to the spin (present even in the Schrödinger theory), also a component which is parallel to the curl of the spin vector. (shrink)

A quantum theory combining an irreversible time evolution semigroup with a time reversal operator is presented.

In this note we introduce and study algebras of type such that is a bounded distributive lattice and ⌝ is an operator that satisfies the condition ⌝ = a ⌝ b and ⌝ 0 = 1. We develop the topological duality between these algebras and Priestley spaces with a relation. In addition, we characterize the congruences and the subalgebras of such an algebra. As an application, we will determine the Priestley spaces of quasi-Stone algebras.

One of the major problems of intrusion detection concerns the large amount of alerts that intrusion detection systems (IDS) produce. Security operator who analyzes alerts and takes decisions, is often submerged by the high number of alerts to analyze. In this paper, we present a new alert correlation approach based on knowledge and preferences of security operators. This approach, which is complementary to existing ones, allows to rank-order produced alerts on the basis of a security operator knowledge about (...) the system, used IDS and his preferences about alerts that he wants to analyze or to ignore. Our approach is based on the development of a new non-classical logic for representing preferences, called FO-MQCL (First Order - Minimal Qualitative Choice Logic). Our logic extends a fragment of the first order logic by adding a new logical connective. The general idea is to present only alerts that fully fit security operator's preferences and knowledge. And if needed, less preferred alerts can also be presented. (shrink)

In the debate between relativism and contextualism about various expressions, the Operator Argument, initially proposed by Kaplan , has been taken to support relativism. However, one widespread reaction against the argument has taken the form of arguing against one assumption made by Kaplan: namely, that certain natural language expressions are best treated as sentential operators. Focusing on the only extant version of the Operator Argument proposed in connection to predicates of personal taste such as “tasty” and experiencer phrases (...) such as “for Anna” ), in this paper I investigate whetherthe reasons offered by Cappelen and Hawthorne against various assumptions of the argument failing in the case of modal, temporal, locationaland precisional expressions transfer to the case of experiencer phrases to undercut support for relativism about predicates of personal taste. My aim is to show that they don’t. Thus, I first show that their considerations against experiencer phrases such as “for Anna” being sentential operators are not decisive. Second, I show that even if granting that such experiencer phrases are not sentential operators, a suitably modified version of the Operator Argument can be defended from the objections they raise. (shrink)

It was shown in the previous work of the author that one can avoid the paradox of minimal logic { ϕ , ¬ ϕ } ¬ ψ defining the negation operator via reduction not a constant of absurdity, but to a unary operator of absurdity. In the present article we study in details what does it mean that negation in a logical system can be represented via an absurdity or contradiction operator. We distinguish different sorts of such (...) presentations. Finally, we consider the possibility to represent the negation via absurdity and contradiction operators in such well known systems of paraconsistent logic as D.Batens's logic CLuN and Sette's logic P 1. (shrink)

This paper is about two topics: 1. systems of explicit mathematics with universes and a non-constructive quantification operator $\mu$; 2. iterated fixed point theories with ordinals. We give a proof-theoretic treatment of both families of theories; in particular, ordinal theories are used to get upper bounds for explicit theories with finitely many universes.

Fara and Williamson (Mind, 2005) argue that counterpart theory is unable to account for modal claims that use an actuality operator. This paper argues otherwise. Rather than provide a different counterpart translation of the actuality operator itself, the solution presented here starts out with a quantified modal logic in which the actuality operator is redundant, and then translates the sentences of this logic into claims of counterpart theory.

A common reducible representation space of the Lie algebras su and su is equipped with two different types of scalar products. The representation bases are labeled by the azimuthal and magnetic quantum numbers. The generators of su are the x-, y- and z-components of the orbital angular momentum operator. The representation of each of these Lie algebras is unitary with respect to only one of the scalar products. To each positive magnetic quantum number a family of the su-Barut–Girardello coherent (...) states is associated. The normalization and resolution of the identity condition for the coherent states are realized in two different approaches, i.e. the unitary and the non-unitary approaches. For the coherent states of the non-unitary case we calculate the uncertainty relation for the Hermitian x- and y-components of the angular momentum operator. While the unitary case leads to the known uncertainty relation for the Hermitian x- and y-components of su Lie algebra. (shrink)

In the many worlds community there seems to exist a belief that the physics of quantum theory is completely defined by it’s Hamilton operator given in an abstract Hilbert space, especially that the position basis may be derived from it as preferred using decoherence techniques.We show, by an explicit example of non-uniqueness, taken from the theory of the KdV equation, that the Hamilton operator alone is not sufficient to fix the physics. We need the canonical operators $\hat{p}$ , (...) $\hat{q}$ as well. As a consequence, it is not possible to derive a “preferred basis” from the Hamilton operator alone, without postulating some additional structure like a “decomposition into systems”. We argue that this makes such a derivation useless for fundamental physics. (shrink)

We show the existence of a high d. c. e. degree d and a low2 c.e. degree a such that d is isolated by a.

This book studies the foundations of quantum theory through its relationship to classical physics. This idea goes back to the Copenhagen Interpretation (in the original version due to Bohr and Heisenberg), which the author relates to the mathematical formalism of operator algebras originally created by von Neumann. The book therefore includes comprehensive appendices on functional analysis and C*-algebras, as well as a briefer one on logic, category theory, and topos theory. Matters of foundational as well as mathematical interest that (...) are covered in detail include symmetry (and its "spontaneous" breaking), the measurement problem, the Kochen-Specker, Free Will, and Bell Theorems, the Kadison-Singer conjecture, quantization, indistinguishable particles, the quantum theory of large systems, and quantum logic, the latter in connection with the topos approach to quantum theory. This book is Open Access under a CC BY licence. (shrink)

Various notions of independence of observables have been proposed within the algebraic framework of quantum field theory. We discuss relationships between these and the recently introduced notion of logical independence in a general operator-algebraic context. We show that C*-independence implies an analogue of classical independence.

This paper is mainly concerned with proof-theoretic analysis of some second-order systems of explicit mathematics with a non-constructive minimum operator. By introducing axioms for variable types we extend our first-order theory BON to the elementary explicit type theory EET and add several forms of induction as well as axioms for μ. The principal results then state: EET plus set induction is proof-theoretically equivalent to Peano arithmetic PA <0).

Cantor's abstractionist account of cardinal numbers has been criticized by Frege as a psychological theory of numbers which leads to contradiction. The aim of the paper is to meet these objections by proposing a reassessment of Cantor's proposal based upon the set theoretic framework of Bourbaki - called BK - which is a First-order set theory extended with Hilbert's ε-operator. Moreover, it is argued that the BK system and the ε-operator provide a faithful reconstruction of Cantor's insights on (...) cardinal numbers. I will introduce first the axiomatic setting of BK and the definition of cardinal numbers by means of the ε-operator. Then, after presenting Cantor's abstractionist theory, I will point out two assumptions concerning the definition of cardinal numbers that are deeply rooted in Cantor’s work. I will claim that these assumptions are supported as well by the BK definition of cardinal numbers, which will be compared to those of Zermelo-von Neumann and Frege-Russell. On the basis of these similarities, I will make use of the BK framework in meeting Frege's objections to Cantor's proposal. A key ingredient in the defence of Cantorian abstraction will be played by the role of representative sets, which are arbitrarily denoted by the ε-operator in the BK definition of cardinal numbers. (shrink)