Skip to main content Accessibility help
×
×
Home

THE THEORY OF SPECTRUM EXCHANGEABILITY

  • E. HOWARTH (a1) and J. B. PARIS (a1)

Abstract

Spectrum Exchangeability, Sx, is an irrelevance principle of Pure Inductive Logic, and arguably the most natural (but not the only) extension of Atom Exchangeability to polyadic languages. It has been shown1 that all probability functions which satisfy Sx are comprised of a mixture of two essential types of probability functions; heterogeneous and homogeneous functions. We determine the theory of Spectrum Exchangeability, which for a fixed language L is the set of sentences of L which must be assigned probability 1 by every probability function satisfying Sx, by examining separately the theories of heterogeneity and homogeneity. We find that the theory of Sx is equal to the theory of finite structures, i.e., those sentences true in all finite structures for L, and it emerges that Sx is inconsistent with the principle of Super-Regularity (Universal Certainty). As a further consequence we are able to characterize those probability functions which satisfy Sx and the Finite Values Property.

Copyright

Corresponding author

*SCHOOL OF MATHEMATICS, THE UNIVERSITY OF MANCHESTER MANCHESTER M13 9PL, UNITED KINGDOM E-mail:lizhowarth@outlook.com, jeff.paris@manchester.ac.uk

References

Hide All
Carnap, R. (1980). A Basic system of inductive logic. In Jeffrey, R. C., editor. Studies in Inductive Logic and Probability, Volume II, California: University of California Press, pp. 7155.
de Finetti, B. (1974). Theory of Probability, Volume 1. New York: Wiley.
Fagin, R. (1976). Probabilities on finite models. Journal of Symbolic Logic, 41(1), 5058.
Gaifman, H. (1964). Concerning measures on first order calculi. Israel Journal of Mathematics, 2, 118.
Howarth, E. (Forthcoming). New rationality principles in pure inductive logic. PhD Thesis, University of Manchester. To appear athttp://www.maths.manchester.ac.uk/∼jeff/.
Landes, J. (2009). The principle of spectrum exchangeability within inductive logic. PhD Thesis, University of Manchester. Available from: http://www.maths.manchester.ac.uk/∼jeff/.
Landes, J., Paris, J. B., & Vencovská, A. (2008). Some aspects of polyadic inductive logic. Studia Logica, 90, 316.
Landes, J., Paris, J. B., & Vencovská, A. (2009). Representation theorems for probability functions satisfying spectrum exchangeability in inductive logic, International Journal of Approximate Reasoning, 51(1), 3555.
Nix, C. J. (2005). Probabilistic induction in the predicate calculus. PhD Thesis, University of Manchester, UK. Available from: http://www.maths.manchester.ac.uk/∼jeff/.
Nix, C. J., & Paris, J. B. (2007). A note on binary inductive logic. Journal of Philosophical Logic, 36(6), 735771.
Paris, J. B. (1994). The Uncertain Reasoner’s Companion. Cambridge: Cambridge University Press.
Paris, J. B. (2011). Pure inductive logic. In Horsten, L., & Pettigrew, R., editors. The Continuum Companion to Philosophical Logic, London: Continuum International Publishing Group, pp. 428449.
Paris, J. B., & Rad, S. R. (2010). A note on the least informative model of a theory. In Ferreira, F., Löwe, B., Mayordomo, E., & Gomes, L. M., editors. Programs, Proofs, Processes, CiE 2010, LNCS 6158, Berlin: Springer, pp. 342351.
Paris, J. B., & Vencovská, A. (2011). From unary to binary inductive logic. In van Bentham, J., Gupta, A., & Pacuit, E., editors. Games, Norms and Reasons – Logic at the Crossroads, Synthese Library 353, Berlin: Springer, pp. 199212.
Paris, J. B., & Vencovská, A. (To appear). Pure Inductive Logic. Perspectives in Mathematical Logic, The Association of Symbolic Logic Series. Cambridge: Cambridge University Press.
Trakhtenbrot, B. (1950). The impossibility of an algorithm for the decidability problem on finite classes. Proceedings of the USSR Academy of Sciences (in Russian), 70(4), 569572. [English translation in AMS Translations, Series 2, 23(1–6), 1963.]
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Review of Symbolic Logic
  • ISSN: 1755-0203
  • EISSN: 1755-0211
  • URL: /core/journals/review-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed