Switch to: Citations

Add references

You must login to add references.
  1. A treatise on probability.John Maynard Keynes - 1921 - Mineola, N.Y.: Dover Publications.
    With this treatise, an insightful exploration of the probabilistic connection between philosophy and the history of science, the famous economist breathed new life into studies of both disciplines. Originally published in 1921, this important mathematical work represented a significant contribution to the theory regarding the logical probability of propositions. Keynes effectively dismantled the classical theory of probability, launching what has since been termed the “logical-relationist” theory. In so doing, he explored the logical relationships between classifying a proposition as “highly probable” (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   383 citations  
  • Introduction to mathematical logic..Alonzo Church - 1944 - Princeton,: Princeton university press: London, H. Milford, Oxford university press. Edited by C. Truesdell.
    This book is intended to be used as a textbook by students of mathematics, and also within limitations as a reference work.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   226 citations  
  • The foundations of philosophical semantics.John L. Pollock - 1984 - Princeton University Press. Edited by Lloyd Humberstone.
    Princeton University Press, 984. This book is out of print, but can be downloaded as a pdf file (3.9 MB).
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   38 citations  
  • Deductive program verification (a practitioner's commentary).David A. Nelson - 1992 - Minds and Machines 2 (3):283-307.
    A proof of ‘correctness’ for a mathematical algorithm cannot be relevant to executions of a program based on that algorithm because both the algorithm and the proof are based on assumptions that do not hold for computations carried out by real-world computers. Thus, proving the ‘correctness’ of an algorithm cannot establish the trustworthiness of programs based on that algorithm. Despite the (deceptive) sameness of the notations used to represent them, the transformation of an algorithm into an executable program is a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  • Principles of the Theory of Probability. [REVIEW]H. T. C. - 1939 - Journal of Philosophy 36 (6):163-165.
  • An analysis of first-order logics of probability.Joseph Y. Halpern - 1990 - Artificial Intelligence 46 (3):311-350.
  • Philosophical aspects of program verification.James H. Fetzer - 1991 - Minds and Machines 1 (2):197-216.
    A debate over the theoretical capabilities of formal methods in computer science has raged for more than two years now. The function of this paper is to summarize the key elements of this debate and to respond to important criticisms others have advanced by placing these issues within a broader context of philosophical considerations about the nature of hardware and of software and about the kinds of knowledge that we have the capacity to acquire concerning their performance.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • The Logical Foundations of Probability. [REVIEW]Rudolf Carnap - 1950 - Journal of Philosophy 60 (13):362-364.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   492 citations  
  • A Computational Logic Handbook.Robert S. Boyer & J. Strother Moore - 1988
  • A Mathematical Theory of Evidence.Glenn Shafer - 1976 - Princeton University Press.
    Degrees of belief; Dempster's rule of combination; Simple and separable support functions; The weights of evidence; Compatible frames of discernment; Support functions; The discernment of evidence; Quasi support functions; Consonance; Statistical evidence; The dual nature of probable reasoning.
    Direct download  
     
    Export citation  
     
    Bookmark   250 citations  
  • Program verification: the very idea.James H. Fetzer - 1988 - Communications of the Acm 31 (9):1048--1063.
    The notion of program verification appears to trade upon an equivocation. Algorithms, as logical structures, are appropriate subjects for deductive verification. Programs, as causal models of those structures, are not. The success of program verification as a generally applicable and completely reliable method for guaranteeing program performance is not even a theoretical possibility.
    Direct download  
     
    Export citation  
     
    Bookmark   43 citations  
  • A Treatise on Probability.J. M. Keynes - 1989 - British Journal for the Philosophy of Science 40 (2):219-222.
     
    Export citation  
     
    Bookmark   294 citations  
  • A treatise on probability.J. Keynes - 1924 - Revue de Métaphysique et de Morale 31 (1):11-12.
    No categories
     
    Export citation  
     
    Bookmark   287 citations