The Finite Values Property

Elizabeth Howarth; Jeffrey Paris

The Finite Values Property

Elizabeth Howarth, Jeffrey Paris

Research output: Chapter in Book/Conference proceeding › Chapter › peer-review

Abstract

We argue that the simplicity condition on a probability function on sentences of a predicate language L that it takes only finitely many values on the sentences of any finite sublanguage of L can be viewed as rational. We then go on to investigate consequences of this condition, linking it to the model theoretic notion of quantifier elimination.

Original language	English
Title of host publication	Computational Models of Rationality
Subtitle of host publication	Essays dedicated to Gabriele Kern-Isberner on the occasion of her 60th birthday
Editors	Christoph Beierle, Gerhard Brewka, Matthias Thimm
Publisher	College Publications
Pages	316-331
Number of pages	16
ISBN (Print)	978-1-84890-198-8
Publication status	Published - 2016

Keywords

Inductive logic; Logical probability; Rationality; Uncertain reasoning

Cite this

@inbook{ae5f77cccbfb401b852cba06e86e46d6,

title = "The Finite Values Property",

abstract = "We argue that the simplicity condition on a probability function on sentences of a predicate language L that it takes only finitely many values on the sentences of any finite sublanguage of L can be viewed as rational. We then go on to investigate consequences of this condition, linking it to the model theoretic notion of quantifier elimination.",

keywords = "Inductive logic; Logical probability; Rationality; Uncertain reasoning",

author = "Elizabeth Howarth and Jeffrey Paris",

year = "2016",

language = "English",

isbn = "978-1-84890-198-8",

pages = "316--331",

editor = "Christoph Beierle and Gerhard Brewka and Matthias Thimm",

booktitle = "Computational Models of Rationality",

publisher = "College Publications",

address = "United Kingdom",

}

TY - CHAP

T1 - The Finite Values Property

AU - Howarth, Elizabeth

AU - Paris, Jeffrey

PY - 2016

Y1 - 2016

N2 - We argue that the simplicity condition on a probability function on sentences of a predicate language L that it takes only finitely many values on the sentences of any finite sublanguage of L can be viewed as rational. We then go on to investigate consequences of this condition, linking it to the model theoretic notion of quantifier elimination.

AB - We argue that the simplicity condition on a probability function on sentences of a predicate language L that it takes only finitely many values on the sentences of any finite sublanguage of L can be viewed as rational. We then go on to investigate consequences of this condition, linking it to the model theoretic notion of quantifier elimination.

KW - Inductive logic; Logical probability; Rationality; Uncertain reasoning

UR - http://dblp.uni-trier.de/db/conf/birthday/kern2016.html

M3 - Chapter

SN - 978-1-84890-198-8

SP - 316

EP - 331

BT - Computational Models of Rationality

A2 - Beierle, Christoph

A2 - Brewka, Gerhard

A2 - Thimm, Matthias

PB - College Publications

ER -

The Finite Values Property

Abstract

Keywords

Other files and links

Fingerprint

Cite this