We introduce a probabilistic extension of propositional intuitionistic logic. The logic allows making statements such as P≥sα, with the intended meaning “the probability of truthfulness of α is at least s”. We describe the corresponding class of models, which are Kripke models with a naturally arising notion of probability, and give a sound and complete infinitary axiomatic system. We prove that the logic is decidable.

Since in Heyting Arithmetic all atomic formulas are decidable, a Kripke model for HA may be regarded classically as a collection of classical structures for the language of arithmetic, partially ordered by the submodel relation. The obvious question is then: are these classical structures models of Peano Arithmetic ? And dually: if a collection of models of PA, partially ordered by the submodel relation, is regarded as a Kripke model, is it a model of HA? Some partial answers to these (...) questions were obtained in [6], [3], [1] and [2]. Here we present some results in the same direction, announced in [7]. In particular, it is proved that the classical structures at the nodes of a Kripke model of HA must be models of IΔ1 and that the relation between these classical structures must be that of a Δ1-elementary submodel. MSC: 03F30, 03F55. (shrink)

Carnap's Inductive Logic, like most philosophical discussions of induction, is designed for the case of independent trials. To take account of periodicities, and more generally of order, the account must be extended. From both a physical and a probabilistic point of view, the first and fundamental step is to extend Carnap's inductive logic to the case of finite Markov chains. Kuipers (1988) and Martin (1967) suggest a natural way in which this can be done. The probabilistic character (...) of Carnapian inductive logic(s) for Markov chains and their relationship to Carnap's inductive logic(s) is discussed at various levels of Bayesian analysis. (shrink)

Logic has a fundamental role in the philosophy of Franjo Marković (1845-1914). His theory of concepts and reasoning is analyzed, especially with respect to the essential role of the principle of sufficient reason and in connection with the concept of causality. The interplay of various types of evidence in Marković's inductive-deductive logic is analysed by means of contemporary justification logic tools.

We consider HA*, that is Heyting's Arithmetic extended with transfinite induction over all recursive well orderings, which may be viewed as defining constructive truth, since PA* agrees with classical truth. We prove that Markov's Principle, as a schema, is not provable in HA*, but that HA* is closed under Markov's Rule.

We systematically study several principles and give a principle which is weaker than disjunctive Markov’s principle. We also show that the principle is underivable and strictly weaker than MP∨ in certain extensions of the system EL of elementary analysis.

Recent discussions in the philosophy of science have devoted considerable attention to the analysis of conceptual issues relating to the methodology of explanation and prediction in the sciences. Part of this literature has been devoted to clarifying the very ideas of explanation and prediction. But the discussion has also ranged over various related topics, including the status of laws to be used for explanatory and predictive purposes, the logical interrelationships between explanatory and predictive reasonings, the differences in the strategy of (...) explanatory argumentation in different branches of science, the nature and possibility of teleological explanation, etc. The aim of the present article is to examine the issues involved in such questions from the specialized perspective afforded by one particular kind of physical systems--namely, systems, here to be characterized as discrete state systems, whose behavior has been studied extensively in the scientific literature under the general heading of Markov chains. These systems have been chosen as our focus because their behavior over time can be analyzed at once with great ease and with extraordinary precision. (shrink)

The paper examines Andrei A. Markov’s critical attitude towards L.E.J. Brouwer’s intuitionism, as is expressed in his endnotes to the Russian translation of Heyting’s Intuitionism, published in Moscow in 1965. It is argued that Markov’s algorithmic approach was shaped under the impact of the mathematical style and values prevailing in the Petersburg mathematical school, which is characterized by the proclaimed primacy of applications and the search for rigor and effective solutions.

We show that the so-called weak Markov's principle which states that every pseudo-positive real number is positive is underivable in [MATHEMATICAL SCRIPT CAPITAL T]ω ≔ E-HAω + AC. Since [MATHEMATICAL SCRIPT CAPITAL T]ω allows one to formalize Bishop's constructive mathematics, this makes it unlikely that WMP can be proved within the framework of Bishop-style mathematics . The underivability even holds if the ine.ective schema of full comprehension for negated formulas is added, which allows one to derive the law of (...) excluded middle for such formulas. (shrink)

A brief overview of the main Croatian philosophers of the 19th century is given (regardless of whether they worked in or outside of Croatia). Special attention is paid to Šimun Čučić (logic, metaphysics, ethics) and Franjo pl. Marković (logic, aesthetics). The philosophy of other authors is briefly summarized on the ground of the existing research results.

In 1957, Gödel proved that completeness for intuitionistic predicate logic HPL implies forms of Markov's Principle, MP. The result first appeared, with Kreisel's refinements and elaborations, in Kreisel. Featuring large in the Gödel-Kreisel proofs are applications of the axiom of dependent choice, DC. Also in play is a form of Herbrand's Theorem, one allowing a reduction of HPL derivations for negated prenex formulae to derivations of negations of conjunctions of suitable instances. First, we here show how to deduce (...) Gödel's results by alternative means, ones arguably more elementary than those of Kreisel. We avoid DC and Herbrand's Theorem by marshalling simple facts about negative translations and Markov's Rule. Second, the theorems of Gödel and Kreisel are commonly interpreted as demonstrating the unprovability of completeness for HPL, if means of proof are confined within strictly intuitionistic metamathematics. In the closing section, we assay some doubts about such interpretations. (shrink)

There exist two notions of equivalence of behavior between states of a Labelled Markov Process (LMP): state bisimilarity and event bisimilarity. The first one can be considered as an appropriate generalization to continuous spaces of Larsen and Skou’s probabilistic bisimilarity, whereas the second one is characterized by a natural logic. C. Zhou expressed state bisimilarity as the greatest fixed point of an operator that there is such a process with an uncountable Zhou ordinal.