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)

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)

In this paper we give an axiomatisation of the concept of a computability structure with partial sequences on a many-sorted metric partial algebra, thus extending the axiomatisation given by Pour-El and Richards in [9] for Banach spaces. We show that every Banach-Mazur computable partial function from an effectively separable computable metric partial Σ-algebra A to a computable metric partial Σ-algebra B must be continuous, and conversely, that every effectively continuous partial function with semidecidable domain (...) and which preserves the computability of a computably enumerable dense set must be computable. Finally, as an application of these results we give an alternative proof of the first main theorem for Banach spaces first proved by Pour-El and Richards. (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)

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 give an axiomatisation of the concept of a computability structure with partial sequences on a many‐sorted metric partial algebra, thus extending the axiomatisation given by Pour‐El and Richards in [9] for Banach spaces. We show that every Banach‐Mazur computable partial function from an effectively separable computable metric partial Σ‐algebraAto a computable metric partial Σ‐algebraBmust be continuous, and conversely, that every effectively continuous partial function with semidecidable domain and which preserves the (...) computability of a computably enumerable dense set must be computable. Finally, as an application of these results we give an alternative proof of the first main theorem for Banach spaces first proved by Pour‐El and Richards. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

The effects in a quantum-mechanical system form a partial algebra and a partially ordered set which is the prototypical example of the effect algebras discussed in this paper. The relationships among effect algebras and such structures as orthoalgebras and orthomodular posets are investigated, as are morphisms and group- valued measures (or charges) on effect algebras. It is proved that there is a universal group for every effect algebra, as well as a universal vector space over an (...) arbitrary field. (shrink)

We discuss the relationships between effect algebras with the Riesz Decomposition Property and partially ordered groups with interpolation. We show that any σ-orthocomplete atomic effect algebra with the Riesz Decomposition Property is an MV-effect algebras, and we apply this result for pseudo-effect algebras and for states.

In the study of categories whose morphisms display a behaviour similar to that of partial functions, the concept of morphism domain is, obviously, central. In this paper an operation defined on morphisms describes those properties which are related to morphisms being regarded as abstractions of partial functions. This operation allows us to characterise the morphism domains directly, and gives rise to an algebra defined by a simple set of identities. No product-like categorical structures are needed therefore. We also (...) develop the construction of topologies together with the notion of continuous morphism, in order to test the effectiveness of this approach. It is interesting to see how much of the computational character of the morphisms is translated into continuity. (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)

An effect algebra is a partial algebraic structure, originally formulated as an algebraic base for unsharp quantum measurements. In this article we present an approach to the study of lattice effect algebras (LEAs) that emphasizes their structure as algebraic models for the semantics of (possibly) non-standard symbolic logics. This is accomplished by focusing on the interplay among conjunction, implication, and negation connectives on LEAs, where the conjunction and implication connectives are related by a residuation law. Special cases of (...) LEAs are MV-algebras and orthomodular lattices. The main result of the paper is a characterization of LEAs in terms of so-called Sasaki algebras. Also, we compare and contrast LEAs, Hájek's BL-algebras, and the basic algebras of Chajda, Halaš, and Kühr. (shrink)

We define a new class of pseudo effect algebras, called kite pseudo effect algebras, which is connected with partially ordered groups not necessarily with strong unit. In such a case, starting even with an Abelian po-group, we can obtain a noncommutative pseudo effect algebra. We show how such kite pseudo effect algebras are tied with different types of the Riesz Decomposition Properties. Kites are so-called perfect pseudo effect algebras, and we define conditions when kite pseudo effect (...) algebras have the least non-trivial normal ideal. (shrink)

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.

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.

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)

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)

This article presents and compares various algebraic structures that arise in axiomatic unsharp quantum physics. We begin by stating some basic principles that such an algebraic structure should encompass. Following G. Mackey and G. Ludwig, we first consider a minimal state-effect-probability (minimal SEFP) structure. In order to include partial operations of sum and difference, an additional axiom is postulated and a SEFP structure is obtained. It is then shown that a SEFP structure is equivalent to an effect algebra with (...) an order determining set of states. We also consider σ-SEFP structures and show that these structures distinguish Hilbert space from incomplete inner product spaces. Various types of sharpness are discussed and under what conditions a Brouwer complementation can be defined to obtain a BZ-poset is investigated. In this case it is shown that every effect has a best lower and upper sharp approximation and that the set of all Brouwer sharp effects form an orthoalgebra. (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)

In examples like the total recursive functions or the computable real numbers the canonical indexings are only partial maps. It is even impossible in these cases to find an equivalent total numbering. We consider effectively given topological T 0 -spaces and study the problem in which cases the canonical numberings of such spaces can be totalized, i.e., have an equivalent total indexing. Moreover, we show under very natural assumptions that such spaces can effectively and effectively homeomorphically be embedded into (...) a totally indexed algebraic partial order that is closed under the operation of taking least upper bounds of enumerable directed subsets. (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)

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)

In this paper we recall, improve, and extend several definitions, properties and applications of our previous 2019 research referred to NeutroAlgebras and AntiAlgebras (also called NeutroAlgebraic Structures and respectively AntiAlgebraic Structures). Let <A> be an item (concept, attribute, idea, proposition, theory, etc.). Through the process of neutrosphication, we split the nonempty space we work on into three regions {two opposite ones corresponding to <A> and <antiA>, and one corresponding to neutral (indeterminate) <neutA> (also denoted <neutroA>) between the opposites}, which may (...) or may not be disjoint – depending on the application, but they are exhaustive (their union equals the whole space). A NeutroAlgebra is an algebra which has at least one NeutroOperation or one NeutroAxiom (axiom that is true for some elements, indeterminate for other elements, and false for the other elements). A Partial Algebra is an algebra that has at least one Partial Operation, and all its Axioms are classical (i.e. axioms true for all elements). Through a theorem we prove that NeutroAlgebra is a generalization of Partial Algebra, and we give examples of NeutroAlgebras that are not Partial Algebras. We also introduce the NeutroFunction (and NeutroOperation). (shrink)

This paper presents the first purely algebraic characterization of classes of partial algebras definable by a set of strong equations. This result was posible due to new tools such as invariant congruences, i.e. a generalization of the notion of a fully invariant congruence, and extension of algebras, specific for strong equations.

Based on existence equations, quasivarieties of heterogeneous partial algebras have the same algebraic description as those of total algebras. Because of the restriction of the valuations to the free variables of a formula — the usual reference to the needed variables e.g. for identities (in order to get useful and manageable results) is essentially replaced here by the use of the logical Craig projections — already varieties of heterogeneous partial algebras behave to some extent rather (...) like quasivarieties than having the properties known from varieties of total homogeneous algebras. It is one of the main aims of this note to make this more explicit. On the other hand we want to list several results known for quasivarieties of heterogeneous partial algebras — and adopt them to the extended signature — after having recalled the language and the main concepts necessary for the understanding of the results. (shrink)

Based on existence equations, quasivarieties of heterogeneous partial algebras have the same algebraic description as those of total algebras. Because of the restriction of the valuations to the free variables of a formula — the usual reference to the needed variables e.g. for identities (in order to get useful and manageable results) is essentially replaced here by the use of the “logical Craig projections” — already varieties of heterogeneous partial algebras behave to some extent rather (...) like quasivarieties than having the properties known from varieties of total homogeneous algebras. It is one of the main aims of this note to make this more explicit. On the other hand we want to list several results known for quasivarieties of heterogeneous partial algebras — and adopt them to the extended signature — after having recalled the language and the main concepts necessary for the understanding of the results. (shrink)

This paper augments Hailperin's substantial efforts to place Boole's algebra of logic on a solid footing. Namely Horn sentences are used to give a modern formulation of the principle that Boole adopted in 1854 as the foundation for his algebra of logic—we call this principle The Rule of 0 and 1.

We employ the notions of "sequential function" and "interrogation" (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using Longley's preorder-enriched category of partial combinatory algebras and decidable applicative structures. We also investigate total combinatory algebras of partial functions. One of the results is that every realizability topos is a geometric quotient of a realizability topos on a total combinatory algebra.

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)

In Tsuji 1997 the concept of Jeffrey-Keynes algebras was introduced in order to construct a paraconsistent theory of decision under uncertainty. In the present paper we show that these algebras can be used to develop a theory of decision under uncertainty that measures the degree of belief on the quasi (or partial) truth of the propositions. As applications of this new theory of decision, we use it to analyze Popper's paradox of ideal evidence and to indicate a (...) possible way of formalizing Keynes' theory of economic action. (shrink)

The goal of this paper is to generalize a notion of characteristic (or Jankov) formula by using finite partial Heyting algebras instead of the finite subdirectly irreducible algebras: with every finite partial Heyting algebra we associate a characteristic formula, and we study the properties of these formulas. We prove that any intermediate logic can be axiomatized by such formulas. We further discuss the correlations between characteristic formulas of finite partial algebras and canonical formulas. Then (...) with every well-connected Heyting algebra we associate a set of characteristic formulas that correspond to each finite relative subalgebra of this algebra. Finally, we demonstrate that in many respects these sets enjoy the same properties as regular characteristic formulas. In the last section we outline an approach how to generalize these obtained results to the broad classes of algebras. (shrink)

The article deals with compatible families of Boolean algebras. We define the notion of a partial Boolean algebra in a broader sense (PBA(bs)) and then we show that there is a mutual correspondence between PBA(bs) and compatible families of Boolean algebras (Theorem (1.8)). We examine in detail the interdependence between PBA(bs) and the following classes: partial Boolean algebras in the sense of Kochen and Specker (§ 2), ortholattices (§ 3, § 5), and orthomodular posets (§ (...) 4), respectively. (shrink)

We show that an effect algebra E possess an order-determining set of states if and only if E is semiclassical; that is, E is essentially a classical effect algebra. We also show that if E possesses at least one state, then E admits hidden variables in the sense that E is homomorphic to an MV-algebra that reproduces the states of E. Both of these results indicate that we cannot distinguish between a quantum mechanical effect algebra and a classical one. Hereditary (...) properties of sharpness and coexistence are discussed and the existence of {0,1} and dispersion-free states are considered. We then discuss a stronger structure called a sequential effect algebra (SEA) that we believe overcomes some of the inadequacies of an effect algebra. We show that a SEA is semiclassical if and only if it possesses an order-determining set of dispersion-free states. (shrink)

We show the non-arithmeticity of 1st order theories of lattices of Σ n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithmetic theories than has been previously known, and of the lattice of degrees of interpretability over PA. The first two results are applications of Nies’ theorem on the non-arithmeticity of the 1st order theory of the lattice of r.e. ideals on any effectively dense r.e. Boolean algebra. The theorem on degrees (...) of interpretability relies on an adaptation of techniques leading to Nies’ theorem. (shrink)

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)

Results of R. Miller in 2009 proved several theorems about algebraic fields and computable categoricity. Also in 2009, A. Frolov, I. Kalimullin, and R. Miller proved some results about the degree spectrum of an algebraic field when viewed as a subfield of its algebraic closure. Here, we show that the same computable categoricity results also hold for finite-branching trees under the predecessor function and for connected, finite-valence, pointed graphs, and we show that the degree spectrum results do not hold for (...) these trees and graphs. We also offer an explanation for why the degree spectrum results distinguish these classes of structures: although all three structures are algebraic structures, the fields are what we call effectively algebraic. (shrink)

Partial combinatory algebras (pcas) are algebraic structures that serve as generalized models of computation. In this article, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene’s models, of van Oosten’s sequential computation model, and of Scott’s graph model, showing that an embedding between two relativized models exists if and only if there exists a particular reduction between the oracles. We obtain a similar result for the lambda calculus, showing in particular that it (...) cannot be embedded in Kleene’s first model. (shrink)

We study perfect effect algebras, that is, effect algebras with the Riesz decomposition property where every element belongs either to its radical or to its co-radical. We define perfect effect algebras with principal radical and we show that the category of such effect algebras is categorically equivalent to the category of unital po-groups with interpolation. We introduce an observable on a \-monotone \-complete perfect effect algebra with principal radical and we show that observables are in a (...) one-to-one correspondence with spectral resolutions of observables. (shrink)

PurposeDrawing upon the stimulus-organism-response model, this paper aims to investigate the effects of stores’ environmental components on Chinese consumers’ emotions and intentions to purchase luxury brands.Design/Methodology/ApproachData were collected from Chinese consumers who have purchased luxury brands from retail stores. Partial least squares-structural equation modeling and fuzzy-set qualitative comparative analysis were employed for data analysis.FindingsThe results of PLS-SEM indicated that three dimensions of the store environment directly and significantly influenced Chinese consumers’ emotions. However, fsQCA revealed greater heterogeneity among respondents by (...) highlighting stores’ environmental components and Chinese consumers’ emotions.Originality/ValueThis study makes significant contributions to the marketing literature by examining the S-O-R model alongside fsQCA approach to conditionally predict outcomes in a luxury brand context. The present study may be one of the first to examine the effects of stores’ environmental components on Chinese consumers’ emotions and purchase intentions, applying both symmetrical test and asymmetrical test approaches to determine significant components of the store environment as well as component combinations that predict Chinese consumers’ emotions and purchase intentions. (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)

Following the book Algebraic Set Theory from André Joyal and leke Moerdijk [8], we give a characterization of the initial ZF-algebra, for Heyting pretoposes equipped with a class of small maps. Then, an application is considered (the effective topos) to show how to recover an already known model (McCarty [9]).

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)

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)

The concept of an effect test space, which is equivalent to a D-test space of Dvurečenskij and Pulmannová, is introduced. Connections between effect test space. (E-test space, for short) morphisms, and event-morphisms as well as between algebraic E-test spaces and effect algebras, are studied. Bimorphisms and E-test space tensor products are considered. It is shown that any E-test space admits a unique (up to an isomorphism) universal group and that this group, considered as a test group, determines the E-test (...) space uniquely (up to an isomorphism). (shrink)