Intuitionistc probability and the Bayesian objection to dogmatism

Given a few assumptions, the probability of a conjunction is raised, and the probability of its negation is lowered, by conditionalising upon one of the conjuncts. This simple result appears to bring Bayesian confirmation theory into tension with the prominent dogmatist view of perceptual justification – a tension often portrayed as a kind of ‘Bayesian objection’ to dogmatism. In a recent paper, David Jehle and Brian Weatherson observe that, while this crucial result holds within classical probability theory, it fails within intuitionistic probability theory. They conclude that the dogmatist who is willing to take intuitionistic logic seriously can make a convincing reply to the Bayesian objection. In this paper, I argue that this conclusion is premature – the Bayesian objection can survive the transition from classical to intuitionistic probability, albeit in a slightly altered form. I shall conclude with some general thoughts about what the Bayesian objection to dogmatism does and doesn’t show

On an Intuitionistic Logic for Pragmatics

We reconsider the pragmatic interpretation of intuitionistic logic [21] regarded as a logic of assertions and their justications and its relations with classical logic. We recall an extension of this approach to a logic dealing with assertions and obligations, related by a notion of causal implication [14, 45]. We focus on the extension to co-intuitionistic logic, seen as a logic of hypotheses [8, 9, 13] and on polarized bi-intuitionistic logic as a logic of assertions and conjectures: looking at the S4 modal translation, we give a denition of a system AHL of bi-intuitionistic logic that correctly represents the duality between intuitionistic and co-intuitionistic logic, correcting a mistake in previous work [7, 10]. A computational interpretation of cointuitionism as a distributed calculus of coroutines is then used to give an operational interpretation of subtraction.Work on linear co-intuitionism is then recalled, a linear calculus of co-intuitionistic coroutines is dened and a probabilistic interpretation of linear co-intuitionism is given as in [9]. Also we remark that by extending the language of intuitionistic logic we can express the notion of expectation, an assertion that in all situations the truth of p is possible and that in a logic of expectations the law of double negation holds. Similarly, extending co-intuitionistic logic, we can express the notion of conjecture that p, dened as a hypothesis that in some situation the truth of p is epistemically necessary

A Geometric Interpretation of the Neutrosophic Set - A Generalization of the Intuitionistic Fuzzy Set

In this paper we generalize the intuitionistic fuzzy set (IFS), paraconsistent set, and intuitionistic set to the neutrosophic set (NS). Several examples are presented. Also, a geometric interpretation of the Neutrosophic Set is given using a Neutrosophic Cube. Many distinctions between NS and IFS are underlined.Comment: 9 pages. Presented at the 2003 BISC FLINT-CIBI International Workshop on Soft Computing for Internet and Bioinformatics, University of Berkeley, California, December 15-19, 2003, under the title "Generalization of the Intuitionistic Fuzzy Set to the Neutrosophic Set

A lambda calculus for quantum computation with classical control

The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the first author's work on quantum flow-charts. We define a call-by-value operational semantics, and we give a type system using affine intuitionistic linear logic. The main results of this paper are the safety properties of the language and the development of a type inference algorithm.Comment: 15 pages, submitted to TLCA'05. Note: this is basically the work done during the first author master, his thesis can be found on his webpage. Modifications: almost everything reformulated; recursion removed since the way it was stated didn't satisfy lemma 11; type inference algorithm added; example of an implementation of quantum teleportation adde

The intuitionistic temporal logic of dynamical systems

A dynamical system is a pair $(X,f)$, where $X$ is a topological space and $f\colon X\to X$ is continuous. Kremer observed that the language of propositional linear temporal logic can be interpreted over the class of dynamical systems, giving rise to a natural intuitionistic temporal logic. We introduce a variant of Kremer's logic, which we denote ${\sf ITL^c}$, and show that it is decidable. We also show that minimality and Poincar\'e recurrence are both expressible in the language of ${\sf ITL^c}$, thus providing a decidable logic expressive enough to reason about non-trivial asymptotic behavior in dynamical systems

Plithogeny, Plithogenic Set, Logic, Probability, and Statistics

In this book we introduce for the first time, as generalization of dialectics and neutrosophy, the philosophical concept called plithogeny. And as its derivatives: the plithogenic set (as generalization of crisp, fuzzy, intuitionistic fuzzy, and neutrosophic sets), plithogenic logic (as generalization of classical, fuzzy, intuitionistic fuzzy, and neutrosophic logics), plithogenic probability (as generalization of classical, imprecise, and neutrosophic probabilities), and plithogenic statistics (as generalization of classical, and neutrosophic statistics). Plithogeny is the genesis or origination, creation, formation, development, and evolution of new entities from dynamics and organic fusions of contradictory and/or neutrals and/or non-contradictory multiple old entities. Plithogenic Set is a set whose elements are characterized by one or more attributes, and each attribute may have many values. An attribute’s value v has a corresponding (fuzzy, intuitionistic fuzzy, or neutrosophic) degree of appurtenance d(x, v) of the element x, to the set P, with respect to some given criteria. In order to obtain a better accuracy for the plithogenic aggregation operators in the plithogenic set/logic/probability and for a more exact inclusion (partial order), a (fuzzy, intuitionistic fuzzy, or neutrosophic) contradiction (dissimilarity) degree is defined between each attribute value and the dominant (most important) attribute value. The plithogenic intersection and union are linear combinations of the fuzzy operators tnorm and tconorm, while the plithogenic complement/inclusion/equality are influenced by the attribute values’ contradiction (dissimilarity) degrees. Formal definitions of plithogenic set/logic/probability/statistics are presented into the book, followed by plithogenic aggregation operators, various theorems related to them, and afterwards examples and applications of these new concepts in our everyday life

Bohrification of operator algebras and quantum logic

Following Birkhoff and von Neumann, quantum logic has traditionally been based on the lattice of closed linear subspaces of some Hilbert space, or, more generally, on the lattice of projections in a von Neumann algebra A. Unfortunately, the logical interpretation of these lattices is impaired by their nondistributivity and by various other problems. We show that a possible resolution of these difficulties, suggested by the ideas of Bohr, emerges if instead of single projections one considers elementary propositions to be families of projections indexed by a partially ordered set C(A) of appropriate commutative subalgebras of A. In fact, to achieve both maximal generality and ease of use within topos theory, we assume that A is a so-called Rickart C*-algebra and that C(A) consists of all unital commutative Rickart C*-subalgebras of A. Such families of projections form a Heyting algebra in a natural way, so that the associated propositional logic is intuitionistic: distributivity is recovered at the expense of the law of the excluded middle. Subsequently, generalizing an earlier computation for n-by-n matrices, we prove that the Heyting algebra thus associated to A arises as a basis for the internal Gelfand spectrum (in the sense of Banaschewski-Mulvey) of the "Bohrification" of A, which is a commutative Rickart C*-algebra in the topos of functors from C(A) to the category of sets. We explain the relationship of this construction to partial Boolean algebras and Bruns-Lakser completions. Finally, we establish a connection between probability measure on the lattice of projections on a Hilbert space H and probability valuations on the internal Gelfand spectrum of A for A = B(H).Comment: 31 page

A Pragmatic Interpretation of Quantum Logic

Scholars have wondered for a long time whether the language of quantum mechanics introduces a quantum notion of truth which is formalized by quantum logic (QL) and is incompatible with the classical (Tarskian) notion. We show that QL can be interpreted as a pragmatic language of assertive formulas which formalize statements about physical systems that are empirically justified or unjustified in the framework of quantum mechanics. According to this interpretation, QL formalizes properties of the metalinguistic notion of empirical justification within quantum mechanics rather than properties of a quantum notion of truth. This conclusion agrees with a general integrationist perspective that interprets nonstandard logics as theories of metalinguistic notions different from truth, thus avoiding incompatibility with classical notions and preserving the globality of logic. By the way, some elucidations of the standard notion of quantum truth are also obtained. Key words: pragmatics, quantum logic, quantum mechanics, justifiability, global pluralism.Comment: Third version: 20 pages. Sects. 1, 2, and 4 rewritten and improved. Explanations adde