Translator Disclaimer
Winter 1995 Computing Verisimilitude
Chris Brink, Katarina Britz
Notre Dame J. Formal Logic 36(1): 30-43 (Winter 1995). DOI: 10.1305/ndjfl/1040308827

Abstract

This paper continues the power ordering approach to verisimilitude. We define a parameterized verisimilar ordering of theories in the finite propositional case, both semantically and syntactically. The syntactic definition leads to an algorithm for computing verisimilitude. Since the power ordering approach to verisimilitude can be translated into a standard notion of belief revision, the algorithm thereby also allows the computation of membership of a belief-revised theory.

Citation

Download Citation

Chris Brink. Katarina Britz. "Computing Verisimilitude." Notre Dame J. Formal Logic 36 (1) 30 - 43, Winter 1995. https://doi.org/10.1305/ndjfl/1040308827

Information

Published: Winter 1995
First available in Project Euclid: 19 December 2002

zbMATH: 0837.03009
MathSciNet: MR1359106
Digital Object Identifier: 10.1305/ndjfl/1040308827

Subjects:
Primary: 03B60
Secondary: 68T27

Rights: Copyright © 1995 University of Notre Dame

JOURNAL ARTICLE
14 PAGES


SHARE
Vol.36 • No. 1 • Winter 1995
Back to Top