Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Browse subjects
  3. Computer Science
  4. Programming Languages and Applied Logic
  5. Content listing

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

5646 results in Programming Languages and Applied Logic

Page 7 of 283

A Theory of Truth
  • Yannis Stephanou
  • Published online:
    07 October 2023
    Print publication:
    12 October 2023
  • How should we treat the liar and kindred paradoxes? A Theory of Truth argues that we should diverge from classical logic, and presents a new formal theory of truth. The theory does not incorporate contradictions and is not substructural, but deviates from classical logic significantly, and endorses principles like 'No sentence is both true and false' and 'No sentence is neither true nor false'. The book starts with an introduction to the paradoxes, suitable for newcomers to the subject, before presenting its approach. Four versions of the theory are covered, extending the theory to a determinacy operator and to a full first-order language with quantifiers. Each includes all Tarskian biconditionals that can be formulated in its language. The author uses original methods to prove the consistency of each version and compares the theory to alternative non-classical theories, including Field's paracomplete approach, Ripley's nontransitive system and Zardini's contraction-free calculus.

Page 7 of 283