Probabilities over rich languages, testing and randomness
From MaRDI portal
Publication:3966829
DOI10.2307/2273587zbMath0501.60006OpenAlexW2105420605MaRDI QIDQ3966829
Publication date: 1982
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273587
Foundations and philosophical topics in statistics (62A01) Foundations of probability theory (60A99) Decidability of theories and sets of sentences (03B25)
Related Items
Distention for Sets of Probabilities ⋮ Jeffrey meets Kolmogorov. A general theory of conditioning ⋮ On fairness and randomness ⋮ Keynes's coefficient of dependence revisited ⋮ MERGING OF OPINIONS AND PROBABILITY KINEMATICS ⋮ ON THE TRUTH-CONVERGENCE OF OPEN-MINDED BAYESIANISM ⋮ Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence ⋮ Can logic be combined with probability? Probably ⋮ Statistics between inductive logic and empirical science ⋮ First-order classical modal logic ⋮ Logic and probabilistic systems ⋮ Deceptive updating and minimal information methods ⋮ Logical perspectives on the foundations of probability ⋮ Bayesian stopping ⋮ Do stronger definitions of randomness exist? ⋮ Tracking probabilistic truths: a logic for statistical learning ⋮ A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS ⋮ Elusive Counterfactuals ⋮ Probabilistic opinion pooling with imprecise probabilities ⋮ How uncertain do we need to be? ⋮ Unnamed Item ⋮ Boolean algebras of conditionals, probability and logic ⋮ Unnamed Item ⋮ The sure thing principle, dilations, and objective probabilities ⋮ Probabilities on sentences in an expressive logic ⋮ Probability and logic. ⋮ Assessing theories, Bayes style ⋮ Fitch's paradox and probabilistic antirealism ⋮ Assessing theories: the coherentist approach ⋮ Finitistic and frequentistic approximation of probability measures with or without \(\sigma\)-additivity ⋮ A note on binary inductive logic ⋮ A geometric principle of indifference ⋮ A Survey of First-Order Probabilistic Models ⋮ On the role of explanatory and systematic power in scientific reasoning ⋮ ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS ⋮ Quasi-miracles, typicality, and counterfactuals ⋮ A practical measure of the information in a logical theory ⋮ The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws ⋮ The objectivity of subjective Bayesianism ⋮ Learning and pooling, pooling and learning ⋮ PURE INDUCTIVE LOGIC WITH FUNCTIONS ⋮ Some aspects of polyadic inductive logic ⋮ Calibrating Randomness ⋮ Belief revision in the service of scientific discovery ⋮ ON THE STRUCTURE OF PROBABILITY FUNCTIONS IN THE NATURAL WORLD ⋮ A logic for inductive probabilistic reasoning ⋮ Identifying randomness given by high descriptive complexity
Cites Work
