We introduce reflection properties of cardinals in which the attributes that reflect are expressible by infinitary formulas whose lengths can be strictly larger than the cardinal under consideration. This kind of generalized reflection principle leads to the definitions of [Formula: see text]-indescribability and [Formula: see text]-indescribability of a cardinal [Formula: see text] for all [Formula: see text]. In this context, universal [Formula: see text] formulas exist, there is a normal ideal associated to [Formula: see text]-indescribability and the notions of [Formula: (...) see text]-indescribability yield a strict hierarchy below a subtle cardinal. Additionally, given a regular cardinal [Formula: see text], we introduce a diagonal version of Cantor’s derivative operator and use it to extend Bagaria’s [Derived topologies on ordinals and stationary reflection, Trans. Amer. Math. Soc. 371(3) (2019) 1981–2002] sequence [Formula: see text] of derived topologies on [Formula: see text] to [Formula: see text]. Finally, we prove that for all [Formula: see text], if there is a stationary set of [Formula: see text] that have a high enough degree of indescribability, then there are stationarily many [Formula: see text] that are nonisolated points in the space [Formula: see text]. (shrink)

By combining the methods of two former papers of ours we develop a finitary ordinal analysis of the axiom system KPi of Kripke-P atek set theory with an inaccessible universe. As a main result we obtain an upper bound for the provably recursive functions of KPi.

We show that if we interpret modal diamond as the derived set operator of a topological space, then the modal logic of Stone spaces isK4and the modal logic of weakly scattered Stone spaces isK4G. As a corollary, we obtain thatK4is also the modal logic of compact Hausdorff spaces andK4Gis the modal logic of weakly scattered compact Hausdorff spaces.

In the foundations of quantum mechanics Gleason’s theorem dictates the uniqueness of the state transition probability via the inner product of the corresponding state vectors in Hilbert space, independent of which measurement context induces this transition. We argue that the state transition probability should not be regarded as a secondary concept which can be derived from the structure on the set of states and properties, but instead should be regarded as a primitive concept for which measurement context is crucial. (...) Accordingly, we adopt an operational approach to quantum mechanics in which a physical entity is defined by the structure of its set of states, set of properties and the possible (measurement) contexts which can be applied to this entity. We put forward some elementary definitions to derive an operational theory from this State–COntext–Property (SCOP) formalism. We show that if the SCOP satisfies a Gleason-like condition, namely that the state transition probability is independent of which measurement context induces the change of state, then the lattice of properties is orthocomplemented, which is one of the ‘quantum axioms’ used in the Piron–Solèr representation theorem for quantum systems. In this sense we obtain a possible physical meaning for the orthocomplementation widely used in quantum structures. (shrink)

The analysis of dispositions is used to consider cases where the effect of one disposition operating is the existence of another disposition. This may arise from rearrangements within aggregated structures of dispositional parts, or, it is argued, also as stages of derivative dispositions within a set of multiple generative levels. Inspection of examples in both classical and quantum physics suggests a general principle of `Conditional Forward Causation': that dispositions act 'forwards' in a way conditional on certain circumstances or occasions already (...) existing at the `later' levels. (shrink)

Tense operators in effect algebras play a key role for the representation of the dynamics of formally described physical systems. For this, it is important to know how to construct them on a given effect algebra \( E\) and how to compute all possible pairs of tense operators on \( E\) . However, we firstly need to derive a time frame which enables these constructions and computations. Hence, we usually apply a suitable set of states of the effect algebra \( (...) E\) in question. To approximate physical reality in quantum mechanics, we use only the so-called Jauch–Piron states on \( E\) in our paper. To realize our constructions, we are restricted on lattice effect algebras only. (shrink)

We consider two topological interpretations of the modal diamond—as the closure operator (C-semantics) and as the derived set operator (d-semantics). We call the logics arising from these interpretations C-logics and d-logics, respectively. We axiomatize a number of subclasses of the class of nodec spaces with respect to both semantics, and characterize exactly which of these classes are modally definable. It is demonstrated that the d-semantics is more expressive than the C-semantics. In particular, we show that the d-logics (...) of the six classes of spaces considered in the paper are pairwise distinct, while the C-logics of some of them coincide. (shrink)

Ranking finite subsets of a given set X of elements is the formal object of analysis in this article. This problem has found a wide range of economic interpretations in the literature. The focus of the article is on the family of rankings that are additively representable. Existing characterizations are too complex and hard to grasp in decisional contexts. Furthermore, Fishburn (1996), Journal of Mathematical Psychology 40, 64–77 showed that the number of sufficient and necessary conditions that are needed to (...) characterize such a family has no upper bound as the cardinality of X increases. In turn, this article proposes a way to overcome these difficulties and allows for the characterization of a meaningful (sub)family of additively representable rankings of sets by means of a few simple axioms. Pattanaik and Xu’s (1990), Recherches Economiques de Louvain 56, 383–390) characterization of the cardinality-based rule will be derived from our main result, and other new rules that stem from our general proposal are discussed and characterized in even simpler terms. In particular, we analyze restricted-cardinality based rules, where the set of “focal” elements is not given ex-ante; but brought out by the axioms. (shrink)

The emergence of an autocatalytic network from an available set of elements is a fundamental step in early evolutionary processes, such as the origin of metabolism. Given the set of elements, the reactions between them (chemical or otherwise), and with various elements catalysing certain reactions, a Reflexively Autocatalytic F-generated (RAF) set is a subset R′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$'$$\end{document} of reactions that is self-generating from a given food set, and with each reaction in R′\documentclass[12pt]{minimal} \usepackage{amsmath} (...) \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$'$$\end{document} being catalysed from within R′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$'$$\end{document}. RAF theory has been applied to various phenomena in theoretical biology, and a key feature of the approach is that it is possible to efficiently identify and classify RAFs within large systems. This is possible because RAFs can be described as the (nonempty) subsets of the reactions that are the fixed points of an (efficiently computable) interior map that operates on subsets of reactions. Although the main generic results concerning RAFs can be derived using just this property, we show that for systems with at least 12 reactions there are generic results concerning RAFs that cannot be proven using the interior operator property alone. (shrink)

Stalnaker, 169–199 2006) introduced a combined epistemic-doxastic logic that can formally express a strong concept of belief, a concept of belief as ‘subjective certainty’. In this paper, we provide a topological semantics for belief, in particular, for Stalnaker’s notion of belief defined as ‘epistemic possibility of knowledge’, in terms of the closure of the interior operator on extremally disconnected spaces. This semantics extends the standard topological interpretation of knowledge with a new topological semantics for belief. We prove that the (...) belief logic KD45 is sound and complete with respect to the class of extremally disconnected spaces and we compare our approach to a different topological setting in which belief is interpreted in terms of the derived set operator. We also study belief revision as well as belief dynamics by providing a topological semantics for conditional belief and belief update modalities, respectively. Our setting based on extremally disconnected spaces, however, encounters problems when extended with dynamic updates. We then propose a solution consisting in interpreting belief in a similar way based on hereditarily extremally disconnected spaces, and axiomatize the belief logic of hereditarily extremally disconnected spaces. Finally, we provide a complete axiomatization of the logic of conditional belief and knowledge, as well as a complete axiomatization of the corresponding dynamic logic. (shrink)

The notion of fuzzy event is introduced in the theory of measurement in quantum mechanics by indicating in which sense measurements can be considered to yield fuzzy sets. The concept of probability measure on fuzzy events is defined, and its general properties are deduced from the operational meaning assigned to it. It is pointed out that such probabilities can be derived from the formalism of quantum mechanics. Any such probability on a given fuzzy set is related to the frequency (...) of occurrence within that set of points in a random sample, where the sample points are themselves fuzzy sets obtained as outcomes of measurements of, in general, incompatible observables on replicas of the system in the same prepared state. (shrink)

The modal interpretation of quantum mechanics allows one to keep the standard classical definition of realism intact. That is, variables have a definite status for all time and a measurement only tells us which value it had. However, at present modal dynamics are only applicable to situations that are described in the orthodox theory by projective measures. In this paper we extend modal dynamics to include positive operator measures. That is, for example, rather than using a complete set of (...) orthogonal projectors, we can use an overcomplete set of nonorthogonal projectors. We derive the conditions under which Bell's stochastic modal dynamics for projective measures reduce to deterministic dynamics, showing that Brown and Hiley's generalization of Bohmian mechanics [quant-ph/0005026, ] cannot be thus derived. We then show how deterministic dynamics for positive operators can also be derived. As a simple case, we consider a Harmonic oscillator, and the overcomplete set of coherent state projectors. We show that the modal dynamics for this POM in the classical limit correspond to the classical dynamics, even for the nonclassical number state |n>. This is in contrast to the Bohmian dynamics, which for energy eigenstates, the dynamics are always non-classical. (shrink)

We consider the first-order finite-difference expression of the commutator between d / dx and x. This is the appropriate setting in which to propose commutators and time operators for a quantum system with an arbitrary potential function and a discrete energy spectrum. The resulting commutators are identified as universal lowering and raising operators. We also find time operators which are finite-difference derivations with respect to the energy. The matrix elements of the commutator in the energy representation are analyzed, and we (...) find consistency with the equality \. We apply the theory to the particle in an infinite well and for the Harmonic oscillator as examples. (shrink)

For each natural number n we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than n and no strictly ascending chains. The case n=0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=0$$\end{document} is the Gödel-Löb provability logic. Each logic is axiomatised by adding a single axiom to K4, and is shown to have the finite model property and be decidable. We then consider a number of extensions (...) of these logics, including restricting to reflexive frames to obtain a corresponding sequence of extensions of S4. When n=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=1$$\end{document}, this gives the famous logic of Grzegorczyk, known as S4Grz, which is the strongest modal companion to intuitionistic propositional logic. A topological semantic analysis shows that the n-th member of the sequence of extensions of S4 is the logic of hereditarily n+1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n+1$$\end{document}-irresolvable spaces when the modality ◊\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Diamond $$\end{document} is interpreted as the topological closure operation. We also study the definability of this class of spaces under the interpretation of ◊\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Diamond $$\end{document} as the derived set operation. The variety of modal algebras validating the n-th logic is shown to be generated by the powerset algebras of the finite frames with cycle length bounded by n. Moreover each algebra in the variety is a model of the universal theory of the finite ones, and so is embeddable into an ultraproduct of them. (shrink)

Many efforts are focused on transformation to wellbeing economies as economies oriented towards equity, social justice, and human wellbeing in a flourishing natural environment (wellbeing economics). Drawing from analysis of innovations associated with these efforts, we emerge a framework of wellbeing-oriented ‘economic operating infrastructure’ (EOI). This is presented as a typology of six core types of economic transformation innovations nested from innovations with the broadest reach (narratives) to the most specific (products and services). Development of the typology was guided by (...) a set of wellbeing economies values that help in identifying which innovations to include. The innovations were identified by research on the internet, technical reports, and published articles. The typology elements are: innovations in economic narratives; governance; financing mechanisms; exchange mechanisms; business structures; and the products and services derived from them. Examples are presented in each category to illustrate how this infrastructure is emerging in alignment with establishing wellbeing economies. This exploratory and descriptive typology provides a preliminary framework for developing a strategic approach to economic transformation through wellbeing economic infrastructure development. Four EOI-based activities are identified to accelerate this transformation. (shrink)

In the paper we explore the idea of describing Pawlak’s rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f — to the negative region, and the undefined value u — to the border of the set. Due to the properties of the above regions in rough set theory, the semantics of the logic is described using a non-deterministic matrix (Nmatrix). With the strong semantics, where only the value t is (...) treated as designated, the above logic is a “common denominator” for Kleene and Łukasiewicz 3-valued logics, which represent its two different “determinizations”. In turn, the weak semantics—where both t and u are treated as designated—represents such a “common denominator” for two major 3-valued paraconsistent logics. We give sound and complete, cut-free sequent calculi for both versions of the logic generated by the rough set Nmatrix. Then we derive from these calculi sequent calculi with the same properties for the various “determinizations” of those two versions of the logic (including Łukasiewicz 3-valued logic). Finally, we show how to embed the four above-mentioned determinizations in extensions of the basic rough set logics obtained by adding to those logics a special two-valued “definedness” or “crispness” operator. (shrink)

We present an approach to database update as a form of non monotonic temporal reasoning, the main idea of which is the (circumscriptive) minimization of changes with respect to a set of facts declared persistent by default. The focus of the paper is on the relation between this approach and the update semantics recently proposed by Katsuno and Mendelzon. Our contribution in this regard is twofold: • We prove a representation theorem for KM semantics in terms of a restricted subfamily (...) of the operators defined by our construction. • We show how the KM semantics can be generalized by relaxing our construction in a number of ways, each justified in certain intuitive circumstances and each corresponding to one specific postulate. It follows that there are reasonable update operators outside the KM family. • Our approach is not dependent for its plausibility on this connection with KM semantics. Rather, it provides a relatively rich and flexible framework in which the frame and ramification problems can be solved in a systematic way by reasoning about default persistence of facts. (shrink)

We present an approach to database update as a form of non monotonic temporal reasoning, the main idea of which is the (circumscriptive) minimization of changes with respect to a set of facts declared “persistent by default”. The focus of the paper is on the relation between this approach and the update semantics recently proposed by Katsuno and Mendelzon. Our contribution in this regard is twofold:We prove a representation theorem for KM semantics in terms of a restricted subfamily of the (...) operators defined by our construction.We show how the KM semantics can be generalized by relaxing our construction in a number of ways, each justified in certain intuitive circumstances and each corresponding to one specific postulate. It follows that there are reasonable update operators outside the KM family.Our approach is not dependent for its plausibility on this connection with KM semantics. Rather, it provides a relatively rich and flexible framework in which the frame and ramification problems can be solved in a systematic way by reasoning about default persistence of facts. (shrink)

We prove a Gleason-type theorem for the quantum probability rule using frame functions defined on positive-operator-valued measures, as opposed to the restricted class of orthogonal projection-valued measures used in the original theorem. The advantage of this method is that it works for two-dimensional quantum systems and even for vector spaces over rational fields—settings where the standard theorem fails. Furthermore, unlike the method necessary for proving the original result, the present one is rather elementary. In the case of a qubit, (...) we investigate similar results for frame functions defined upon various restricted classes of POVMs. For the so-called trine measurements, the standard quantum probability rule is again recovered. (shrink)

This article suggests that Facebook embodies a new logic of capitalist governance, what has been termed the ‘social logic of the derivative’. The logic of the derivative is rooted in the now dominant financial level of the capitalist economy, and is mediated by social media and the algorithmic processing of large digital data sets. This article makes three precise claims: First, that the modus operandi of Facebook mirrors the operations of derivative financial instruments. Second, that the algorithms that Facebook uses (...) share a genealogy with those of derivative financial instruments – both are outcomes of the influence of the ‘cyber sciences’ on managerial practice in the post-war years. Third, that the future potential of Facebook lies in its ability to apply the logic of derivatives to the financial valuation of ordinary social relations, thus further extending the process of financialization of everyday life. (shrink)

Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...) foundations of mathematics and in relation to philosophical motivations leading to the development of intuitionistic logic. This sets the stage for a brief description of the relevant part of Dummett’s program to recast debates in metaphysics, and in particular disputes about realism and anti-realism, as closely intertwined with issues in philosophical logic, with the acceptance of classical logic for a domain reflecting a commitment to realism for that domain. Then I review extant results about what is provable and what is not when one adds epsilon to intuitionistic logic, largely due to Bell and DeVidi, and I give several new proofs of intermediate logics from intuitionistic logic+ε without identity. With all this in hand, I turn to a discussion of the philosophical significance of choice operators. Among the conclusions I defend are that these results provide a finer-grained basis for Dummett’s contention that commitment to classically valid but intuitionistically invalid principles reflect metaphysical commitments by showing those principles to be derivable from certain existence assumptions; that Dummett’s framework is improved by these results as they show that questions of realism and anti-realism are not an “all or nothing” matter, but that there are plausibly metaphysical stances between the poles of anti-realism and realism, because different sorts of ontological assumptions yield intermediate rather than classical logic; and that these intermediate positions between classical and intuitionistic logic link up in interesting ways with our intuitions about issues of objectivity and reality, and do so usefully by linking to questions around intriguing everyday concepts such as “is smart,” which I suggest involve a number of distinct dimensions which might themselves be objective, but because of their multivalent structure are themselves intermediate between being objective and not. Finally, I discuss the implications of these results for ongoing debates about the status of arbitrary and ideal objects in the foundations of logic, showing among other things that much of the discussion is flawed because it does not recognize the degree to which the claims being made depend on the presumption that one is working with a very strong logic. (shrink)

Natural Formalization proposes a concrete way of expanding proof theory from the meta-mathematical investigation of formal theories to an examination of “the concept of the specifically mathematical proof.” Formal proofs play a role for this examination in as much as they reflect the essential structure and systematic construction of mathematical proofs. We emphasize three crucial features of our formal inference mechanism: (1) the underlying logical calculus is built for reasoning with gaps and for providing strategic directions, (2) the mathematical frame (...) is a definitional extension of Zermelo–Fraenkel set theory and has a hierarchically organized structure of concepts and operations, and (3) the construction of formal proofs is deeply connected to the frame through rules for definitions and lemmas. To bring these general ideas to life, we examine, as a case study, proofs of the Cantor–Bernstein Theorem that do not appeal to the principle of choice. A thorough analysis of the multitude of “different” informal proofs seems to reduce them to exactly one. The natural formalization confirms that there is one proof, but that it comes in two variants due to Dedekind and Zermelo, respectively. In this way it enhances the conceptual understanding of the represented informal proofs. The formal, computational work is carried out with the proof search system AProS that serves as a proof assistant and implements the above inference mechanism; it can be fully inspected at (see link below). (shrink)

A topological space is hereditarilyk-irresolvable if none of its subspaces can be partitioned into k dense subsets. We use this notion to provide a topological semantics for a sequence of modal logics whose n-th member K4Cn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {C}_n$$\end{document} is characterised by validity in transitive Kripke frames of circumference at most n. We show that under the interpretation of the modality ◊\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Diamond $$\end{document} as the (...) derived set operation, K4Cn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {C}_n$$\end{document} is characterised by validity in all spaces that are hereditarily n+1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n+1$$\end{document}-irresolvable and have the TD\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$_D$$\end{document} separation property. We also identify the extensions of K4Cn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {C}_n$$\end{document} that result when the class of spaces involved is restricted to those that are crowded, or densely discrete, or openly irresolvable, the latter meaning that every non-empty open subspace is 2-irresolvable. Finally, we give a topological semantics for K4M, where M is the McKinsey axiom. (shrink)

In this paper we develop an abstract theory of adequacy. In the same way as the theory of consequence operations is a general theory of logic, this theory of adequacy is a general theory of the interactions and connections between consequence operations and its sound and complete semantics. Addition of axioms for the connectives of propositional logic to the basic axioms of consequence operations yields a unifying framework for different systems of classical propositional logic. We present an abstract model-theoretical semantics (...) based on model mappings and theory mappings. Between the classes of models and theories, i.e., the set of sentences verified by a model, it obtains a connection that is well-known within algebra as Galois correspondence. Many basic semantical properties can be derived from this observation. A sentence A is a semantical consequence of T if every model of T is also a model of A. A model mapping is adequate for a consequence operation if its semantical inference operation is identical with the consequence operation. We study how properties of an adequate model mapping reflect the properties of the consequence operation and vice versa. In particular, we show how every concept of the theory of consequence operations can be formulated semantically. (shrink)

BACKGROUND: There is a growing interest in aggregating more biomedical and patient data into large health data sets for research and public benefits. However, collecting and processing patient data raises new ethical issues regarding patient's rights, social justice and trust in public institutions. The aim of this empirical study is to gain an in-depth understanding of the awareness of possible ethical risks and corresponding obligations among those who are involved in projects using patient data, i.e. healthcare professionals, regulators and policy (...) makers. METHODS: We used a qualitative design to examine Swiss healthcare stakeholders' experiences and perceptions of ethical challenges with regard to patient data in real-life settings where clinical registries are sponsored, created and/or used. A semi-structured interview was carried out with 22 participants (11 physicians, 7 policy-makers, 4 ethical committee members) between July 2014 and January 2015. The interviews were audio-recorded, transcribed, coded and analysed using a thematic method derived from Grounded Theory. RESULTS: All interviewees were concerned as a matter of priority with the needs of legal and operating norms for the collection and use of data, whereas less interest was shown in issues regarding patient agency, the need for reciprocity, and shared governance in the management and use of clinical registries' patient data. This observed asymmetry highlights a possible tension between public and research interests on the one hand, and the recognition of patients' rights and citizens' involvement on the other. CONCLUSIONS: The advocation of further health-related data sharing on the grounds of research and public interest, without due regard for the perspective of patients and donors, could run the risk of fostering distrust towards healthcare data collections. Ultimately, this could diminish the expected social benefits. However, rather than setting patient rights against public interest, new ethical approaches could strengthen both concurrently. On a normative level, this study thus provides material from which to develop further ethical reflection towards a more cooperative approach involving patients and citizens in the governance of their health-related big data. (shrink)

Let N, O and S denote the set of nonnegative integers, the graph of the constant 0 function and the graph of the successor function respectively. For sets $P, Q, R \subseteq N^2$ operations of transposition, composition, and bracketing are defined as follows: $P^\cup = \{\langle x, y\rangle | \langle y, x\rangle \epsilon P\}, PQ = \{\langle x, z\rangle| \exists y\langle x, y\rangle \epsilon P & \langle y, z\rangle \epsilon Q\}$ , and [ P, Q, R] = ∪n ε M(PnQR (...) n). THEOREM. The class of recursively enumerable subsets of N2 is the smallest class of sets with O and S as members and closed under transposition, composition, and bracketing. This result is derived from a characterization by Julia Robinson of the class of general recursive functions of one variable in terms of function composition and "definition by general recursion." A key step in the proof is to show that if a function F is defined by general recursion from functions A, M, P and R then F = [ P∪, A∪ M, R]. The above definitions of the transposition, composition, and bracketing operations on subsets of N2 can be generalized to subsets of X2 for an arbitrary set X. In this abstract setting it is possible to show that the bracket operation can be defined in terms of K, L, transposition, composition, intersection, and reflexive transitive closure where K: X → X and L: X → X are functions for decoding pairs. (shrink)

There is a growing interest in aggregating more biomedical and patient data into large health data sets for research and public benefits. However, collecting and processing patient data raises new ethical issues regarding patient’s rights, social justice and trust in public institutions. The aim of this empirical study is to gain an in-depth understanding of the awareness of possible ethical risks and corresponding obligations among those who are involved in projects using patient data, i.e. healthcare professionals, regulators and policy makers. (...) We used a qualitative design to examine Swiss healthcare stakeholders’ experiences and perceptions of ethical challenges with regard to patient data in real-life settings where clinical registries are sponsored, created and/or used. A semi-structured interview was carried out with 22 participants between July 2014 and January 2015. The interviews were audio-recorded, transcribed, coded and analysed using a thematic method derived from Grounded Theory. All interviewees were concerned as a matter of priority with the needs of legal and operating norms for the collection and use of data, whereas less interest was shown in issues regarding patient agency, the need for reciprocity, and shared governance in the management and use of clinical registries’ patient data. This observed asymmetry highlights a possible tension between public and research interests on the one hand, and the recognition of patients’ rights and citizens’ involvement on the other. The advocation of further health-related data sharing on the grounds of research and public interest, without due regard for the perspective of patients and donors, could run the risk of fostering distrust towards healthcare data collections. Ultimately, this could diminish the expected social benefits. However, rather than setting patient rights against public interest, new ethical approaches could strengthen both concurrently. On a normative level, this study thus provides material from which to develop further ethical reflection towards a more cooperative approach involving patients and citizens in the governance of their health-related big data. (shrink)

We prove that each countable rooted K4 -frame is a d-morphic image of a subspace of the space $\mathbb{Q}$ of rational numbers. From this we derive that each modal logic over K4 axiomatizable by variable-free formulas is the d-logic of a subspace of $\mathbb{Q}$ . It follows that subspaces of $\mathbb{Q}$ give rise to continuum many d-logics over K4 , continuum many of which are neither finitely axiomatizable nor decidable. In addition, we exhibit several families of modal logics finitely axiomatizable (...) by variable-free formulas over K4 that d-define interesting classes of topological spaces. Each of these logics has the finite model property and is decidable. Finally, we introduce quasi-scattered and semi-scattered spaces as generalizations of scattered spaces, develop their basic properties, axiomatize their corresponding modal logics, and show that they also arise as the d-logics of some subspaces of $\mathbb{Q}$. (shrink)

In this transdisciplinary article which stems from philosophical considerations (that depart from phenomenology—after Merleau-Ponty, Heidegger and Rosen—and Hegelian dialectics), we develop a conception based on topological (the Moebius surface and the Klein bottle) and geometrical considerations (based on torsion and non-orientability of manifolds), and multivalued logics which we develop into a unified world conception that surmounts the Cartesian cut and Aristotelian logic. The role of torsion appears in a self-referential construction of space and time, which will be further related to (...) the commutator of the True and False operators of matrix logic, still with a quantum superposed state related to a Moebius surface, and as the physical field at the basis of Spencer-Brown’s primitive distinction in the protologic of the calculus of distinction. In this setting, paradox, self-reference, depth, time and space, higher-order non-dual logic, perception, spin and a time operator, the Klein bottle, hypernumbers due to Musès which include non-trivial square roots of ±1 and in particular non-trivial nilpotents, quantum field operators, the transformation of cognition to spin for two-state quantum systems, are found to be keenly interwoven in a world conception compatible with the philosophical approach taken for basis of this article. The Klein bottle is found not only to be the topological in-formation for self-reference and paradox whose logical counterpart in the calculus of indications are the paradoxical imaginary time waves, but also a classical-quantum transformer (Hadamard’s gate in quantum computation) which is indispensable to be able to obtain a complete multivalued logical system, and still to generate the matrix extension of classical connective Boolean logic. We further find that the multivalued logic that stems from considering the paradoxical equation in the calculus of distinctions, and in particular, the imaginary solutions to this equation, generates the matrix logic which supersedes the classical logic of connectives and which has for particular subtheories fuzzy and quantum logics. Thus, from a primitive distinction in the vacuum plane and the axioms of the calculus of distinction, we can derive by incorporating paradox, the world conception succinctly described above. (shrink)

Les arguments de Maddy avancés en 1990 contre la théorie des agrégats se trouvent affaiblis par le retournement qu’elle opère en 1997. La présente communication examine cette théorie à la lumière de ce retournement ainsi que des récentes recherches sur les “Nouveaux axiomes pour les mathématiques”. Si la théorie des ensembles est la théorie de la partie–tout des singletons, identifier les singletons à leurs membres singuliers ramène la théorie des ensembles à la théorie des agrégats. Toutefois si les singletons ne (...) sont pas identiques à leurs membres singuliers, ce ne sont donc pas des objets extensionnels et ils ne peuvent former une base pour la Science. Dans tous les cas, l’hypothèse d’un continuum n’a aucun intérêt sur le plan physique. Je montre d’abord que, parce qu’il y a des prédicats non-sortaux, la tentative de Frege de faire dériver l’arithmétique de la logique bute dès ses premiers pas. Car il y a des propriétés sans nombre et la contingence de cette condition signifie que la définition du zéro donnée par Frege ne peut s’obtenir à partir de la logique. Ce résultat révèle le besoin de considérer davantage les propriétés sans nombre et donc de générer une théorie des continuums en se basant sur les agrégats méréologiques plutôt que sur des ensembles contenant des nombres de choses. (shrink)

Full proofs of the Gödel incompleteness theorems are highly intricate affairs. Much of the intricacy lies in the details of setting up and checking the properties of a coding system representing the syntax of an object language (typically, that of arithmetic) within that same language. These details are seldom illuminating and tend to obscure the core of the argument. For this reason a number of efforts have been made to present the essentials of the proofs of Gödel’s theorems without getting (...) mired in syntactic or computational details. One of the most important of these efforts was made by Löb [8] in connection with his analysis of sentences asserting their own provability. Löb formulated three conditions (now known as the Hilbert-Bernays-Löb derivability conditions), on the provability predicate in a formal system which are jointly sufficient to yield the Gödel’s second incompleteness theorem for it. A key role in Löb’s analysis is played by (a special case of) what later became known as the diagonalization or fixed point property of formal systems, a property which had already, in essence, been exploited by Gödel in his original proofs of the incompleteness theorems. The fixed point property plays a central role in Lawvere’s [7] category-theoretic account of incompleteness phenomena (see also [10]). Incompleteness theorems have also been subjected to intensive investigation within the framework of modal logic (see, e.g.[4], [5]). In this formulation the modal operator takes up the role previously played by the provability predicate, and the derivability conditions on the latter are translated into algebraic conditions (the so-called GL, i.e., Gödel–Löb, conditions) on the former. My purpose here is to present a framework for incompleteness phenomena, fully compatible with intuitionistic or constructive principles, in which the idea of a coding system is retained, only in a 2 simple, but very general form, a form wholly free of syntactical notions. As codes we shall take the elements of an arbitrary given nonempty set, possibly, but not necessarily, the set of natural numbers.. (shrink)

The exact correspondence between ordinal notations derived from Skolem hull operators, which are classical in ordinal analysis, and descriptions of ordinals in terms of Σ1-elementarity, an approach developed by T.J. Carlson, is analyzed in full detail. The ordinal arithmetical tools needed for this purpose were developed in [G. Wilken, Ordinal arithmetic based on Skolem hulling, Annals of Pure and Applied Logic 145 130–161]. We show that the least ordinal κ such that κ<1∞ 19–77] and described below) is the proof (...) theoretic ordinal of the set-theoretic system , confirming a claim of Carlson. Moreover, we characterize the class of all ordinals κ such that κ<1∞ and provide an ordinal arithmetical analysis of Carlson’s entire structure in the style of [T.J. Carlson, Ordinal arithmetic and Σ1-elementarity, Archive for Mathematical Logic 38 449–460]. (shrink)

Part I of the present work outlined the rigorous application of information theory to a quantum mechanical system in a thermodynamic equilibrium state. The general formula developed there for the best-guess density operator $\hat \rho$ was indeterminate because it involved in an essential way an unspecified prior probability distribution over the continuumD H of strong equilibrium density operators. In Part II mathematical evaluation of $\hat \rho$ is completed after an epistemological analysis which leads first to the discretization ofD H (...) and then to the adoption of a suitable indifference axiom to delimit the set of admissible prior distributions. Finally, quantal formulas for information-theoretic and thermodynamic entropies are contrasted, and the entire work is summarized. (shrink)

Hopfield neural network is considered as an artificial model derived from the brain structures and it is an important model that admits an adequate performance in neurocomputing. In this article, we solve a dynamical model of 3D HNNs via Atangana–Baleanu fractional derivatives. To find the numerical solution of the considered dynamical model, the well-known Predictor-Corrector method is used. A number of cases are taken by using two different sets of values of the activation gradient of the neurons as well (...) as six different initial conditions. The given results have been perfectly established using the different fractional-order values on the given derivative operator. The objective of this research is to investigate the dynamics of the proposed HNN model at various values of fractional orders. Nonlocal characteristic of the AB derivative contains the memory in the system which is the main motivation behind the proposal of this research. (shrink)

Les arguments de Maddy avancés en 1990 contre la théorie des agrégats se trouvent affaiblis par le retournement qu’elle opère en 1997. La présente communication examine cette théorie à la lumière de ce retournement ainsi que des récentes recherches sur les “Nouveaux axiomes pour les mathématiques”. Si la théorie des ensembles est la théorie de la partie–tout des singletons, identifier les singletons à leurs membres singuliers ramène la théorie des ensembles à la théorie des agrégats. Toutefois si les singletons ne (...) sont pas identiques à leurs membres singuliers, ce ne sont donc pas des objets extensionnels et ils ne peuvent former une base pour la Science. Dans tous les cas, l’hypothèse d’un continuum n’a aucun intérêt sur le plan physique. Je montre d’abord que, parce qu’il y a des prédicats non-sortaux, la tentative de Frege de faire dériver l’arithmétique de la logique bute dès ses premiers pas. Car il y a des propriétés sans nombre et la contingence de cette condition signifie que la définition du zéro donnée par Frege ne peut s’obtenir à partir de la logique. Ce résultat révèle le besoin de considérer davantage les propriétés sans nombre et donc de générer une théorie des continuums en se basant sur les agrégats méréologiques plutôt que sur des ensembles contenant des nombres de choses. (shrink)

Continuous environmental concerns regarding construction industry have been driving general constructors of mega infrastructure projects to incorporate green contractors. Although conventional multiple attributes decision-making methodologies have provided feasible ways to select contractor, high complexity in scenarios of megaprojects still challenges existing MADM methods in concurrently accommodating three key issues of decision hesitancy, attributes interdependency, and group attitudinal character. To elicit decision-makers’ hesitant fuzzy assessments more objectively and comprehensively, we define an expression tool called interval-valued dual hesitant fuzzy uncertain unbalanced linguistic (...) set and develop aggregation operators through its operations. To exploit attributes interdependency, we establish a synthesized attributes’ weighting model to fuse an attributes interdependency-based weighting vector and an argument-dependent weighting vector, which are, respectively, derived through Decision-Making and Trial Evaluation Laboratory technique and maximizing deviation method. To effectively utilize decision-makers’ group attitudinal characters, we also develop a TOPSIS-based method to rationally transform group ideal attitudes into order-inducing vectors. On the strength of the above methods, an integrated MADM approach is then constructed. Finally, illustrative case study and experiments are conducted to validate our approach. (shrink)

Trapezoidal interval type-2 fuzzy sets are a special kind of type-2 fuzzy sets. TIT2FSs are useful in dealing with fuzziness inherent in decision data and the decision-making process. For multi-attribute group decision-making problems in which the attribute values and attribute weights are TIT2FSs, a new decision-making approach is proposed. On the basis of the concept of barycenters, a new approach to ranking TIT2FSs is given. Four kinds of geometric aggregation operators for TIT2FSs are developed, including the TIT2FS weighted geometric average (...) operator, TIT2FS ordered weighted geometric average operator, TIT2FS hybrid weighted geometric average operator, and extended TIT2FS hybrid weighted geometric average operator. The individual comprehensive values of alternatives are derived through the extended TIT2FS weighted geometric average operators. Using the TIT2FS hybrid weighted geometric average operator and the expert weights, the individual comprehensive values of alternatives are integrated into the collective ones, which are used to rank the alternatives. The practicability and effectiveness of the developed method are illustrated with a teaching quality assessment example. (shrink)

People differ in their personal commitment to fighting climate change and protecting the environment. The question is, can we validly measure people’s commitment by what they say and what they claim they do in opinion polls? In our research, we demonstrate that opinions and reports of past behavior can be aggregated into comparable depictions of people’s personal commitment to fighting climate change and protecting the environment. In contrast to the commonly used operational scaling approaches, we ground our measure of people’s (...) environmental attitudes in a mathematically formalized psychological theory of the response process—the Campbell paradigm. This theory of the response process has already been extensively validated, and its relevance for manifest behavior has repeatedly been shown as well. In our secondary analysis of Eurobarometer data from 28 European countries, we apply the Campbell paradigm to a set of indicators that was not originally collected to be aggregated into a single scale. With our research, we propose a distinct way to measure behavior-relevant environmental attitudes that can be used even with a set of indicators that was originally atheoretically compiled. Overall, our study suggests that the Campbell paradigm provides a sound psychological measurement theory that can be applied to cross-cultural comparisons in the environmental protection domain. (shrink)

We show that subspaces of the space ${\mathbb{Q}}$ of rational numbers give rise to uncountably many d-logics over K4 without the finite model property.

Statements in mathematics -- Proofs in mathematics -- Basic set operations -- Functions -- Relations on a set -- Cardinality -- Algebra of number systems -- The natural numbers -- The integers -- The rational numbers -- The real numbers -- Cantor's reals -- The complex numbers -- Time scales -- The delta derivative -- Hints for (and comments on) the exercises.

Several tasks in artificial intelligence require the ability to find models about knowledge dynamics. They include belief revision, fusion and belief merging, and abduction. In this paper, we exploit the algebraic framework of mathematical morphology in the context of propositional logic and define operations such as dilation or erosion of a set of formulas. We derive concrete operators, based on a semantic approach, that have an intuitive interpretation and that are formally well behaved, to perform revision, fusion and abduction. Computation (...) and tractability are addressed, and simple examples illustrate the main results. (shrink)

This paper outlines a conceptual framework for a sufficiency economy, defining sufficiency as the space between a generalizable notion of human wellbeing and ungeneralisable excess. It assumes an objective and universal concept of human needs to define a ‘floor’ and the concept of planetary boundaries to define a ‘ceiling’. This is set up as an alternative to the dominant preference satisfaction theory of value. It begins with a brief survey of the potential contributions of sufficientarianism and limitarianism to this endeavor (...) before outlining a theory of objective, universal human need. This recognizes the contextual variable nature of need satisfiers and the distinct methodology required to adjudicate necessities. It then turns to the planetary boundaries literature and utilizes a sequence of causal and normative reasoning to derive an operational ceiling and the concept of ungeneralisable luxuries. The final section addresses how the concepts of floors and ceilings might be operationalized via forms of dialogic democracy but noting the absence of any such institutions at the global level. Its policy conclusion is that a safe climate cannot be achieved through supply-side mitigation alone, and that fair demand-side mitigation necessarily requires a clear distinction between necessities and unnecessary luxuries, between which (hopefully) lies a space of sufficiency. (shrink)

The powerset operator, [MATHEMATICAL SCRIPT CAPITAL P], is compared with other operators of similar type and logical complexity. Namely we examine positive operators whose defining formula has a canonical form containing at most a string of universal quantifiers. We call them ∀-operators. The question we address in this paper is: How is the class of ∀-operators generated ? It is shown that every positive ∀-operator Γ such that Γ ≠ ∅, is finitely generated from [MATHEMATICAL SCRIPT CAPITAL P], (...) the identity operator Id, constant operators and certain trivial ones by composition, ∪ and ∩. This extends results of [3] concerning bounded positive operators. (shrink)

Using set theory in the first part of his book, and proof theory in the second, Gaisi Takeuti gives us two examples of how mathematical logic can be used to obtain results previously derived in less elegant fashion by other mathematical techniques, especially analysis. In Part One, he applies Scott- Solovay's Boolean-valued models of set theory to analysis by means of complete Boolean algebras of projections. In Part Two, he develops classical analysis including complex analysis in Peano's arithmetic, showing (...) that any arithmetical theorem proved in analytic number theory is a theorem in Peano's arithmetic. In doing so, the author applies Gentzen's cut elimination theorem. Although the results of Part One may be regarded as straightforward consequences of the spectral theorem in function analysis, the use of Boolean- valued models makes explicit and precise analogies used by analysts to lift results from ordinary analysis to operators on a Hilbert space. Essentially expository in nature, Part Two yields a general method for showing that analytic proofs of theorems in number theory can be replaced by elementary proofs. Originally published in 1978. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These paperback editions preserve the original texts of these important books while presenting them in durable paperback editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905. (shrink)

This article explores a phenomenon found in Berber whereby the extraction of dative arguments (of verbs, nouns and prepositions) gives rise to two occurrences of wh. One is a wh-word located in Spec,C and the other a wh-clitic in the dative form located in C (wh-clitic-doubling). Close examination reveals that the wh-word in Spec,C functions as an operator base-generated in its scope position and the dative wh-clitic in C provides it with a derivational link to the variable in the (...) dative position it binds (wh-Cliticisation). Wh-clitic-doubling and wh-Cliticisation amount to direct evidence for Cliticisation as a derivational interpretive mechanism of Grammar that obviates the need for indexing (Lebeaux 1983, Chomsky 1986, 1995). They also provide evidence for the conclusion in Kayne (1989) that Cliticisation is an instance of Head-Movement, more precisely, feature-based Head-Movement. (shrink)

Starting from an abstract setting for the Lüders-von Neumann quantum measurement process and its interpretation as a probability conditionalization rule in a non-Boolean event structure, the author derived a certain generalization of operator algebras in a preceding paper. This is an order-unit space with some specific properties. It becomes a Jordan operator algebra under a certain set of additional conditions, but does not own a multiplication operation in the most general case. A major objective of the present (...) paper is the search for such examples of the structure mentioned above that do not stem from Jordan operator algebras; first natural candidates are matrix algebras over the octonions and other nonassociative rings. Therefore, the case when a nonassociative commutative multiplication exists is studied without assuming that it satisfies the Jordan condition. The characteristics of the resulting algebra are analyzed. This includes the uniqueness of the spectral resolution as well as a criterion for its existence, subalgebras that are Jordan algebras, associative subalgebras, and more different levels of compatibility than occurring in standard quantum mechanics. However, the paper cannot provide the desired example, but contribute to the search by the identification of some typical differences between the potential examples and the Jordan operator algebras and by negative results concerning some first natural candidates. The possibility that no such example exists cannot be ruled out. However, this would result in an unexpected new characterization of Jordan operator algebras, which would have a significant impact on quantum axiomatics since some customary axioms (e.g., power-associativity or the sum postulate for observables) might turn out to be redundant then. (shrink)

The target article makes an impressive case that nested set operations (NS) facilitate probability computations by helping make clear the relevant natural frequency partitions; however, NS can also contribute to common errors. That NS constitute a general reasoning process is supported by their role in deductive, modal, causal, and other reasoning. That NS are solely a rule-based process is problematic.

In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified certain choice (...) principles such as co-finite choice, discrete choice, interval choice, compact choice and closed choice, which are cornerstones among Weihrauch degrees and it turns out that certain core theorems in analysis can be classified naturally in this structure. In particular, we study theorems such as the Intermediate Value Theorem, the Baire Category Theorem, the Banach Inverse Mapping Theorem, the Closed Graph Theorem and the Uniform Boundedness Theorem. We also explore how existing classifications of the Hahn—Banach Theorem and Weak Kőnig's Lemma fit into this picture. Well-known omniscience principles from constructive mathematics such as LPO and LLPO can also naturally be considered as Weihrauch degrees and they play an important role in our classification. Based on this we compare the results of our classification with existing classifications in constructive and reverse mathematics and we claim that in a certain sense our classification is finer and sheds some new light on the computational content of the respective theorems. Our classification scheme does not require any particular logical framework or axiomatic setting, but it can be carried out in the framework of classical mathematics using tools of topology, computability theory and computable analysis. We develop a number of separation techniques based on a new parallelization principle, on certain invariance properties of Weihrauch reducibility, on the Low Basis Theorem of Jockusch and Soare and based on the Baire Category Theorem. Finally, we present a number of metatheorems that allow to derive upper bounds for the classification of the Weihrauch degree of many theorems and we discuss the Brouwer Fixed Point Theorem as an example. (shrink)

Scott Soames has recently argued that traditional accounts of propositions as n-tuples or sets of objects and properties or functions from worlds to extensions cannot adequately explain how these abstract entities come to represent the world. Soames’ new cognitive theory solves this problem by taking propositions to be derived from agents representing the world to be a certain way. Agents represent the world to be a certain way, for example, when they engage in the cognitive act of predicating, or (...) cognizing, an act that takes place during cognitive events, such as perceiving, believing, judging and asserting. On the cognitive theory, propositions just are act types involving the act of predicating and certain other mental operations. This theory, Soames argues, solves not only the problem of how propositions come to represent but also a number of other difficulties for traditional theories, including the problem of de se propositions and the problems of accounting for how agents are capable of grasping propositions and how they come to stand in the relation of expression to sentences. I argue here that Soames’ particular version of the cognitive theory makes two problematic assumptions about cognitive operations and the contents of proper names. I then briefly examine what can count as evidence for the nature of the constituents of the cognitive operation types that produce propositions and argue that the common nature of cognitive operations and what they operate on ought to be determined empirically in cross-disciplinary work. I conclude by offering a semantics for cognitive act types that accommodates one type of empirical evidence. (shrink)

The attempt to derive mental function from brain structure is highly constrained by study of the allometric changes among brain components with evolution. In particular, even if homologous structures in different species produce similar computations, they may be constituents of larger systems (e.g., cortical-subcortical loops) that exhibit different composite operations as a function of relative size and connectivity in different-sized brains. The resulting evolutionary constraints set useful and specific conditions on candidate hypotheses of brain circuit computation.