2000 character limit reached
Truth and the liar paradox
Published 28 Dec 2011 in math.HO and math.LO | (1112.6127v1)
Abstract: We analyze the informal notion of truth and conclude that it can be formalized in essentially two distinct ways: constructively, in terms of provability, or classically, as a hierarchy of concepts which satisfy Tarski's biconditional in limited settings. This leads to a complete resolution of the liar paradox.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.