Well Founded Justification Trees in Proof Theoretic Semantics applied to the Liar Paradox and the Halting Problem Input

Abstract

This paper explores how the proof theoretic notion of well founded justification trees resolves two of the most well-known instances of self-referential undecidability.

Other Versions

No versions found

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2026-04-27

Downloads
133 (#334,582)

6 months
133 (#102,491)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references