The axiomatization of randomness

Journal of Symbolic Logic 55 (3):1143-1167 (1990)
  Copy   BIBTEX

Abstract

We present a faithful axiomatization of von Mises' notion of a random sequence, using an abstract independence relation. A byproduct is a quantifier elimination theorem for Friedman's "almost all" quantifier in terms of this independence relation

Categories

Keywords

Reprint years

DOI

10.2307/2274480

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Michiel van Lambalgen. Independence, randomness and the axiom of choice. The journal of symbolic logic, vol. 57 , pp. 1274–1304.John C. Simms - 1994 - Journal of Symbolic Logic 59 (4):1433-1434.
Completeness and interpolation of almost‐everywhere quantification over finitely additive measures.João Rasga, Wafik Boulos Lotfallah & Cristina Sernadas - 2013 - Mathematical Logic Quarterly 59 (4-5):286-302.
Rules, Regularities, Randomness. Festschrift for Michiel van Lambalgen.Keith Stenning & Martin Stokhof (eds.) - 2022 - Amsterdam, The Netherlands: Institute for Logic, Language and Computation.
An axiomatization of the logic with the rough quantifier.Michał Krynicki & Hans-Peter Tuschik - 1991 - Journal of Symbolic Logic 56 (2):608-617.
0-D-Valued Fields.Nicolas Guzy - 2006 - Journal of Symbolic Logic 71 (2):639 - 660.
Quantifier elimination for neocompact sets.H. Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.
A simple treatment of truth functions.Alan Ross Anderson & Nuel D. Belnap - 1959 - Journal of Symbolic Logic 24 (4):301-302.
Quantifier elimination in valued Ore modules.Luc Bélair & Françoise Point - 2010 - Journal of Symbolic Logic 75 (3):1007-1034.
Dichotomy result for independence-friendly prefixes of generalized quantifiers.Merlijn Sevenster - 2014 - Journal of Symbolic Logic 79 (4):1224-1246.
Some remarks on indiscernible sequences.Enrique Casanovas - 2003 - Mathematical Logic Quarterly 49 (5):475-478.

Analytics

Added to PP
2009-01-28

Downloads
64 (#332,081)

6 months
6 (#866,322)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Michiel Van Lambalgen
University of Amsterdam

Citations of this work

Representation and Invariance of Scientific Structures.Patrick Suppes - 2002 - CSLI Publications (distributed by Chicago University Press).
Calibrating randomness.Rod Downey, Denis R. Hirschfeldt, André Nies & Sebastiaan A. Terwijn - 2006 - Bulletin of Symbolic Logic 12 (3):411-491.
Randomness and computability: Open questions.Joseph S. Miller & André Nies - 2006 - Bulletin of Symbolic Logic 12 (3):390-410.
The K -Degrees, Low for K Degrees,and Weakly Low for K Sets.Joseph S. Miller - 2009 - Notre Dame Journal of Formal Logic 50 (4):381-391.

View all 18 citations / Add more citations

References found in this work

Boolean-Valued Models and Independence Proofs in Set Theory.J. L. Bell & Dana Scott - 1986 - Journal of Symbolic Logic 51 (4):1076-1077.
Natural deduction and arbitrary objects.Kit Fine - 1985 - Journal of Philosophical Logic 14 (1):57 - 107.
Forcing and generalized quantifiers.J. Krivine - 1973 - Annals of Mathematical Logic 5 (3):199.

Add more references