David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Philosophical Logic 28 (3):223-234 (1999)
Provided here is a characterisation of absolute probability functions for intuitionistic (propositional) logic L, i.e. a set of constraints on the unary functions P from the statements of L to the reals, which insures that (i) if a statement A of L is provable in L, then P(A) = 1 for every P, L's axiomatisation being thus sound in the probabilistic sense, and (ii) if P(A) = 1 for every P, then A is provable in L, L's axiomatisation being thus complete in the probabilistic sense. As there are theorems of classical (propositional) logic that are not intuitionistic ones, there are unary probability functions for intuitionistic logic that are not classical ones. Provided here because of this is a means of singling out the classical probability functions from among the intuitionistic ones
|Keywords||intuitionistic logic probability functions probability semantics|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Tomasz Połacik (1994). Second Order Propositional Operators Over Cantor Space. Studia Logica 53 (1):93 - 105.
Morten H. Sørensen & Paweł Urzyczyn (2010). A Syntactic Embedding of Predicate Logic Into Second-Order Propositional Logic. Notre Dame Journal of Formal Logic 51 (4):457-473.
Hugues Leblanc & Peter Roeper (1989). On Relativizing Kolmogorov's Absolute Probability Functions. Notre Dame Journal of Formal Logic 30 (4):485-512.
Zlatan Damnjanovic (1995). Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis. Journal of Symbolic Logic 60 (4):1208-1241.
Hugues Leblanc & Peter Roeper (1992). Probability Functions: The Matter of Their Recursive Definability. Philosophy of Science 59 (3):372-388.
Peter W. O'Hearn & David J. Pym (1999). The Logic of Bunched Implications. Bulletin of Symbolic Logic 5 (2):215-244.
A. D. Yashin (1999). Irreflexive Modality in the Intuitionistic Propositional Logic and Novikov Completeness. Journal of Philosophical Logic 28 (2):175-197.
Philip Kremer (1997). On the Complexity of Propositional Quantification in Intuitionistic Logic. Journal of Symbolic Logic 62 (2):529-544.
Brian Weatherson (2003). From Classical to Intuitionistic Probability. Notre Dame Journal of Formal Logic 44 (2):111-123.
Added to index2009-01-28
Total downloads11 ( #143,992 of 1,101,879 )
Recent downloads (6 months)5 ( #68,243 of 1,101,879 )
How can I increase my downloads?