The axiomatization of randomness
From MaRDI portal
axiomatization of von Mises' notion of a random sequenceindependence relationquantifier elimination theorem for Friedman's ``almost all quantifier
Quantifier elimination, model completeness, and related topics (03C10) Models of other mathematical theories (03C65) Logic with extra quantifiers and operators (03C80) Nonclassical models (Boolean-valued, sheaf, etc.) (03C90) Second- and higher-order arithmetic and fragments (03F35) Other constructive mathematics (03F65) Foundations of probability theory (60A99)
Recommendations
Cites work
Cited in
(49)- Mathematical metaphysics of randomness
- von Neumann standard quantum mechanics is logically inconsistent
- Schnorr randomness for noncomputable measures
- Conditional probabilities and van Lambalgen's theorem revisited
- On the uniform computational content of computability theory
- Two more characterizations of \(K\)-triviality
- On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic
- A universal pair of 1/2-betting strategies
- A Church-Turing thesis for randomness?
- Typicality à la Russell in set theory
- Trivial measures are not so trivial
- Weakly represented families in reverse mathematics
- Asymptotic density, immunity and randomness
- Closure of resource-bounded randomness notions under polynomial-time permutations
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Randomness and Computability: Open Questions
- Calibrating Randomness
- On initial segment complexity and degrees of randomness
- COMPLEXITY, INFORMATION, ENERGY
- Algorithmically Independent Sequences
- Independence, randomness and the axiom of choice
- scientific article; zbMATH DE number 512574 (Why is no real title available?)
- scientific article; zbMATH DE number 1984528 (Why is no real title available?)
- Characterizing the strongly jump-traceable sets via randomness
- Selection by recursively enumerable sets
- The weakness of being cohesive, thin or free in reverse mathematics
- Intermediate intrinsic density and randomness
- The Intersection of Algorithmically Random Closed Sets and Effective Dimension
- scientific article; zbMATH DE number 3894839 (Why is no real title available?)
- Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness
- Independence in randomizations
- Open questions about Ramsey-type statements in reverse mathematics
- Density-1-bounding and quasiminimality in the generic degrees
- On Russell typicality in set theory
- Agreement reducibility
- Russell's typicality as another randomness notion
- Extraction rates of random continuous functionals
- Oscillation in the initial segment complexity of random reals
- Probabilistic issues in statistical mechanics
- Models and the dynamics of theory-building in physics. I: Modeling strategies
- Pathwise-randomness and models of second-order arithmetic
- Martin-Löf reducibility and cost functions
- On relative randomness
- Complexity of inversion of functions on the reals
- Computable one-way functions on the reals
- Some more results on relativized Chaitin's
- Kolmogorov-Loveland betting strategies lose the betting game on open sets
- On fairness and randomness
- Algorithmically independent sequences
This page was built for publication: The axiomatization of randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202179)
