On Height and Happiness

Predicate abstraction provides very simple formal machinery that represents some of the ideas connecting intension and extension. It has been investigated and applied for many years now. Here we do two things with it. First, we present some natural examples, and show how predicate abstraction can be applied to them. Second, we give a formal proof procedure for predicate abstraction, based on nested sequents. Soundness and completeness proofs are sketched.

[1]  Rudolf Carnap,et al.  Meaning and Necessity , 1947 .

[3]  Richmond H. Thomason,et al.  Abstraction in First‐Order Modal Logic1 , 2008 .

[4]  Melvin Fitting.  Nested Sequents for Intuitionistic Logics , 2014, Notre Dame J. Formal Log..

[5]  Melvin Fitting,et al.  Prefixed tableaus and nested sequents , 2012, Ann. Pure Appl. Log..

[6]  A. Whitehead,et al.  Principia mathematica, tome I, second édition , 1927 .

[7]  Melvin Fitting,et al.  FOIL Axiomatized , 2006, Stud Logica.

[8]  K. Wehmeier.  Subjunctivity and cross-world predication , 2012 .

[9]  Kai Brünnler,et al.  Deep sequent systems for modal logic , 2009, Arch. Math. Log..

[10]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[11]  Melvin Fitting.  Correction to FOILAxiomatized Studia Logica, 84:1–22, 2006 , 2007, Stud Logica.

[12]  B. Russell.  II.—On Denoting , 1905 .

[13]  Francesca Poggiolesi,et al.  The Method of Tree-Hypersequents for Modal Propositional Logic , 2009, Towards Mathematical Philosophy.

[14]  Melvin Fitting,et al.  Modal Logics Between Propositional and First-order , 2002, J. Log. Comput..

[15]  Ryo Kashima,et al.  Cut-free sequent calculi for some tense logics , 1994, Stud Logica.

[16]  Richard L. Mendelsohn,et al.  First-Order Modal Logic , 1998 .

[17]  Richmond H. Thomason,et al.  Modality and reference , 1968 .

[18]  Melvin Fitting,et al.  First-order intensional logic , 2004, Ann. Pure Appl. Log..

[19]  J. Hintikka.  On denoting what? , 2005, Synthese.