The starting point of this paper is the empirically determined ability to reason in natural language by employing probable sentences. A sentence is understood to be logically probable if its schema, expressed as a formula in the language of classical propositional calculus, takes the logical value of truth for the majority of Boolean valuations, i.e., as a logically probable formula. Then, the formal system P is developed to encode the set of these (...) class='Hi'>logically probable formulas. Based on natural semantics, a strong completeness theorem for P is proved. Alternative notions of consequence for logically probable sentences are also considered. (shrink)

This note presents a very brief history of the observation that the probability of the material conditional A⊃B is in general different from, but cannot be less than, the conditional probability of B given A. The difference between the two probabilities is significant for the interpretation of conditionals and for the possibility of inductive probability. It can be quantitatively specified in so-called ‘excess laws’ for which Popper appears to have claimed priority. I argue that such a priority claim should be (...) rejected and credit should instead be given, if to anyone, to Boole and Reichenbach instead. (shrink)

In this article we present a p-adic valued probabilistic logic equation image which is a complete and decidable extension of classical propositional logic. The key feature of equation image lies in ability to formally express boundaries of probability values of classical formulas in the field equation image of p-adic numbers via classical connectives and modal-like operators of the form Kr, ρ. Namely, equation image is designed in such a way that the elementary probability sentences Kr, ρα actually do have their (...) intended meaning—the probability of propositional formula α is in the equation image-ball with the center r and the radius ρ. Due to modal nature of the operators Kr, ρ, it was natural to use the probability Kripke like models as equation image-structures, provided that probability functions range over equation image instead of equation image or equation image. (shrink)

In this article we present a p-adic valued probabilistic logic equation image which is a complete and decidable extension of classical propositional logic. The key feature of equation image lies in ability to formally express boundaries of probability values of classical formulas in the field equation image of p-adic numbers via classical connectives and modal-like operators of the form Kr, ρ. Namely, equation image is designed in such a way that the elementary probability sentences Kr, ρα actually do have their (...) intended meaning—the probability of propositional formula α is in the equation image-ball with the center r and the radius ρ. Due to modal nature of the operators Kr, ρ, it was natural to use the probability Kripke like models as equation image-structures, provided that probability functions range over equation image instead of equation image or equation image. (shrink)

1 Choice conjecture In axiomatizing nonclassical extensions of classical sentential logic one tries to make do, if one can, with adding to classical sentential logic a finite number of axiom schemes of the simplest kind and a finite number of inference rules of the simplest kind. The simplest kind of axiom scheme in effect states of a particular formula P that for any substitution of formulas for atoms the result of its application to P is to count as an (...) axiom. The simplest kind of onepremise inference rule in effect states of a particular pair of formulas P and Q that for any substitution of formulas for atoms, if the result of its application to P is a theorem, then the result of its application to Q is to count as a theorem; similarly for many-premise rules. Such are the schemes and rules of all the best-known modal and tense logics, for instance. Sometimes it is difficult to find such simple schemes and rules. In that case one may resort to less simple schemes or less simple rules. There is no generally recognized rigorous definition of "next simplest kind" of scheme. Neither is there any generally recognized definition of "next simplest kind" of rule, and hence there is no fully rigorous enunciation of the choice conjecture, the conjecture that schemes of the next simplest kind can always be avoided in favor of rules of the next simplest kind and vice versa. Nonetheless, there are cases where intuitively one does recognize that the schemes or rules in a given axiomatization are only slightly more complex than the simplest kind, including cases where one does have a choice between adopting slightly-more-complex-than-simplest schemes and adopting slightly-more-complex-than-simplest rules. In tense logic early examples of slightly more complex rules are found in [2] and [3] : there is one example of the embarrassed use of such rules in the former, and many examples of the enthusiastic use of such rules in the latter and its sequels. Accordingly the rules in question have come to be called "Gabbay-style" rules. (shrink)

In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics and a set of logical constants (with specified arities). The first generator returns formulae of exactly the given depth, using all or some of the propositional letters. The second does the same but samples up-to the given depth. The third generator outputs formulae with exactly (...) the desired depth and all the atomics in the set. To make the generators uniform (i.e. to make them return every formula in their space with the same probability), we will prove various cardinality results about those spaces. (shrink)

Kolmogorov''s axiomatization of probability includes the familiarratio formula for conditional probability: 0).$$ " align="middle" border="0">.

According to quantum mechanics, statements about the future made by sentient beings like us are, in general, neither true nor false; they must satisfy a many-valued logic. I propose that the truth value of such a statement should be identified with the probability that the event it describes will occur. After reviewing the history of related ideas in logic, I argue that it gives an understanding of probability which is particularly satisfactory for use in quantum mechanics. I construct a lattice (...) of future-tense propositions, with truth values in the interval [0, 1], and derive logical properties of these truth values given by the usual quantum-mechanical formula for the probability of a history. (shrink)

This approach does not define a probability measure by syntactical structures. It reveals a link between modal logic and mathematical probability theory. This is shown (1) by adding an operator (and two further connectives and constants) to a system of lower predicate calculus and (2) regarding the models of that extended system. These models are models of the modal system S₅ (without the Barcan formula), where a usual probability measure is defined on their set of possible worlds. Mathematical probability (...) models can be seen as models of S₅. (shrink)

The Adams Thesis holds for a conditional → and a probability assignment P if and only if P=P whenever P>0. The restriction ensures that P is well defined by the classical formula P=P/P. Drawing on deep results of Maharam on measure algebras, it is shown that, notwithstanding well-known triviality results, any probability space can be extended to a probability space with a new conditional satisfying the Adams Thesis and satisfying a number of axioms for conditionals. This puts significant limits (...) on how far triviality results can go. (shrink)

As a natural example of a 1-random real, Chaitin proposed the halting probability Ω of a universal prefix-free machine. We can relativize this example by considering a universal prefix-free oracle machine U. Let [Formula: see text] be the halting probability of UA; this gives a natural uniform way of producing an A-random real for every A ∈ 2ω. It is this operator which is our primary object of study. We can draw an analogy between the jump operator from computability (...) theory and this Omega operator. But unlike the jump, which is invariant under the choice of an effective enumeration of the partial computable functions, [Formula: see text] can be vastly different for different choices of U. Even for a fixed U, there are oracles A =* B such that [Formula: see text] and [Formula: see text] are 1-random relative to each other. We prove this and many other interesting properties of Omega operators. We investigate these operators from the perspective of analysis, computability theory, and of course, algorithmic randomness. (shrink)

This work is in two parts. The main aim of part 1 is a systematic examination of deductive, probabilistic, inductive and purely inductive dependence relations within the framework of Kolmogorov probability semantics. The main aim of part 2 is a systematic comparison of (in all) 20 different relations of probabilistic (in)dependence within the framework of Popper probability semantics (for Kolmogorov probability semantics does not allow such a comparison). Added to this comparison is an examination of (in all) 15 purely inductive (...) dependence relations. ————Part 1 leads in an axiomatic step-by-step development from the elementary classical truth value semantics of a sentential-logical language, called ‘L’, (chapter 1) to the elementary Kolmogorov probability semantics of L (chapter 2), which is then extended to four axiomatic semantical theories of dependence relations between the formulae of L. First the elementary Kolmogorov probability semantics of L is extended to a theory, called ‘Kdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 3). Then Kdd is extended to a theory, called ‘Kpd1’, of the degree to which formulae of L probabilistically depend on each other in regard to a given probability distribution on the set of all formulae of L (chapter 4). Kpd1, in its turn, gets extended to a theory, called ‘Kpd2’, of the relations of probabilistic dependence and independence, relativized to unary Kolmogorov probability functions defined on L (chapter 5). Then Kpd2 is extended to a theory, called ‘Kid’, of the relations of inductive dependence and inductive independence, again relativized to unary Kolmogorov probability functions defined on L (chapter 6). Finally, Kid is extended to a theory, called ‘Kpid’, of the relations of purely inductive positive and negative dependence, relativized to unary Kolmogorov probability functions defined on L (chapter 7). ——Chapter 1, which deals with the familiar notions of truth value functions, tautologies, consequence relations and relations of logical opposition, is naturally the shortest chapter of part 1.——In chapter 2, the elementary classical semantics of L is extended to the elementary Kolmogorov probability semantics of L, i.e. to an axiomatic theory of unary and of binary Kolmogorov probability functions defined on the set of formulae of L. Because of the elementary character of this theory, chapter 2 is also rather short.——Chapter 3 introduces the first theory on dependence relations, to wit: Kdd, the theory of deductive (in)dependence between formulae of L. I follow here the well-known idea of Popper and Miller, who have used it in a famous discussion on the nature of probabilistic support for their arguments that probabilistic support is deductive, not inductive. I develop Kdd in the form of about 100 theorems, making ample use of the fact that deductive independence is nothing but subcontrary opposition, and close with a remark on the fundamental difference between deductive and logical dependence—two relations the ideas of which are all too easily mixed up.——Chapters 4 and 5 deal extensively with the traditional ideas of probabilistic (in)dependence, applied to formulae rather than to events. As always, I proceed axiomatically in a step-by-step process under systematic viewpoints and obtain about 300 theorems in this way. In the formulation of the theorems, I took special care to state clearly and expressly so-called tacit assumptions, especially those concerning the probability values of the formulae said to be dependent on each other. These assumptions are usually missing in the literature, due either to economy of writing or to sloppiness of thinking. Presumably, both chapters contain little that is new, their value lying more in the systematic grouping and organic development of the theorems than in the newness of these.——In chapter 6, I extend the axiomatic theory about probabilistic (in)dependence which has been elaborated in chapter 5, to an axiomatic theory of inductive (in)dependence by requiring of the relation of inductive (in)dependence that it be probabilistic (in)dependence, but not also logical implication or logical opposition. I point out the differences between probabilistic and inductive (in)dependence by means of some 60 theorems and close my examination of inductive (in)dependence by considering its relationship to the notion of support in the philosophy of science.——Finally, in chapter 7, the last of part 1, I take the step from inductive dependence to what I call ‘purely inductive dependence’ by combining the idea of inductive dependence with that of deductive independence in a way which is suggested by writings of Popper and Miller. I arrive at two noteworthy theorems. Firstly, there is indeed no purely inductive support. But secondly, and perhaps amazingly, countersupport is purely inductive.————Whereas the probabilistic framework of part 1 of the present work is Kolmogorov probability semantics, the framework of part 2 is Popper probability semantics, which is not only worth examining as a fascinating alternative to orthodox Kolmogorov probability semantics, but also allows us to examine dependence relations more deeply, than Kolmogorov probability semantics does. Part 2 leads—again in an axiomatic step-by-step development—from the basic Popper probability semantics of L, called ‘Pb’, (chapter 8) via a probabilistic theory of logical attributes, called ‘Ps’, (chapter 9) to four axiomatic semantical theories of dependence relations between the formulae of L. First, Ps is extended to a theory, called ‘Pdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 10). Then Pdd is extended to a theory, called ‘Ppd’, of (in all) 20 relations of probabilistic (in)dependence, relativized to binary Popper probability functions defined on L (chapter 11). Ppd, in its turn, is extended to a theory, called ‘Pid’, of (in all) 10 relations of inductive dependence, again relativized to binary Popper probability functions defined on L (first part of chapter 12). Finally, Pid is extended to a theory, called ‘Ppid’, of (in all) 15 relations of purely inductive positive and negative dependence, relativized to binary Popper probability functions defined on L (second part of chapter 12).——Chapter 8, the first chapter of part 2 of the present work, is entirely preparatory. It introduces the axioms and about 180 theorems (150 of them together with their proofs) of basic Popper probability semantics in order to set this kind of semantics under way.——Then, in chapter 9, basic Popper probability semantics is extended to a probabilistic theory of logical properties of and relations between the formulae of L. Although I think that the way I did this extension is of some interest in itself, the main task of chapter 9 is again a preparatory one: to yield the indispensable lemmata (about 90 in number) for the theorems concerning probabilistic dependence relations in chapter 11 and concerning inductive dependence relations in chapter 12.——Chapter 10 brings the extension of Ps to the theory Pdd of deductive (in)dependence. Only half a dozen theorems are noted here for later use in the Pdd-extensions Ppd and Ppid. In view of the over 100 theorems already gained on this topic in the Kolmogorovian framework (cf. chapter 3), a similar extensive elaboration of Pdd would have been superfluous.——Chapter 11 is the most important one of part 2. It consists of a systematic comparison of 20 probabilistic (in)dependence concepts by means of about 230 theorems, obtained within the axiomatic theory Ppd, which is built up as an extension of Pdd. The main points of comparison were: differences in logical strength; reflexivity and symmetry; behaviour under the condition that the probability values of the formulae in question are extreme. It turned out that each of the examined concepts violates a strong and straightforward version of the intuitive requirement that probabilistic dependence should go with logical dependence. Whereas the corresponding chapter 5 in part 1 of the present work may not have led to new theorems, chapter 11 yields dozens of them in the process of comparison of concepts of dependence and independence which had—as far as I know—never before been treated in a single theoretical framework. With Popper probability semantics, this framework has become available, and here I have simply made full use of it.——In chapter 12, I extend the theory Ppd of probabilistic (in)dependence to the theories Pid and Ppid of inductive and purely inductive dependence, in a way very similar to that in which I have extended the theory Kpd2 to the theories Kid and Kpid in chapters 6 and 7. The first main result of Kpid (roughly: there is no purely inductive support) could be repeated for four of the five purely inductive positive dependence relations considered in chapter 12, whereas the second main result of Kpid (roughly: there is purely inductive countersupport ) could be repeated for each of the five examined purely inductive negative dependence relations. Chapter 12 closes with a brief recapitulation and critical discussion of the main results. (shrink)

It was Hume's concept of knowledge that marked Masaryk's philosophy more than influential Kant. Masaryk devoted Hume his inaugural lecture The Probability Calculus and Hume's Scepticism at Prague University in 1882. He tried to face his scepticism concerning causation and induction by a formula P = n: or P = : where P means the increasing probability that an event that had happened n times in the past will happen again. Hume stresses that there is an essential difference between (...) probability and certainty, and we have no logical reason to presuppose that the past experience is legitimate for expectation that the future will resemble to the past. Only our belief, not knowledge, leads us to that. Although Masaryk did not accept Hume's scepticism, he had deep understanding for his way of thinking. Reflection of Hume's influence on Masaryk in Czech philosophy is unsatisfactory, which is stated in this article. (shrink)

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without the Barcan Formula (...) (like FOL + K)in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics [40].We conclude by introducing general first order neighborhood frames with constant domains and we offer a general completeness result for the entire family of classical first order modal systems in terms of them, circumventing some well-known problems of propositional and first order neighborhood semantics (mainly the fact that many classical modal logics are incomplete with respect to an unmodified version of either neighborhood or relational frames). We argue that the semantical program that thus arises offers the first complete semantic unification of the family of classical first order modal logics. (shrink)

Quantum probability is used to provide a new organization of basic quantum theory in a logical, axiomatic way. The principal thesis is that there is one fundamental time evolution equation in quantum theory, and this is given by a new version of Born’s Rule, which now includes both consecutive and conditional probability as it must, since science is based on correlations. A major modification of one of the standard axioms of quantum theory allows the implementation of various mathematically distinct models (...) (commonly called ‘pictures’) of them. A natural definition of isomorphism of models is presented next. For a given Hamiltonian the standard ‘pictures’ of quantum theory (e.g., Schrödinger, Heisenberg, interaction) are isomorphic models, whose probabilities are nonetheless model independent. The Schrödinger equation remains valid in one model of the axioms, even though it is no longer the fundamental equation of time evolution. All the usual calculations of standard, textbook quantum theory remain valid, but they are put in a new light. For example, the ‘collapse’ of the state is now viewed in the Schrödinger model as _one_ step in a _two_ step algorithm for calculating _one_ conditional probability. In the isomorphic Heisenberg model, where states are constant in time, one has the same conditional probability given by the same formula. Also, entanglement is defined in a new, more general model independent way as an aspect of quantum probability without using ‘collapse’ or tensor products. (shrink)

In 2001, Le Bars proved that there exists an existential monadic second-order sentence such that the probability that it is true on [Formula: see text] does not converge and conjectured that, for EMSO sentences with two first-order variables, the zero–one law holds. In this paper, we prove that the conjecture fails for [Formula: see text], and give new examples of sentences with fewer variables without convergence.

This paper presents a systematic approach for obtaining results from the area of quantitative investigations in logic and type theory. We investigate the proportion between tautologies (inhabited types) of a given length n against the number of all formulas (types) of length n. We investigate an asymptotic behavior of this fraction. Furthermore, we characterize the relation between number of premises of implicational formula (type) and the asymptotic probability of finding such formula among the all ones. We also deal (...) with a distribution of these asymptotic probabilities. Using the same approach we also prove that the probability that randomly chosen fourth order type (or type of the order not greater than 4), which admits decidable lambda definability problem, is zero. (shrink)

We study a propositional probabilistic temporal epistemic logic |$\textbf {PTEL}$| with both future and past temporal operators, with non-rigid set of agents and the operators for agents’ knowledge and for common knowledge and with probabilities defined on the sets of runs and on the sets of possible worlds. A semantics is given by a class |${\scriptsize{\rm Mod}}$| of Kripke-like models with possible worlds. We prove decidability of |$\textbf {PTEL}$| by showing that checking satisfiability of a formula in |${\scriptsize{\rm Mod}}$| (...) is equivalent to checking its satisfiability in a finite set of finitely representable structures. The same procedure can be applied to the class of all synchronous |${\scriptsize{\rm Mod}}$|-models. We give an upper complexity bound for the satisfiability problem for |${\scriptsize{\rm Mod}}$|⁠. (shrink)

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without the Barcan Formula (...) (like FOL + K)in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics [40].We conclude by introducing general first order neighborhood frames with constant domains and we offer a general completeness result for the entire family of classical first order modal systems in terms of them, circumventing some well-known problems of propositional and first order neighborhood semantics (mainly the fact that many classical modal logics are incomplete with respect to an unmodified version of either neighborhood or relational frames). We argue that the semantical program that thus arises offers the first complete semantic unification of the family of classical first order modal logics. (shrink)

We continue the investigations initiated in the recent papers where Bayes logics have been introduced to study the general laws of Bayesian belief revision. In Bayesian belief revision a Bayesian agent revises his prior belief by conditionalizing the prior on some evidence using the Bayes rule. In this paper we take the more general Jeffrey formula as a conditioning device and study the corresponding modal logics that we call Jeffrey logics, focusing mainly on the countable case. The containment relations (...) among these modal logics are determined and it is shown that the logic of Bayes and Jeffrey updating are very close. It is shown that the modal logic of belief revision determined by probabilities on a finite or countably infinite set of elementary propositions is not finitely axiomatizable. The significance of this result is that it clearly indicates that axiomatic approaches to belief revision might be severely limited. (shrink)

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without the Barcan Formula (...) (like FOL + K)in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics [40].We conclude by introducing general first order neighborhood frames with constant domains and we offer a general completeness result for the entire family of classical first order modal systems in terms of them, circumventing some well-known problems of propositional and first order neighborhood semantics (mainly the fact that many classical modal logics are incomplete with respect to an unmodified version of either neighborhood or relational frames). We argue that the semantical program that thus arises offers the first complete semantic unification of the family of classical first order modal logics. (shrink)

The theory of logical gates in quantum computation has inspired the development of new forms of quantum logic where the meaning of a formula is identified with a density operator and the logical connectives are interpreted as operations defined in terms of quantum gates. We show some relations between the Bertini gate and many valued connectives by probability values. On this basis, one can deal with quantum circuits as expressions in an algebraic environment such as product many valued algebra (...) for combinational circuits. As can be expected, we show that the compositional logic characterized by the qubit semantics is stronger than the compositional Łukasiewicz quantum computational logic by a counterexample. But, in the holistic case, we conjecture that they can characterize the same logic. (shrink)

In this paper we propose a semantic analysis of Lewis' counterfactuals. By exploiting the structural properties of the recently introduced boolean algebras of conditionals, we show that counterfactuals can be expressed as formal combinations of a conditional object and a normal necessity modal operator. Specifically, we introduce a class of algebras that serve as modal expansions of boolean algebras of conditionals, together with their dual relational structures. Moreover, we show that Lewis' semantics based on sphere models can be reconstructed in (...) this framework. As a consequence, we establish the soundness and completeness of a slightly stronger variant of Lewis' logic for counterfactuals with respect to our algebraic models. In the second part of the paper, we present a novel approach to the probability of counterfactuals showing that it aligns with the uncertainty degree assigned by a belief function, as per Dempster-Shafer theory, to its associated conditional formula. Furthermore, we characterize the probability of a counterfactual in terms of Gärdenfors' imaging rule for the probabilistic update. (shrink)

This guide accompanies the following article: ‘Logic and Divine Simplicity’. Philosophy Compass 6/4 : pp. 282–294, doi: Author’s IntroductionFirst‐order formalizations of classical theistic doctrines are increasingly used in contemporary work in philosophy of religion and philosophical theology, as a means for clarifying the conceptual structure of the doctrines and their role in inferential procedures. But there are a variety of different ways in which such doctrines have been formalized, each representing the doctrines as having different conceptual structures. Moreover, the adequacy (...) of such formalizations as such has, at least with respect to some classes of doctrines, been disputed. One reason for disputing their adequacy derives from the conceptual impact of classical theism’s doctrine of divine simplicity.Author RecommendsFrege, Gottlob ‘Begriffsschrift: a formula language of pure thought,’ trans. Michael Beany, in The Frege Reader, ed. Beany. Oxford: Blackwell, pp. 47–78. The preface contains interesting remarks about the purpose of formalization as understood by the chief pioneer of modern formal logic. These remarks are also connected by Frege to his views on the relation between thought and language more generally.Russell, Bertrand, and Whitehead, A.N. Principia Mathematica, Vol. I. Cambridge: Cambridge University Press.The preface and first section of the long introduction contain remarks on the purpose and advantages of formalization. Chapter 1 of the introduction contains what is probably one of the first formalizations ever of a theistic doctrine, and is given in terms of a definite description analysis.Suppes, Patrick ‘The Desirability of Formalization in Science,’The Journal of Philosophy, Vol. 65, No. 20, pp. 651–64.Clear and concise discussion of some of the advantages of formalization in philosophical inquiry, written by a prominent contemporary American philosopher‐logician.Nieznański, Edward ‘The Beginnings of Formalization in Theology,’ in Advances in Scientific Philosophy: Essays in Honour of Paul Weingartner, eds. Gerhard Schurz and Gregory J.W. Dorn. Amsterdam and Atlanta, GA: Ropodi, pp. 551–9.A valuable paper that narrates, among other things, the programme of formalizing theistic doctrines that emerged in Poland in the 1920s under the influence of the Lvov‐Warsaw School. Various examples of formalizations are also given.Quine, W.V.O. Mathematical Logic. Cambridge, MA: Harvard University Press.In Section 27 of this classic study, Quine offers a formalization of theistic doctrines which seeks to avoid the difficulties of earlier formalizations by means of a subtle extensional singleton set analysis. The proposal has not won many adherents, but is worthy of careful study nonetheless.Woleński, Jan ‘Theism, Fideism, Atheism, Agnosticism,’ in Logic, Ethics and All That Jazz: Essays in Honour of Jordan Howard Sobel, eds. Lars‐Göran Johansson, Jan Österberg, and Rysiek Sliwinski. Uppsala: Uppsala Philosophical Studies, pp. 387–400.A concise but lucid survey of some attempts to formalize theistic doctrines and some problems besetting these attempts. Woleński also proposes his own method of formalization, which could be described as a simplified version of Quine’s method in Mathematical Logic.Bocheński, Joseph The Logic of Religion. New York: New York University Press.The first book‐length treatment of the relation between modern logic and theism. It covers much ground, and remains very readable.Alston, William P. ‘Religious Language and Verificationism,’ in The Rationality of Theism, eds. Paul Moser and Paul Copan. London: Routledge, pp. 17–34.Identifies some problems with attempts at articulating theistic doctrines by means of subject‐predicate language. Highly relevant to formalizations of theistic doctrines, even though this topic is not dealt with explicitly.Kraal, Anders ‘Logic and Divine Simplicity,’Philosophy Compass.Offers a survey of three main methods of formalizing theistic doctrines, and of some variants of these methods. Argues that certain formalizations of theistic doctrines are bound to be rejected as conceptually inadequate by all who understand the doctrines at hand within the framework provided by the traditional doctrine of divine simplicity.Sample Syllabus Week I: The Idea of Formalization and the Project of Formalizing Theistic Doctrines Reading:Frege, Gottlob ‘Begriffsschrift: a formula language of pure thought,’ trans. Michael Beany, in The Frege Reader, ed. Beany. Oxford: Blackwell, pp. 47–78. Russell, Bertrand, and Whitehead, A.N. Principia Mathematica, Vol. I. Cambridge: Cambridge University Press. Suppes, Patrick ‘The Desirability of Formalization in Science,’The Journal of Philosophy, Vol. 65, No. 20, pp. 651–64.Nieznański, Edward ‘The Beginnings of Formalization in Theology,’ in Advances in Scientific Philosophy: Essays in Honour of Paul Weingartner, eds. Gerhard Schurz and Gregory J.W. Dorn. Amsterdam and Atlanta, GA: Ropodi, pp. 551–9. Week II: Formalizing Theistic Doctrines: Three Alternative Methods Reading:Woleński, Jan ‘Theism, Fideism, Atheism, Agnosticism,’ in Logic, Ethics and All That Jazz: Essays in Honour of Jordan Howard Sobel, eds. Lars‐Göran Johansson, Jan Österberg, and Rysiek Sliwinski. Uppsala: Uppsala Philosophical Studies, pp. 387–400.Russell, Bertrand, and Whitehead, A.N. Principia Mathematica, Vol. I. Cambridge: Cambridge University Press. Quine, W.V.O. Mathematical Logic. Cambridge, MA: Harvard University Press. Week III: Arguments for and Against Some Formalizations of Theistic Doctrines Reading:Bocheński, Joseph The Logic of Religion. New York: New York University Press. Kraal, Anders ‘Logic and Divine Simplicity,’Philosophy Compass, Vol. 6, No. 4, pp. 282–94.Focus Questions1 What do Frege, Russell and Whitehead, and Suppes understand the purpose or purposes of logical formalization to be, and why do they think formalization can achieve these purposes?2 Woleński sketches some simple ways of formalizing theistic doctrines such as ‘God exists’ or ‘God is almighty’ in terms of 1‐place predicates which he subsequently abandons in favour of other methods. What reasons lead him to abandon these more simple methods of formalization?3 What are the advantages of the definite description formalization of theistic doctrines offered by Russell and Whitehead?4 Quine offers a subtle formalization of the theistic doctrine ‘God exists’ in terms of singleton sets. What problems are Quine’s formalization intended to accommodate, and how does it seek to accommodate them?5 Which relative merits or demerits are there in Bocheński’s and Kraal’s respective arguments for and against the adequacy of certain formalizations of theistic doctrines? (shrink)

-/- Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) to various natural classes of complete metric structures (such as probability algebras, Hilbert spaces, and Banach spaces). With research in continuous first-order logic preoccupied with studying the model theory of this framework, we find a natural question calls for attention. Is there an interesting set of axioms yielding a completeness result? -/- The primary purpose (...) of this article is to show that a certain, interesting set of axioms does indeed yield a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely) satisfiable if (and only if) it is consistent. From this result it follows that continuous first-order logic also satisfies an approximated form of strong completeness, whereby Σ⊧φ (if and) only if Σ⊢φ ∸2−n for all n < ω. This approximated form of strong completeness asserts that if Σ⊧φ, then proofs from Σ, being finite, can provide arbitrarily better approximations of the truth of φ. -/- Additionally, we consider a different kind of question traditionally arising in model theory—that of decidability. When is the set of all consequences of a theory (in a countable, recursive language) recursive? Say that a complete theory T is decidable if for every sentence φ, the value φ T is a recursive real, and moreover, uniformly computable from φ. If T is incomplete, we say it is decidable if for every sentence φ the real number φ T o is uniformly recursive from φ, where φ T o is the maximal value of φ consistent with T. As in classical first-order logic, it follows from the completeness theorem of continuous first-order logic that if a complete theory admits a recursive (or even recursively enumerable) axiomatization then it is decidable. (shrink)

The logical interpretation of probability, or "objective Bayesianism'' – the theory that (some) probabilities are strictly logical degrees of partial implication – is defended. The main argument against it is that it requires the assignment of prior probabilities, and that any attempt to determine them by symmetry via a "principle of insufficient reason" inevitably leads to paradox. Three replies are advanced: that priors are imprecise or of little weight, so that disagreement about them does not matter, within limits; that it (...) is possible to distinguish reasonable from unreasonable priors on logical grounds; and that in real cases disagreement about priors can usually be explained by differences in the background information. It is argued also that proponents of alternative conceptions of probability, such as frequentists, Bayesians and Popperians, are unable to avoid committing themselves to the basic principles of logical probability. (shrink)

We suggest to define objective probabilities by similarity-weighted empirical frequencies, where more similar cases get a higher weight in the computation of frequencies. This formula is justified intuitively and axiomatically, but raises the question, which similarity function should be used? We propose to estimate the similarity function from the data, and thus obtain objective probabilities. We compare this definition to others, and attempt to delineate the scope of situations in which objective probabilities can be used.

A new direction in philosophy Between 1920 and 1940 logical empiricism reset the direction of philosophy of science and much of the rest of Anglo-American philosophy. It began as a relatively organized movement centered on the Vienna Circle, and like-minded philosophers elsewhere, especially in Berlin. As Europe drifted into the Nazi era, several important figures, especially Carnap and Neurath, also found common ground in their liberal politics and radical social agenda. Together, the logical empiricists set out to reform traditional philosophy (...) with a new set of doctrines more firmly grounded in logic and science. Criticism and decline Because of Nazi persecution, most of the European adherents of logical empiricism moved to the United States in the late 1930s. During the 1940s, many of their most cherished tenets became targets of criticism from outsiders as well as from within their own ranks. Philosophers of science in the late 1950s and 1960s rejected logical empiricism and, starting in the 1970s, presented such alternative programs such as scientific realism with evolutionary epistemology. A resurgence of interest During the early 1980s, philosophers and historians of philosophy began to study logical empiricism as an important movement. Unlike their predecessors in the 1960s-for whom the debate over logical empiricism now seems to have been largely motivated by professional politics-these philosopher no longer have to take positions for or against logical empiricism. The result has been a more balanced view of that movement, its achievements, its failures, and its influence. Hard-to-find core writings now available This collection makes available a selection of the most influential and representative writings of the logical empiricists, important contemporary criticisms of their doctrines, their responses, as well as the recent reappraisals. Introductions to each volume examine the articles in historical context and provide importantbackground information that is vital to a full understanding of the issues discussed. They outline prevalent trends, identifying leading figures and summarize their positions and reasoning, as well as those of opposing thinkers. (shrink)

Illuminates legal reasoning -- and its justification At least since plato and Aristotle, thinkers have pondered the relationship between philosophical arguments and the "sophistical" arguments offered by the Sophists -- who were the first professional lawyers. Judges wield substantial political power, and the justifications they offer for their decisions are a vital means by which citizens can assess the legitimacy of how that power is exercised. However, to evaluate judicial justifications requires close attention to the method of reasoning behind decisions. (...) This new collection illuminates and explains the political and moral importance in justifying the exercise of judicial power. Explores enduring questions Focusing on work over the past century, the essays address important recurring questions, such as: When a judge or a lawyer reasons to a conclusion about what is legally required in a given case, must he also ask what is morally required? To what extent do a judge's personal, political, or moral biases affect his legal reasoning? What is the impact of such biases? Can all such biases be avoided? Is legal reasoning similar to reasoning in mathematics, logic, and linguistics, the physical sciences, the social sciences, or literature and history? Do formal logical modes of argument play any roles in legal reasoning? Solid coverage, well organized The articles were chosen to present some of the most influential works on the topic, as well as less familiar works that are thought provoking and informative. Each volume also offers a representative range of theoretical approaches to its topic, contains an introduction that locates the subject within the larger framework oftheories of legal reasoning and jurisprudence, and includes bibliographical notes on further readings. Many 19th century legal theorists argued that deduction is the central mode of legal reasoning, and that legal argument is like a deductive proof in mathematics or logic. They were attracted to this "deductivist" concept because it suggested that legal reasoning could be politically and morally neutral. This volume brings together some of the most thought-provoking articles on both sides of the debate. It also contains several leading articles that explain the role of probabilistic judgments and presumptions in various types of legal arguments, including the laws of evidence and criminal procedure. The collection is a solid introduction to the basic modes of logical argument in legal reasoning. (shrink)

The language of the propositional calculus is extended by two families of propositional probability operators, inductively applicable to the formulae, and the set of all formulae provable in an arbitrary superintuitionistic propositional logic is extended by the probability measure axioms concerning those probability operators. A logical system obtained in such a way, similar to a kind of polymodal logic, makes possible to express a probability measure of truthfulness of any formula. The paper contains a description of the Kripke-type possible (...) worlds semantics covering the considered logical systems, being followed by the corresponding completeness results. (shrink)

In this paper I want to discuss some basic problems of inductive logic, i.e. of the attempt to solve the problem of induction by means of a calculus of logical probability. I shall try to throw some light upon these problems by contrasting inductive logic, based on logical probability, and working with undefined samples of observations, with mathematical statistics, based on statistical probability, and working with representative random samples.

How does deductive logic constrain probability? This question is difficult for subjectivistic approaches, according to which probability is just strength of (prudent) partial belief, for this presumes logical omniscience. This paper proposes that the way in which probability lies always between possibility and necessity can be made precise by exploiting a minor theorem of de Finetti: In any finite set of propositions the expected number of truths is the sum of the probabilities over the set. This is generalized to apply (...) to denumerable languages. It entails that the sum of probabilities can neither exceed nor be exceeded by the cardinalities of all consistent and closed (within the set) subsets. In general any numerical function on sentences is said to be logically coherent if it satisfies this condition. Logical coherence allows the relativization of necessity: A function p on a language is coherent with respect to the concept T of necessity iff there is no set of sentences on which the sum of p exceeds or is exceeded by the cardinality of every T-consistent and T-closed (within the set) subset of the set. Coherence is easily applied as well to sets on which the sum of p does not converge. Probability should also be relativized by necessity: A T-probability assigns one to every T-necessary sentence and is additive over disjunctions of pairwise T-incompatible sentences. Logical T-coherence is then equivalent to T-probability: All and only T-coherent functions are T-probabilities. (shrink)

The aim of this paper is to present and discuss a probabilistic framework that is adequate for the formulation of quantum theory and faithful to its applications. Contrary to claims, which are examined and rebutted, that quantum theory employs a nonclassical probability theory based on a nonclassical "logic," the probabilistic framework set out here is entirely classical and the "logic" used is Boolean. The framework consists of a set of states and a set of quantities that are interrelated in a (...) specified manner. Each state induces a classical probability space on the values of each quantity. The quantities, so considered, become statistical variables (not random variables). Such variables need not have a "joint distribution." For the quantum theoretic application, there is a uniform procedure that defines and determines the existence of such "joint distributions" for statistical variables. A general rule is provided and it is shown to lead to the usual compatibility-commutivity requirements of quantum theory. The paper concludes with a brief discussion of interference and the misunderstandings that are involved in the false move from interference to nonclassical probability. (shrink)

This monograph offers a new foundation for information theory that is based on the notion of information-as-distinctions, being directly measured by logical entropy, and on the re-quantification as Shannon entropy, which is the fundamental concept for the theory of coding and communications. Information is based on distinctions, differences, distinguishability, and diversity. Information sets are defined that express the distinctions made by a partition, e.g., the inverse-image of a random variable so they represent the pre-probability notion of information. Then logical entropy (...) is a probability measure on the information sets, the probability that on two independent trials, a distinction or “dit” of the partition will be obtained. The formula for logical entropy is a new derivation of an old formula that goes back to the early twentieth century and has been re-derived many times in different contexts. As a probability measure, all the compound notions of joint, conditional, and mutual logical entropy are immediate. The Shannon entropy and its compound notions are then derived from a non-linear dit-to-bit transform that re-quantifies the distinctions of a random variable in terms of bits—so the Shannon entropy is the average number of binary distinctions or bits necessary to make all the distinctions of the random variable. And, using a linearization method, all the set concepts in this logical information theory naturally extend to vector spaces in general—and to Hilbert spaces in particular—for quantum logical information theory which provides the natural measure of the distinctions made in quantum measurement. Relatively short but dense in content, this work can be a reference to researchers and graduate students doing investigations in information theory, maximum entropy methods in physics, engineering, and statistics, and to all those with a special interest in a new approach to quantum information theory. (shrink)

Topics in Cognitive Science, Volume 14, Issue 3, Page 574-601, July 2022.

Otdvio Bueno, Empiricism, Mathematical Truth and Mathematical Knowledge 219 Commentary by Chuang Liu. Reply by Bueno. Chuang Liu, Coins and Electrons: A ...

We interpret the modal µ-calculus over a new model [10], to give a temporal logic suitable for systems exhibiting both probabilistic and demonic nondeterminism. The logical formulae are real-valued, and the statements are not limited to properties that hold with probability 1. In achieving that conceptual step, our technical contribution is to determine the correct quantitative generalisation of the Boolean operators: one that allows many of the standard Boolean-based temporal laws to carry over the reals with little or no structural (...) alteration, even for properties that hold with probability strictly between 0 and 1. The generalisation is not obvious, but is dictated by our discovery elsewhere of the algebraic property that characterises the next-time operator over the new model: it is arithmetic 'sublinearity' [20, Fig. 4 p. 342], which replaces the Boolean conjunctivity that characterises next-time in a modal algebra.We confirm by example that the new modal laws can be used for quantitative reasoning about probabilistic/demonic behavior. The random walk is treated using only those laws and real-number arithmetic: arguing from precise numeric premises, more specific than simply 'with some non-zero probability', we reach numeric conclusions that are not simply 'with probability 1'. (shrink)

This paper seeks to defend the following conclusions: The program advanced by Carnap and other necessarians for probability logic has little to recommend it except for one important point. Credal probability judgments ought to be adapted to changes in evidence or states of full belief in a principled manner in conformity with the inquirer’s confirmational commitments—except when the inquirer has good reason to modify his or her confirmational commitment. Probability logic ought to spell out the constraints on rationally coherent confirmational (...) commitments. In the case where credal judgments are numerically determinate confirmational commitments correspond to Carnap’s credibility functions mathematically represented by so—called confirmation functions. Serious investigation of the conditions under which confirmational commitments should be changed ought to be a prime target for critical reflection. The necessarians were mistaken in thinking that confirmational commitments are immune to legitimate modification altogether. But their personalist or subjectivist critics went too far in suggesting that we might dispense with confirmational commitments. There is room for serious reflection on conditions under which changes in confirmational commitments may be brought under critical control. Undertaking such reflection need not become embroiled in the anti inductivism that has characterized the work of Popper, Carnap and Jeffrey and narrowed the focus of students of logical and methodological issues pertaining to inquiry. (shrink)

This paper surveys the various forms of Deduction Theorem for a broad range of relevant logics. The logics range from the basic system B of Routley-Meyer through to the system R of relevant implication, and the forms of Deduction Theorem are characterized by the various formula representations of rules that are either unrestricted or restricted in certain ways. The formula representations cover the iterated form,A 1 .A 2 . ... .A n B, the conjunctive form,A 1&A 2 & (...) ...A n B, the combined conjunctive and iterated form, enthymematic version of these three forms, and the classical implicational form,A 1&A 2& ...A n B. The concept of general enthymeme is introduced and the Deduction Theorem is shown to apply for rules essentially derived using Modus Ponens and Adjunction only, with logics containing either (A B)&(B C) .A C orA B .B C .A C. (shrink)

Pondering the question of free will in the context of probability allows us to take a fresh look at a number of old problems. We are able to avoid deterministic entrapments and attempt to look at free will as an outcome of the entire decision-making system. In my paper, I will argue that free will should be considered in the context of a complex system of decisions, not individual cases. The proposed system will be probabilistic in character, so it will (...) be embedded in the calculus of probability. To achieve the stated goal, I will refer to two areas of Carnap’s interest: the relationship between free will and determinism, and the probability-based decision-making system. First, I will present Carnap’s compatibilist position. On this basis, I will show how free will can be examined on deterministic grounds. Then I will present Carnap’s probabilistic project—the so-called logical interpretation of probability. In addition to presenting its characteristics and functionality, I will argue for its usefulness in the context of decision analysis and its immunity to problems associated with determinism. Finally, I will show how the two mentioned elements can be combined, as a result of which I will present a concept for a probabilistic analysis of free will. In this context, I will identify free will with the individual characteristics of the system. My main aim is to present the theme of free will in the light of a formal analysis based on probability rather than metaphysical assumptions. (shrink)

THE INDICATIVE CONDITIONAL. A PROBABILISTIC CRITERION OF SOUNDNESS FOR DEDUCTIVE INFERENCES Our objective in this section is to establish a prima facie case ...