Skip to main content
SpringerLink
Log in

Extending Carnap’s Continuum to Binary Relations

  • Conference paper
Logic and Its Applications (ICLA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8923))

Included in the following conference series:

  • 784 Accesses

Abstract

We investigate a binary generalization of Carnap’s Continuum of Inductive Methods based on a version of Johnson’s Sufficientness Postulate for polyadic atoms and determine the probability functions that satisfy it.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goodman, N.: A Query on Confirmation. Journal of Philosophy 43, 383–385 (1946)

    Article  Google Scholar 

  2. Quine, W.V.O.: Two Dogmas of Empiricism. The Philosophical Review 60, 20–43 (1951)

    Article  Google Scholar 

  3. Carnap, R.: A Basic System of Inductive Logic. In: Carnap, R., Jeffrey, R.C. (eds.) Studies in Inductive Logic and Probability, vol. I, pp. 33–165. University of California Press (1971)

    Google Scholar 

  4. Carnap, R.: A Basic System of Inductive Logic, Part 2. In: Jeffrey, R.C. (ed.) Studies in Inductive Logic and Probability, vol. II, pp. 7–155. University of California Press (1980)

    Google Scholar 

  5. Paris, J.B.: Pure Inductive Logic Workshop Notes for ISLA (2014), http://www.maths.manchester.ac.uk/~jeff/lecture-notes/ISLA.pdf

  6. Paris, J.B., Vencovská, A.: Pure Inductive Logic. To appear in the series Perspectives in Mathematical Logic. CUP (2015)

    Google Scholar 

  7. Johnson, W.E.: Probability: The Deductive and Inductive Problems. Mind 41, 409–423 (1932)

    Article  Google Scholar 

  8. Landes, J., Paris, J.B., Vencovská, A.: A Characterization of the Language Invariant Families satisfying Spectrum Exchangeability in Polyadic Inductive Logic. Annals of Pure and Applied Logic 161, 800–811 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ronel, T., Vencovská, A.: The Principle of Binary Exchangeability (forthcoming)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, University of Manchester, Manchester, M13 9PL, UK

    Alena Vencovská

Authors
  1. Alena Vencovská
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Statistics, Indian Institute of Technology Kanpur, 208016, Kanpur, India

    Mohua Banerjee

  2. Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, 400076, Mumbai, India

    Shankara Narayanan Krishna

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vencovská, A. (2015). Extending Carnap’s Continuum to Binary Relations. In: Banerjee, M., Krishna, S.N. (eds) Logic and Its Applications. ICLA 2015. Lecture Notes in Computer Science, vol 8923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45824-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45824-2_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45823-5

  • Online ISBN: 978-3-662-45824-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation