Embedding Classical Logic in S4

Dissertation, Munich Center for Mathematical Philosophy (Mcmp), Lmu Munich (2019)
  Copy   BIBTEX

Abstract

In this thesis, we will study the embedding of classical first-order logic in first-order S4, which is based on the translation originally introduced in Fitting (1970). The initial main part is dedicated to a detailed model-theoretic proof of the soundness of the embedding. This will follow the proof sketch in Fitting (1970). We will then outline a proof procedure for a proof-theoretic replication of the soundness result. Afterwards, a potential proof of faithfulness of the embedding, read in terms of soundness and completeness, will be discussed. We will particularly highlight the many difficulties coming with it. In the final section, we will relate this discussion to the debate on notational variance in French (2019). We will do this by showing how a weaker version of French's notion of ‘expressive equivalence’ conforms to the model-theoretic soundness result. We will then conclude that the soundness result without completeness might contain rather little overall insight by relating it to the extensibility of classical logic to S4.

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

Similar books and articles

Some Embedding Theorems for Conditional Logic.Ming Xu - 2006 - Journal of Philosophical Logic 35 (6):599-619.
Cut-Elimination for Quantified Conditional Logic.Christoph Benzmüller - 2017 - Journal of Philosophical Logic 46 (3):333-353.
A simplified embedding of E into monomodal K.Rohan French - 2009 - Logic Journal of the IGPL 17 (4):421-428.
Nice Embedding in Classical Logic.Peter Verdée & Diderik Batens - 2016 - Studia Logica 104 (1):47-78.
On logics with coimplication.Frank Wolter - 1998 - Journal of Philosophical Logic 27 (4):353-387.
Embeddings of Computable Structures.Asher M. Kach, Oscar Levin & Reed Solomon - 2010 - Notre Dame Journal of Formal Logic 51 (1):55-68.
Combining and Automating Classical and Non-Classical Logics in Classical Higher-Order Logic.Christoph Benzmüller - 2011 - Annals of Mathematics and Artificial Intelligence) 62 (1-2):103-128.

Analytics

Added to PP
2022-04-01

Downloads
350 (#58,464)

6 months
155 (#21,995)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Sophie Nagler
University of St. Andrews

Citations of this work

No citations found.

Add more citations

References found in this work

Provability logic.Rineke Verbrugge - 2008 - Stanford Encyclopedia of Philosophy.

Add more references