In this paper we consider possibilities for applying p-adic valued logic BL to the task of designing an unconventional computer based on the medium of slime mould, the giant amoebozoa that looks for attractants and reaches them by means of propagating complex networks. If it is assumed that at any time step t of propagation the slime mould can discover and reach not more than attractants, then this behaviour can be coded in terms of p-adic numbers. As a result, this (...) behaviour implements some p-adic valued arithmetic circuits and can verify p-adic valued logical propositions. (shrink)

In this paper we present two families of probability logics (denoted _QLP_ and \(QLP^{ORT}\) ) suitable for reasoning about quantum observations. Assume that \(\alpha \) means “O = a”. The notion of measuring of an observable _O_ can be expressed using formulas of the form \(\square \lozenge \alpha \) which intuitively means “if we measure _O_ we obtain \(\alpha \) ”. In that way, instead of non-distributive structures (i.e., non-distributive lattices), it is possible to relay on classical logic extended with (...) the corresponding modal laws for the modal logic \({\textbf{B}}\). We consider probability formulas of the form \(CS_{z_{1},\rho _{1}; \ldots ; z_{m},\rho _{m}} \square \lozenge \alpha \) related to an observable _O_ and a possible world (vector) _w_: if _a_ is an eigenvalue of _O_, \(w_{1}\),..., \(w_{m}\) form a base of a closed subspace of the considered Hilbert space which corresponds to eigenvalue _a_, and if _w_ is a linear combination of the basis vectors such that \(w=c_{1}\cdot w_{1}+ \cdots + c_{m}\cdot w_{m}\) for some \(c_{i}\in {\mathbb {C}}\), then \(\Vert c_{1}-z_{1}\Vert \le \rho _{1}\),..., \(\Vert c_{m}-z_{m}\Vert \le \rho _{m}\), and the probability of obtaining _a_ while measuring _O_ in the state _w_ is equal to \(\Sigma _{i=1}^{m}\Vert c_{i}\Vert ^{2}\). Formulas are interpreted in reflexive and symmetric Kripke models equipped with probability distributions over families of subsets of possible worlds that are orthocomplemented lattices, while for \(QLP^{ORT}\) also satisfy ortomodularity. We give infinitary axiomatizations, prove the corresponding soundness and strong completeness theorems, and also decidability for _QLP_-logics. (shrink)