The Finite Values Property

Elizabeth Howarth, Jeffrey Paris

    Research output: Chapter in Book/Report/Conference proceedingChapterpeer-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 languageEnglish
    Title of host publicationComputational Models of Rationality
    Subtitle of host publicationEssays dedicated to Gabriele Kern-Isberner on the occasion of her 60th birthday
    EditorsChristoph Beierle, Gerhard Brewka, Matthias Thimm
    PublisherCollege Publications
    Pages316-331
    Number of pages16
    ISBN (Print)978-1-84890-198-8
    Publication statusPublished - 2016

    Keywords

    • Inductive logic; Logical probability; Rationality; Uncertain reasoning

    Fingerprint

    Dive into the research topics of 'The Finite Values Property'. Together they form a unique fingerprint.

    Cite this