Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-10T15:06:06.485Z Has data issue: false hasContentIssue false
  • English
  • Français

MANY-VALUED LOGIC OF INFORMAL PROVABILITY: A NON-DETERMINISTIC STRATEGY

Published online by Cambridge University Press:  13 June 2018

PAWEL PAWLOWSKI  and
RAFAL URBANIAK
PAWEL PAWLOWSKI*
Affiliation:
Centre for Logic and Philosophy of Science, Ghent University
RAFAL URBANIAK*
Affiliation:
Centre for Logic and Philosophy of Science, Ghent University and Institute of Philosophy, Sociology and Journalism, University of Gdansk
*
*CENTRE FOR LOGIC AND PHILOSOPHY OF SCIENCE GHENT UNIVERSITY GHENT, BELGIUM E-mail: haptism89@gmail.com
†CENTRE FOR LOGIC AND PHILOSOPHY OF SCIENCE GHENT UNIVERSITY GHENT, BELGIUM and INSTITUTE OF PHILOSOPHY, SOCIOLOGY AND JOURNALISM UNIVERSITY OF GDANSK GDANSK, POLAND E-mail: rfl.urbaniak@gmail.com
Get access Rights & Permissions [Opens in a new window]

Abstract

Mathematicians prove theorems in a semi-formal setting, providing what we’ll call informal proofs. There are various philosophical reasons not to reduce informal provability to formal provability within some appropriate axiomatic theory (Leitgeb, 2009; Marfori, 2010; Tanswell, 2015), but the main worry is that we seem committed to all instances of the so-called reflection schema: B(φ) → φ (where B stands for the informal provability predicate). Yet, adding all its instances to any theory for which Löb’s theorem for B holds leads to inconsistency.

Currently existing approaches (Shapiro, 1985; Horsten, 1996, 1998) to formalizing the properties of informal provability avoid contradiction at a rather high price. They either drop one of the Hilbert-Bernays conditions for the provability predicate, or use a provability operator that cannot consistently be treated as a predicate.

Inspired by (Kripke, 1975), we investigate the strategy which changes the underlying logic and treats informal provability as a partial notion. We use non-deterministic matrices to develop a three-valued logic of informal provability, which avoids some of the above mentioned problems.

Keywords

03A0500A30informal provabilitymany-valued logicnon-deterministic semanticsLöb’s theoremparadoxes of provability
Type
Research Article
Information
The Review of Symbolic Logic , Volume 11 , Issue 2 , June 2018 , pp. 207 - 223
Copyright
Copyright © Association for Symbolic Logic 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

BIBLIOGRAPHY

Avron & Zamanski (2011). Non-deterministic semantics for logical systems. In Gabbay, D., and Guenthner, F., editors. Handbook of Philosophical Logic, Vol. 16. Netherlands: Springer, pp. 227–304.Google Scholar
Batens, D. & Clercq, K. (2004). A rich paraconsistent extension of full positive logic. Logique Et Analyse, 47, 227–257.Google Scholar
Beall, J. (1999). Prom full blooded platonism to really full blooded platonism. Philosophia Mathematica, 7(3), 322–325.CrossRefGoogle Scholar
Boolos, G. (1993). The Logic of Provability. Cambridge: Cambridge University Press.Google Scholar
Coniglio, M. E., Fariñas del Cerro, L., & Peron, N. M. (2015). Finite non-deterministic semantics for some modal systems. Journal of Applied Non-Classical Logics, 25(1), 20–45.CrossRefGoogle Scholar
Horsten, L. (1996). Reflecting in epistemic arithemtic. The Journal of Symbolic Logic, 61, 788–801.CrossRefGoogle Scholar
Horsten, L. (1998). In defence of epistemic arithmetic. Synthese, 116, 1–25.CrossRefGoogle Scholar
Horsten, L. (2002). An axiomatic investigation of provability as a primitive predicate. In Halbach, V., and Horsten, L., editors. Principles of Truth. Hansel-Hohenhausen: Walter de Gruyter, pp. 203–220.Google Scholar
Kripke, S. A. (1975). Outline of a theory of truth. Journal of Philosophy, 72(19), 690–716.CrossRefGoogle Scholar
Leitgeb, H. (2009). On formal and informal provability. In Bueno, O., and Linnebo, Ø, editors. New Waves in Philosophy of Mathematics. New York: Palgrave Macmillan, pp. 263–299.CrossRefGoogle Scholar
Marfori, M. A. (2010). Informal proofs and mathematical rigour. Studia Logica, 96, 261–272.CrossRefGoogle Scholar
Priest, G. (1987). In Contradiction: A Study of the Transconsistent. Oxford: Oxford University Press.CrossRefGoogle Scholar
Shapiro, S. (1985). Epistemic and intuitionistic arithmetic. In Shapiro, S., editor. Intensional Mathematics. Amsterdam: North Holland, pp. 11–46.CrossRefGoogle Scholar
Tanswell, F. (2015). A problem with the dependence of informal proofs on formal proofs. Philosophia Mathematica, 23(3), 295–310.CrossRefGoogle Scholar