We study positive bilinear forms on a Hilbert space which are not necessarily bounded nor induced by some positive operator. We show when different families of bilinear forms can be described as a generalized effect algebra. In addition, we present families which are or are not monotone downwards (Dedekind upwards) σ-complete generalized effect algebras.

We show that considerable sets of positive linear operators namely their extensions as closures, adjoints or Friedrichs positive self-adjoint extensions form operator (generalized) effect algebras. Moreover, in these cases the partial effect algebraic operation of two operators coincides with usual sum of operators in complex Hilbert spaces whenever it is defined. These sets include also unbounded operators which play important role of observables (e.g., momentum and position) in the mathematical formulation of quantum mechanics.

L-effect algebras are introduced as a class of L-algebras which specialize to all known generalizations of effect algebras with a \-semilattice structure. Moreover, L-effect algebras X arise in connection with quantum sets and Frobenius algebras. The translates of X in the self-similar closure S form a covering, and the structure of X is shown to be equivalent to the compatibility of overlapping translates. A second characterization represents an L-effect algebra in the spirit of closed categories. (...) As an application, it is proved that every lattice effect algebra is an interval in a right \-group, the structure group of the corresponding L-algebra. A block theory for generalized lattice effect algebras, and the existence of a generalized OML as the subalgebra of sharp elements are derived from this description. (shrink)

Effect algebras (EAs), play a significant role in quantum logic, are featured in the theory of partially ordered Abelian groups, and generalize orthoalgebras, MV-algebras, orthomodular posets, orthomodular lattices, modular ortholattices, and boolean algebras.We study centrally orthocomplete effect algebras (COEAs), i.e., EAs satisfying the condition that every family of elements that is dominated by an orthogonal family of central elements has a supremum. For COEAs, we introduce a general notion of decomposition into types; prove that a COEA factors uniquely (...) as a direct sum of types I, II, and III; and obtain a generalization for COEAs of Ramsay’s fourfold decomposition of a complete orthomodular lattice. (shrink)

Relations between effect algebras with Riesz decomposition properties and AF C*-algebras are studied. The well-known one-one correspondence between countable MV-algebras and unital AF C*-algebras whose Murray-von Neumann order is a lattice is extended to any unital AF C* algebras and some more general effect algebras having the Riesz decomposition property. One-one correspondence between tracial states on AF C*-algebras and states on the corresponding effect algebras is proved. In particular, pure (faithful) tracial states correspond to extremal (faithful) states (...) on corresponding effect algebras. (shrink)

One kind of generalized measures called quantum measures on finite effect algebras, which fulfil the grade-2 additive sum rule, is considered. One basis of vector space of quantum measures on a finite effect algebra with the Riesz decomposition property (RDP for short) is given. It is proved that any diagonally positive symmetric signed measure \(\lambda \) on the tensor product \(E\otimes E\) can determine a quantum measure \(\mu \) on a finite effect algebra \(E\) (...) with the RDP such that \(\mu (x)=\lambda (x\otimes x)\) for any \(x\in E\) . Furthermore, some conditions for a grade-2 additive measure \(\mu \) on a finite effect algebra \(E\) are provided to guarantee that there exists a unique diagonally positive symmetric signed measure \(\lambda \) on \(E\otimes E\) such that \(\mu (x)=\lambda (x\otimes x)\) for any \(x\in E\) . At last, it is showed that any grade- \(t\) quantum measure on a finite effect algebra \(E\) with the RDP is essentially established by the values on a subset of \(E\). (shrink)

The notion of a Sasaki projectionon an orthomodular lattice is generalized to a mapping Φ: E × E → E, where E is an effect algebra. If E is lattice ordered and Φ is symmetric, then E is called a Φ-symmetric effect algebra.This paper launches a study of such effect algebras. In particular, it is shown that every interval effect algebra with a lattice-ordered ambient group is Φ-symmetric, and its group is the (...) one constructed by Ravindran in his proof that every effect algebra that has the Riesz decomposition property is an interval algebra. It is shown that the doubling construction introduced in the paper is connected to the conditional event algebrasof Goodman, Nguyen, and Walker. (shrink)

We review the fact that an MV-algebra is the same thing as a lattice-ordered effect algebra in which disjoint elements are orthogonal. An HMV-algebra is an MV-effect algebra that is also a Heyting algebra and in which the Heyting center and the effect-algebra center coincide. We show that every effect algebra with the generalized comparability property is an HMV-algebra. We prove that, for an MV-effect algebra (...) E, the following conditions are mutually equivalent: (i) E is HMV, (ii) E has a center valued pseudocomplementation, (iii) E admits a central cover mapping γ such that, for all p, q∈E, p∧q=0⇒γ(p)∧q=0. (shrink)

Within the technical frame supplied by the algebraic variety of diagonalizable algebras, defined by R. Magari in [2], we prove the following: Let T be any first-order theory with a predicate Pr satisfying the canonical derivability conditions, including Löb's property. Then any formula in T built up from the propositional variables $q,p_{1},...,p_{n}$ , using logical connectives and the predicate Pr, has the same "fixed-points" relative to q (that is, formulas $\psi (p_{1},...,p_{n})$ for which for all $p_{1},...,p_{n}\vdash _{T}\phi (\psi (p_{1},...,p_{n}),p_{1},...,p_{n})\leftrightarrow \psi (...) (p_{1},...,p_{n})$ ) of a formula $\phi ^{\ast}$ of the same kind, obtained from φ in an effective way. Moreover, such $\phi ^{\ast}$ is provably equivalent to the formula obtained from φ substituting with $\phi ^{\ast}$ itself all the occurrences of q which are under Pr. In the particular case where q is always under Pr in φ, $\phi ^{\ast}$ is the unique (up to provable equivalence) "fixed-point" of φ. Since this result is proved only assuming Pr to be canonical, it can be deduced that Löb's property is, in a sense, equivalent to Gödel's diagonalization lemma. All the results are proved more generally in the intuitionistic case. (shrink)

An algebra is effective if its operations are computable under some numbering. When are two numberings of an effective partial algebra equivalent? For example, the computable real numbers form an effective field and two effective numberings of the field of computable reals are equivalent if the limit operator is assumed to be computable in the numberings . To answer the question for effective algebras in general, we give a general method based on an algebraic analysis of approximations by (...) elements of a finitely generated subalgebra. Commonly, the computable elements of a topological partial algebra are derived from such a finitely generated algebra and form a countable effective partial algebra. We apply the general results about partial algebras to the recursive reals, ultrametric algebras constructed by inverse limits, and to metric algebras in general. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. (shrink)

Research in dynamic semantics has made strides by studying various aspects of discourse in terms of computational effect systems, for example, monads (Shan, 2002; Charlow, 2014), Barker and 2014), (Maršik, 2016). We provide a system, based on graded monads, that synthesizes insights from these programs by formalizing individual discourse phenomena in terms of separate effects, or grades. Included are effects for introducing and retrieving discourse referents, non-determinism for indefiniteness, and generalized quantifier meanings. We formalize the behavior of individual (...) effects, as well as the interactions between effects, in terms of algebraic laws tailored to the relevant discourse phenomena. The system we propose is thus modular and suggests a novel approach to integrating formal accounts of distinct semantic phenomena. Finally, we give an interpretation of the system into pure \( \lambda \) -calculus that respects the laws. Future work will aim to integrate more discourse phenomena using the same methodology, for example, presupposition and conventional implicature. (shrink)

Various generalizations of Boolean algebras are being studied in algebraic quantum logic, including orthomodular lattices, orthomodular po-sets, orthoalgebras and effect algebras. This paper contains a systematic study of the structure in and between categories of such algebras. It does so via a combination of totalization (of partially defined operations) and transfer of structure via coreflections.

We give a general method for producing various effective Null and Positivstellensätze, and getting new Positivstellensätze in algebraically closed valued fields and ordered groups. These various effective Nullstellensätze produce algebraic identities certifying that some geometric conditions cannot be simultaneously satisfied. We produce also constructive versions of abstract classical results of algebra based on Zorn's lemma in several cases where such constructive version did not exist. For example, the fact that a real field can be totally ordered, or the fact (...) that a field can be embedded in an algebraically closed field. Our results are based on the concepts we develop of dynamical proofs and simultaneous collapse. (shrink)

Mancosu, P., Generalizing classical and effective model theory in theories of operations and classes, Annas of Pure and Applied Logic 52 249-308 . In this paper I propose a family of theories of operations and classes with the aim of developing abstract versions of model-theoretic results. The systems are closely related to those introduced and already used by Feferman for developing his program of ‘explicit mathematics’. The theories in question are two-sorted, with one kind of variable for individuals and the (...) other for classes. The individual variables range over a domain closed under pairing and containing, among other things, natural numbers and operations.All the theories used assume a common group of axioms that insure that the individuals in the domain satisfy the conditions for a partial combinatory algebra with pairing. We also assume a class of natural numbers and a class induction axiom on . Finally there are various class existence axioms. I work mainly with three theories, FMT0, FMT and FMTΩ, which differ from each other both in their class existence axioms as well as in some further applicative axioms.These theories have various interpretations in which every object is explicitly presented by some means of definition as well as classical, or ‘standard’, set-theoretical interpretation. The systems are formulated in a flexible general language which can be used to prove abstract theorems of mathematics , thereby generalizing recursive, hyperarithmetic and admissible versions of classical mathematics.The aim of my work is to give an abstract development of portions of model theory in the afore-mentioned theories, in a way to look as much as possible like classical mathematics. Thus, FMT0 generalizes portions of countable and recursive model theory; FMT further generalizes portions of countable and hyperarithmetical model theory and finally FMTΩ provides a generalization of the classical L-completeness theorem and of an admissible version of L-completeness due to Bruce and Keisler. This continues the development of the program mentioned above, originating with Feferman. (shrink)

It is a well-known fact that MV-algebras, the algebraic counterpart of Łukasiewicz logic, correspond to a certain type of partial algebras: lattice-ordered effect algebras fulfilling the Riesz decomposition property. The latter are based on a partial, but cancellative addition, and we may construct from them the representing ℓ-groups in a straightforward manner. In this paper, we consider several logics differing from Łukasiewicz logics in that they contain further connectives: the PŁ-, PŁ'-, PŁ'△-, and ŁΠ-logics. For all their algebraic counterparts, (...) we characterise the corresponding type of partial algebras. We moreover consider the representing f-rings. All in all, we get three-fold correspondences: the total algebras - the partial algebras - the representing rings. (shrink)

Quantum B-algebras, the partially ordered implicational algebras arising as subreducts of quantales, are introduced axiomatically. It is shown that they provide a unified semantic for non-commutative algebraic logic. Specifically, they cover the vast majority of implicational algebras like BCK-algebras, residuated lattices, partially ordered groups, BL- and MV-algebras, effect algebras, and their non-commutative extensions. The opposite of the category of quantum B-algebras is shown to be equivalent to the category of logical quantales, in the way that every quantum B-algebra (...) admits a natural embedding into a logical quantale, the enveloping quantale. Partially defined products of algebras related to effect algebras are handled efficiently in this way. The unit group of the enveloping quantale of a quantum B-algebra X is shown to be always contained in X, which gives a functorial subgroup X× of X. Similar subfunctors are obtained for the non-commutative extensions of BCK-algebras and effect algebras. The results of Galatos, Jónsson, and Tsinakis on the splitting of generalized BL-algebras into a semidirect product of a partially ordered group operating on an integral residuated poset are extended to a characterization of twisted semidirect products of a po-group by a quantum B-algebra. (shrink)

A D-algebra is a generalization of a D-poset in which a partial order is not assumed. However, if a D-algebra is equipped with a natural partial order, then it becomes a D-poset. It is shown that D-algebras and effect algebras are equivalent algebraic structures. This places the partial operation ⊝ for a D-algebra on an equal footing with the partial operation ⊕ for an effect algebra. An axiomatic structure called an effect stale-space is (...) introduced. Such spaces provide an operational interpretation for the partial operations ⊕ and ⊝. Finally, a relationship between effect-state spaces and torsion free interval effect algebras is demonstrated. (shrink)

Modifying the descriptive and theoretical generalizations of Relativized Minimality, we argue that a significant subset of weak island violations arise when an extracted phrase should scope over some intervener but is unable to. Harmless interveners seem harmless because they can support an alternative reading. This paper focuses on why certain wh-phrases are poor wide scope takers, and offers an algebraic perspective on scope interaction. Each scopal element SE is associated with certain operations (e.g., not with complements). When a wh-phrase scopes (...) over some SE, the operations associated with that SE are performed in its denotation domain. The requisite operations may or may not be available in a domain, however. We present an empirical analysis of a variety of wh-phrases. It is argued that the wh-phrases that escape all weak islands (i.e., can scope over any intervener) are those that range over individuals, the reason being that all Boolean operations are defined for their domain. Collectives, manners, amounts, numbers, etc. all denote in domains with fewer operations and are thus selectively sensitive to scopal interveners—a “semantic relativized minimality effect”. (shrink)

Mereological theories are based on the binary relation “being a part of”. The systematic investigations of mereology were initiated by Leśniewski. More recent authors (including Simons, Casati and Varzi, Hovda) formulated a series of first‐order mereological axioms. These axioms give rise to a plenitude of theories, which are of great philosophical interest. The paper considers first‐order mereological theories from the point of view of computable (or effective) algebra. Following the approach of Hirschfeldt, Khoussainov, Shore, and Slinko, we isolate two (...) important computability‐theoretic properties P (namely, degree spectra of structures, and effective dimensions), and consider the following problem: for a given mereological theory T, is it true that its models can realize every possible variant of the property P? If the answer is positive, then we say that the theory T is ‐universal. We obtain the following results about known mereological theories. Any theory T which is weaker than Extensional Closure Mereology (CEM) is ‐universal. A similar fact is true for the theory GM2. On the other hand, any theory stronger that CEM + (C) + (G) is not ‐universal. In particular, General Extensional Mereology is not ‐universal. (shrink)

We analyze the effects of uncertainty on WTA, WTP and the WTA–WTP gap. Extending the approach of Weber (Econom Lett 80:311–315, 2003) to the case of lotteries, we develop an exact expression for the WTA–WTP gap that allows identification of its magnitude under different utility specifications. Reinterpreting and extending results by Gabillon(Econom Lett 116:157–160, 2012), we also identify generally the relationship between an agent’s utility of income and the gap’s algebraic sign, as well as the effects of risk increases on (...) WTA and WTP. Finally, we derive the limit behavior of the gap as income or risk increase. (shrink)

Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classes of algebraic structures, such as groups, rings, lattices, and so forth. One way to give positive answers to this question is to adapt the original proof to the new setting. However, this can be an unnecessary duplication of effort, and lacks generality. Another method is to code the original structure into a structure in the given (...) class in a way that is effective enough to preserve the property in which we are interested. In this paper, we show how to transfer a number of computability-theoretic properties from directed graphs to structures in the following classes: symmetric, irreflexive graphs; partial orderings; lattices; rings ; integral domains of arbitrary characteristic; commutative semigroups; and 2-step nilpotent groups. This allows us to show that several theorems about degree spectra of relations on computable structures, nonpreservation of computable categoricity, and degree spectra of structures remain true when we restrict our attention to structures in any of the classes on this list. The codings we present are general enough to be viewed as establishing that the theories mentioned above are computably complete in the sense that, for a wide range of computability-theoretic nonstructure type properties, if there are any examples of structures with such properties then there are such examples that are models of each of these theories. (shrink)

We expand our effective framework for weak convergence of measures on the real line by showing that effective convergence in the Prokhorov metric is equivalent to effective weak convergence. In addition, we establish a framework for the study of the effective theory of vague convergence of measures. We introduce a uniform notion and a non-uniform notion of vague convergence, and we show that both these notions are equivalent. However, limits under effective vague convergence may not be computable even when they (...) are finite. We give an example of a finite incomputable effective vague limit measure, and we provide a necessary and sufficient condition so that effective vague convergence produces a computable limit. Finally, we determine a sufficient condition for which effective weak and vague convergence of measures coincide. As a corollary, we obtain an effective version of the equivalence between classical weak and vague convergence of sequences of probability measures. (shrink)

We introduce the notion of quantum MV algebra (QMV algebra) as a generalization of MV algebras and we show that the class of all effects of any Hilbert space gives rise to an example of such a structure. We investigate some properties of QMV algebras and we prove that QMV algebras represent non-idempotent extensions of orthomodular lattices.

We analyse the connection between the computability and continuity of functions in the case of homomorphisms between topological algebraic structures. Inspired by the Pour-El and Richards equivalence theorem between computability and boundedness for closed linear operators on Banach spaces, we study the rather general situation of partial homomorphisms between metric partial universal algebras. First, we develop a set of basic notions and results that reveal some of the delicate algebraic, topological and effective properties of partial algebras. Our main computability concepts (...) are based on numerations and include those of effective metric partial algebras and effective partial homomorphisms. We prove a general equivalence theorem that includes a version of the Pour-El and Richards Theorem, and has other applications. Finally, the Pour-El and Richards axioms for computable sequence structures on Banach spaces are generalised to computable partial sequence structures on metric algebras, and we prove their equivalence with our computability model based on numerations. (shrink)

An effectively closed set, or ${\Pi^{0}_{1}}$ class, may viewed as the set of infinite paths through a computable tree. A numbering, or enumeration, is a map from ω onto a countable collection of objects. One numbering is reducible to another if equality holds after the second is composed with a computable function. Many commonly used numberings of ${\Pi^{0}_{1}}$ classes are shown to be mutually reducible via a computable permutation. Computable injective numberings are given for the family of ${\Pi^{0}_{1}}$ classes and (...) for the subclasses of decidable and of homogeneous ${\Pi^{0}_{1}}$ classes. However no computable numberings exist for small or thin classes. No computable numbering of trees exists that includes all computable trees without dead ends. (shrink)

We analyse the connection between the computability and continuity of functions in the case of homomorphisms between topological algebraic structures. Inspired by the Pour-El and Richards equivalence theorem between computability and boundedness for closed linear operators on Banach spaces, we study the rather general situation of partial homomorphisms between metric partial universal algebras. First, we develop a set of basic notions and results that reveal some of the delicate algebraic, topological and effective properties of partial algebras. Our main computability concepts (...) are based on numerations and include those of effective metric partial algebras and effective partial homomorphisms. We prove a general equivalence theorem that includes a version of the Pour-El and Richards Theorem, and has other applications. Finally, the Pour-El and Richards axioms for computable sequence structures on Banach spaces are generalised to computable partial sequence structures on metric algebras, and we prove their equivalence with our computability model based on numerations. (shrink)

In this paper we show that the subvarieties of BL, the variety of BL-algebras, generated by single BL-chains on [0, 1], determined by continous t-norms, are finitely axiomatizable. An algorithm to check the subsethood relation between these subvarieties is provided, as well as another procedure to effectively find the equations of each subvariety. From a logical point of view, the latter corresponds to find the axiomatization of every residuated many-valued calculus defined by a continuous t-norm and its residuum. Actually, the (...) paper proves the results for a more general class than t-norm BL-chains, the so-called regular BL-chains. (shrink)

We investigate certain Brouwer-Zadeh lattices that serve as abstract counterparts of lattices of effects in Hilbert spaces under the spectral ordering. These algebras, called PBZ*-lattices, can also be seen as generalisations of orthomodular lattices and are remarkable for the collapse of three notions of “sharpness” that are distinct in general Brouwer-Zadeh lattices. We investigate the structure theory of PBZ*-lattices and their reducts; in particular, we prove some embedding results for PBZ*-lattices and provide an initial description of the lattice of PBZ*-varieties.

In this paper we show that the subvarieties of BL, the variety of BL-algebras, generated by single BL-chains on [0, 1], determined by continous t-norms, are finitely axiomatizable. An algorithm to check the subsethood relation between these subvarieties is provided, as well as another procedure to effectively find the equations of each subvariety. From a logical point of view, the latter corresponds to find the axiomatization of every residuated many-valued calculus defined by a continuous t-norm and its residuum. Actually, the (...) paper proves the results for a more general class than t-norm BL-chains, the so-called regular BL-chains. (shrink)

In Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of “revenge Liar” arguments, also higher-order combinations of generalized truth values have been suggested to account for so-called hyper-contradictions. In the present paper, Graham Priest's treatment of generalized truth values is scrutinized and compared with another strategy of generalizing the set of classical truth values and defining an entailment relation on the resulting (...) sets of higher-order values. This method is based on the concept of a multilattice. If the method is applied to the set of truth values of Belnap's “useful four-valued logic”, one obtains a trilattice, and, more generally, structures here called Belnap-trilattices. As in Priest's case, it is shown that the generalized truth values motivated by hyper-contradictions have no effect on the logic. Whereas Priest's construction in terms of designated truth values always results in his Logic of Paradox, the present construction in terms of truth and falsity orderings always results in First Degree Entailment. However, it is observed that applying the multilattice-approach to Priest's initial set of truth values leads to an interesting algebraic structure of a “bi-and-a-half” lattice which determines seven-valued logics different from Priest's Logic of Paradox. (shrink)

A. M. Pitts in [Pi] proved that HA op fp is a bi-Heyting category satisfying the Lawrence condition. We show that the embedding $\Phi: HA^\mathrm{op}_\mathrm{fp} \longrightarrow Sh(\mathbf{P_0,J_0})$ into the topos of sheaves, (P 0 is the category of finite rooted posets and open maps, J 0 the canonical topology on P 0 ) given by $H \longmapsto HA(H,\mathscr{D}(-)): \mathbf{P_0} \longrightarrow \text{Set}$ preserves the structure mentioned above, finite coproducts, and subobject classifier, it is also conservative. This whole structure on HA op (...) fp can be derived from that of Sh(P 0 ,J 0 ) via the embedding Φ. We also show that the equivalence relations in HA op fp are not effective in general. On the way to these results we establish a new kind of duality between HA op fp and a category of sheaves equipped with certain structure defined in terms of Ehrenfeucht games. Our methods are model-theoretic and combinatorial as opposed to proof-theoretic as in [Pi]. (shrink)

Quantum information science is a source of task-related axioms whose consequences can be explored in general settings encompassing quantum mechanics, classical theory, and more. Quantum states are compendia of probabilities for the outcomes of possible operations we may perform on a system: ''operational states.'' I discuss general frameworks for ''operational theories'' (sets of possible operational states of a system), in which convexity plays key role. The main technical content of the paper is in a theorem that any such theory naturally (...) gives rise to a ''weak effect algebra'' when outcomes having the same probability in all states are identified and in the introduction of a notion of ''operation algebra'' that also takes account of sequential and conditional operations. Such frameworks are appropriate for investigating what things look like from an ''inside view,'' i.e., for describing perspectival information that one subsystem of the world can have about another. Understanding how such views can combine, and whether an overall ''geometric'' picture (''outside view'') coordinating them all can be had, even if this picture is very different in structure from the perspectives within it, is the key to whether we may be able to achieve a unified, ''objective'' physical view in which quantum mechanics is the appropriate description for certain perspectives, or whether quantum mechanics is truly telling us we must go beyond this ''geometric'' conception of physics. (shrink)

This article begins with a review of the framework of fuzzy probability theory. The basic structure is given by the σ-effect algebra of effects (fuzzy events) $\mathcal{E}{\text{ }}\left( {\Omega ,\mathcal{A}} \right)$ and the set of probability measures $M_1^ + {\text{ }}\left( {\Omega ,\mathcal{A}} \right)$ on a measurable space $\left( {\Omega ,\mathcal{A}} \right)$ . An observable $X:\mathcal{B} \to {\text{ }}\mathcal{E}{\text{ }}\left( {\Omega ,\mathcal{A}} \right)$ is defined, where $\begin{gathered} X:\mathcal{B} \to {\text{ }}\mathcal{E}{\text{ }}\left( {\Omega ,\mathcal{A}} \right) \\ \left( {\Lambda ,{\text{ (...) }}\mathcal{B}} \right) \\ \end{gathered} $ is the value space of X. It is noted that there exists a one-to-one correspondence between states on $\mathcal{E} \left( {\Omega ,\mathcal{A} } \right)$ and elements of $M_1^ + {\text{ }}\left( {\Omega ,\mathcal{A} } \right)$ and between observables $X:\mathcal{B} \to \mathcal{E} \left( {\Omega ,\mathcal{A} } \right)$ and σ-morphisms from $\mathcal{E} \left( {\Lambda , \mathcal{B}} \right)$ to $\mathcal{E} \left( {\Omega , \mathcal{A}} \right)$ . Various combinations of observables are discussed. These include compositions, products, direct products, and mixtures. Fuzzy stochastic processes are introduced and an application to quantum dynamics is considered. Quantum effects are characterized from among a more general class of effects. An alternative definition of a statistical map $M_1^ + {\text{ }}\left( {\Lambda ,\mathcal{B} } \right)$ is given and it is shown that any statistical map has a unique extension to a statistical operator. Finally, various combinations of statistical maps are discussed and their relationships to the corresponding combinations of observables are derived. (shrink)

The total and the sharp character of orthodox quantum logic has been put in question in different contexts. This paper presents the basic ideas for a unified approach to partial and unsharp forms of quantum logic. We prove a completeness theorem for some partial logics based on orthoalgebras and orthomodular posets. We introduce the notion of unsharp orthoalgebra and of generalized MV algebra. The class of all effects of any Hilbert space gives rise to particular examples of these (...) structures. Finally, we investigate the relationship between unsharp orthoalgebras, generalized MV algebras, and orthomodular lattices. (shrink)

Labeled transition systems are key structures for modeling computation. In this paper, we show how they lend themselves to ordinary logical analysis (without any special new formalisms), by introducing their standard first-order theory. This perspective enables us to raise several basic model-theoretic questions of definability, axiomatization and preservation for various notions of process equivalence found in the computational literature, and answer them using well-known logical techniques (including the Compactness theorem, Saturation and Ehrenfeucht games). Moreover, we consider what happens to this (...) general theory when one restricts attention to special classes of transition systems (in particular, finite ones), as well as extended logical languages (in particular, infinitary first-order logic). We hope that this puts standard logical formalisms on the map as a serious option for a theory of computational processes. As a side benefit, our approach increases comparability with several other existing formalisms over labeled transition systems (such as Process Algebra or Modal Logic). We provide some pointers to this effect, too. (shrink)

The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra $\mathcal {B}$ to each formula. We show some basic results regarding the effect of the properties of $\mathcal {B}$ on the behavior of such types, and show they are particularity well behaved in the case of NIP theories. In particular, we generalize the third author’s result about counting types, as well as the notion of (...) a smooth type and extending a type to a smooth one. We then show that Keisler measures are tied to certain Boolean types and show that some of the results can thus be transferred to measures—in particular, giving an alternative proof of the fact that every measure in a dependent theory can be extended to a smooth one. We also study the stable case. We consider this paper as an invitation for more research into the topic of Boolean types. (shrink)

This paper studies the structure of semisimple rings using techniques of reverse mathematics, where a ring is left semisimple if the left regular module is a finite direct sum of simple submodules. The structure theorem of left semisimple rings, also called Wedderburn-Artin Theorem, is a famous theorem in noncommutative algebra, says that a ring is left semisimple if and only if it is isomorphic to a finite direct product of matrix rings over division rings. We provide a proof for (...) the theorem in $$\mathrm RCA_{0}$$, showing the structure theorem for computable semisimple rings. The decomposition of semisimple rings as finite direct products of matrix rings over division rings is unique. Based on an effective proof of the Jordan-Hölder Theorem for modules with composition series, we also provide an effective proof for the uniqueness of the matrix decomposition of semisimple rings in $$\mathrm RCA_{0}$$. (shrink)

Labeled transition systems are key structures for modeling computation. In this paper, we show how they lend themselves to ordinary logical analysis (without any special new formalisms), by introducing their standard first-order theory. This perspective enables us to raise several basic model-theoretic questions of definability, axiomatization and preservation for various notions of process equivalence found in the computational literature, and answer them using well-known logical techniques (including the Compactness theorem, Saturation and Ehrenfeucht games). Moreover, we consider what happens to this (...) general theory when one restricts attention to special classes of transition systems (in particular, finite ones), as well as extended logical languages (in particular, infinitary first-order logic). We hope that this puts standard logical formalisms on the map as a serious option for a theory of computational processes. As a side benefit, our approach increases comparability with several other existing formalisms over labeled transition systems (such as Process Algebra or Modal Logic). We provide some pointers to this effect, too. (shrink)

We study degree-theoretic properties of reals that are not random with respect to any continuous probability measure (NCR). To this end, we introduce a family of generalized Hausdorff measures based on the iterates of the “dissipation” function of a continuous measure and study the effective nullsets given by the corresponding Solovay tests. We introduce two constructions that preserve non-randomness with respect to a given continuous measure. This enables us to prove the existence of NCR reals in a number of (...) Turing degrees. In particular, we show that every \(\Delta ^0_2\) -degree contains an NCR element. (shrink)

Non-commuting quantities and hidden parameters – Wave-corpuscular dualism and hidden parameters – Local or nonlocal hidden parameters – Phase space in quantum mechanics – Weyl, Wigner, and Moyal – Von Neumann’s theorem about the absence of hidden parameters in quantum mechanics and Hermann – Bell’s objection – Quantum-mechanical and mathematical incommeasurability – Kochen – Specker’s idea about their equivalence – The notion of partial algebra – Embeddability of a qubit into a bit – Quantum computer is not Turing machine (...) – Is continuality universal? – Diffeomorphism and velocity – Einstein’s general principle of relativity – „Mach’s principle“ – The Skolemian relativity of the discrete and the continuous – The counterexample in § 6 of their paper – About the classical tautology which is untrue being replaced by the statements about commeasurable quantum-mechanical quantities – Logical hidden parameters – The undecidability of the hypothesis about hidden parameters – Wigner’s work and и Weyl’s previous one – Lie groups, representations, and psi-function – From a qualitative to a quantitative expression of relativity − psi-function, or the discrete by the random – Bartlett’s approach − psi-function as the characteristic function of random quantity – Discrete and/ or continual description – Quantity and its “digitalized projection“ – The idea of „velocity−probability“ – The notion of probability and the light speed postulate – Generalized probability and its physical interpretation – A quantum description of macro-world – The period of the as-sociated de Broglie wave and the length of now – Causality equivalently replaced by chance – The philosophy of quantum information and religion – Einstein’s thesis about “the consubstantiality of inertia ant weight“ – Again about the interpretation of complex velocity – The speed of time – Newton’s law of inertia and Lagrange’s formulation of mechanics – Force and effect – The theory of tachyons and general relativity – Riesz’s representation theorem – The notion of covariant world line – Encoding a world line by psi-function – Spacetime and qubit − psi-function by qubits – About the physical interpretation of both the complex axes of a qubit – The interpretation of the self-adjoint operators components – The world line of an arbitrary quantity – The invariance of the physical laws towards quantum object and apparatus – Hilbert space and that of Minkowski – The relationship between the coefficients of -function and the qubits – World line = psi-function + self-adjoint operator – Reality and description – Does a „curved“ Hilbert space exist? – The axiom of choice, or when is possible a flattening of Hilbert space? – But why not to flatten also pseudo-Riemannian space? – The commutator of conjugate quantities – Relative mass – The strokes of self-movement and its philosophical interpretation – The self-perfection of the universe – The generalization of quantity in quantum physics – An analogy of the Feynman formalism – Feynman and many-world interpretation – The psi-function of various objects – Countable and uncountable basis – Generalized continuum and arithmetization – Field and entanglement – Function as coding – The idea of „curved“ Descartes product – The environment of a function – Another view to the notion of velocity-probability – Reality and description – Hilbert space as a model both of object and description – The notion of holistic logic – Physical quantity as the information about it – Cross-temporal correlations – The forecasting of future – Description in separable and inseparable Hilbert space – „Forces“ or „miracles“ – Velocity or time – The notion of non-finite set – Dasein or Dazeit – The trajectory of the whole – Ontological and onto-theological difference – An analogy of the Feynman and many-world interpretation − psi-function as physical quantity – Things in the world and instances in time – The generation of the physi-cal by mathematical – The generalized notion of observer – Subjective or objective probability – Energy as the change of probability per the unite of time – The generalized principle of least action from a new view-point – The exception of two dimensions and Fermat’s last theorem. (shrink)

We introduce the simpler and shorter proof of Hajek’s theorem that the mathematical induction on ω implies a contradiction in the set theory with the comprehension principle within Łukasiewicz predicate logic Ł ${\forall}$ (Hajek Arch Math Logic 44(6):763–782, 2005) by extending the proof in (Yatabe Arch Math Logic, accepted) so as to be effective in any linearly ordered MV-algebra.

Six characteristics of effective representational systems for conceptual learning in complex domains have been identified. Such representations should: (1) integrate levels of abstraction; (2) combine globally homogeneous with locally heterogeneous representation of concepts; (3) integrate alternative perspectives of the domain; (4) support malleable manipulation of expressions; (5) possess compact procedures; and (6) have uniform procedures. The characteristics were discovered by analysing and evaluating a novel diagrammatic representation that has been invented to support students' comprehension of electricity—AVOW diagrams (Amps, Volts, Ohms, (...) Watts). A task analysis is presented that demonstrates that problem solving using a conventional algebraic approach demands more effort than AVOW diagrams. In an experiment comparing two groups of learners using the alternative approaches, the group using AVOW diagrams learned more than the group using equations and were better able to solve complex transfer problems and questions involving multiple constraints. Analysis of verbal protocols and work scratchings showed that the AVOW diagram group, in contrast to the equations group, acquired a coherently organised network of concepts, learnt effective problem solving procedures, and experienced more positive learning events. The six principles of effective representations were proposed on the basis of these findings. AVOW diagrams are Law Encoding Diagrams, a general class of representations that have been shown to support learning in other scientific domains. (shrink)

Various proposals for generalizing event spaces for probability functions have been put forth in the mathematical, scientific, and philosophic literatures. In cognitive psychology such generalizations are used for explaining puzzling results in decision theory and for modeling the influence of context effects. This commentary discusses proposals for generalizing probability theory to event spaces that are not necessarily boolean algebras. Two prominent examples are quantum probability theory, which is based on the set of closed subspaces of a Hilbert space, and topological (...) probability theory, which is based on the set of open sets of a topology. Both have been applied to a variety of cognitive situations. This commentary focuses on how event space properties can influence probability concepts and impact cognitive modeling. (shrink)

Continuing the paper [7], in which the Blum-Shub-Smale approach to computability over the reals has been generalized to arbitrary algebraic structures, this paper deals with computability and recognizability over structures of infinite signature. It begins with discussing related properties of the linear and scalar real structures and of their discrete counterparts over the natural numbers. Then the existence of universal functions is shown to be equivalent to the effective encodability of the underlying structure. Such structures even have universal functions (...) satisfying the s-m-n theorem and related features. The real and discrete examples are discussed with respect to effective encodability. Megiddo structures and computational extensions of effectively encodable structures are encodable, too. As further variants of universality, universal functions with enumerable sets of program codes and such ones with constructible codes are investigated. Finally, the existence of m-complete sets is shown to be independent of the effective encodability of structures, and the linear and scalar structures are discussed once more, under this aspect. (shrink)

Category Theory has developed rapidly. This book aims to present those ideas and methods which can now be effectively used by Mathe­ maticians working in a variety of other fields of Mathematical research. This occurs at several levels. On the first level, categories provide a convenient conceptual language, based on the notions of category, functor, natural transformation, contravariance, and functor category. These notions are presented, with appropriate examples, in Chapters I and II. Next comes the fundamental idea of an adjoint (...) pair of functors. This appears in many substantially equivalent forms: That of universal construction, that of direct and inverse limit, and that of pairs offunctors with a natural isomorphism between corresponding sets of arrows. All these forms, with their interrelations, are examined in Chapters III to V. The slogan is "Adjoint functors arise everywhere". Alternatively, the fundamental notion of category theory is that of a monoid -a set with a binary operation of multiplication which is associative and which has a unit; a category itself can be regarded as a sort of general­ ized monoid. Chapters VI and VII explore this notion and its generaliza­ tions. Its close connection to pairs of adjoint functors illuminates the ideas of universal algebra and culminates in Beck's theorem characterizing categories of algebras; on the other hand, categories with a monoidal structure lead inter alia to the study of more convenient categories of topological spaces. (shrink)

Six characteristics of effective representational systems for conceptual learning in complex domains have been identified. Such representations should: (1) integrate levels of abstraction; (2) combine globally homogeneous with locally heterogeneous representation of concepts; (3) integrate alternative perspectives of the domain; (4) support malleable manipulation of expressions; (5) possess compact procedures; and (6) have uniform procedures. The characteristics were discovered by analysing and evaluating a novel diagrammatic representation that has been invented to support students' comprehension of electricity—AVOW diagrams (Amps, Volts, Ohms, (...) Watts). A task analysis is presented that demonstrates that problem solving using a conventional algebraic approach demands more effort than AVOW diagrams. In an experiment comparing two groups of learners using the alternative approaches, the group using AVOW diagrams learned more than the group using equations and were better able to solve complex transfer problems and questions involving multiple constraints. Analysis of verbal protocols and work scratchings showed that the AVOW diagram group, in contrast to the equations group, acquired a coherently organised network of concepts, learnt effective problem solving procedures, and experienced more positive learning events. The six principles of effective representations were proposed on the basis of these findings. AVOW diagrams are Law Encoding Diagrams, a general class of representations that have been shown to support learning in other scientific domains. (shrink)

Adriaan van Roomen published an outline of what he called a Mathesis Universalis in 1597. This earned him a well-deserved place in the history of early modern ideas about a universal mathematics which was intended to encompass both geometry and arithmetic and to provide general rules valid for operations involving numbers, geometrical magnitudes, and all other quantities amenable to measurement and calculation. ‘Mathesis Universalis’ (MU) became the most common (though not the only) term for mathematical theories developed with that aim. (...) At some time around 1600 van Roomen composed a new version of his MU, considerably different from the earlier one. This second version was never effectively published and it has not been discussed in detail in the secondary literature before. The text has, however, survived and the two versions are presented and compared in the present article. Sections 1–6 are about the first version of van Roomen’s MU the occasion of its publication (a controversy about Archimedes’ treatise on the circle, Sect. 2), its conceptual context (Sect. 3), its structure (with an overview of its definitions, axioms, and theorems) and its dependence on Clavius’ use of numbers in dealing with both rational and irrational ratios (Sect. 4), the geometrical interpretation of arithmetical operations multiplication and division (Sect. 5), and an analysis of its content in modern terms. In his second version of a MU van Roomen took algebra into account, inspired by Viète’s early treatises; he planned to publish it as part of a new edition of Al-Khwarizmi’s treatise on algebra (Sect. 7). Section 8 describes the conceptual background and the difficulties involved in the merging of algebra and geometry; Sect. 9 summarizes and analyzes the definitions, axioms and theorems of the second version, noting the differences with the first version and tracing the influence of Viète. Section 10 deals with the influence of van Roomen on later discussions of MU, and briefly sketches Descartes’ ideas about MU as expressed in the latter’s Regulae. (shrink)

This paper establishes model-theoretic properties of \, a variation of monadic first-order logic that features the generalised quantifier \. We will also prove analogous versions of these results in the simpler setting of monadic first-order logic with and without equality and \, respectively). For each logic \ we will show the following. We provide syntactically defined fragments of \ characterising four different semantic properties of \-sentences: being monotone and continuous in a given set of monadic predicates; having truth preserved under (...) taking submodels or being truth invariant under taking quotients. In each case, we produce an effectively defined map that translates an arbitrary sentence \ to a sentence \ belonging to the corresponding syntactic fragment, with the property that \ is equivalent to \ precisely when it has the associated semantic property. As a corollary of our developments, we obtain that the four semantic properties above are decidable for \-sentences. (shrink)

Let I0 be a a computable basis of the fully effective vector space V∞ over the computable field F. Let I be a quasimaximal subset of I0 that is the intersection of n maximal subsets of the same 1-degree up to *. We prove that the principal filter \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{L}^{\ast}(V,\uparrow )}$$\end{document} of V = cl(I) is isomorphic to the lattice \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{L}(n, \overline{F})}$$\end{document} of subspaces (...) of an n-dimensional space over \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\overline{F}}$$\end{document}, a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma _{3}^{0}}$$\end{document} extension of F. As a corollary of this and the main result of Dimitrov (Math Log 43:415–424, 2004) we prove that any finite product of the lattices \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${(\mathcal{L}(n_{i}, \overline{F }_{i}))_{i=1}^{k}}$$\end{document} is isomorphic to a principal filter of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{ L}^{\ast}(V_{\infty})}$$\end{document}. We thus answer Question 5.3 “What are the principal filters of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{L}^{\ast}(V_{\infty})?}$$\end{document} ” posed by Downey and Remmel (Computable algebras and closure systems: coding properties, handbook of recursive mathematics, vol 2, pp 977–1039, Stud Log Found Math, vol 139, North-Holland, Amsterdam, 1998) for spaces that are closures of quasimaximal sets. (shrink)