Correction to: Deduction and definability in infinite statistical systems

Synthese 197 (12):5539-5540 (2018)
  Copy   BIBTEX

Abstract

Prop. 1 on p. 10 is false as stated. The proof implicitly assumes that all Cauchy sequences.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 106,148

External links

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

Through your library

Similar books and articles

A game‐theoretic proof of analytic Ramsey theorem.Kazuyuki Tanaka - 1992 - Mathematical Logic Quarterly 38 (1):301-304.
Variations on the Liar's Paradox.Joseph Agassi - 1964 - Studia Logica 15 (1):237-238.
Implicit Definability in Arithmetic.Stephen G. Simpson - 2016 - Notre Dame Journal of Formal Logic 57 (3):329-339.
On the Existence of Strong Proof Complexity Generators.Jan Krajíček - 2024 - Bulletin of Symbolic Logic 30 (1):20-40.
On the Cauchy completeness of the constructive Cauchy reals.Robert S. Lubarsky - 2007 - Mathematical Logic Quarterly 53 (4‐5):396-414.

Analytics

Added to PP
2018-11-03

Downloads
32 (#786,288)

6 months
9 (#445,052)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Benjamin Feintzeig
University of Washington

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references