Uniform Short Proofs for Classical Theorems

Notre Dame Journal of Formal Logic 42 (2):121-127 (2001)
  Copy   BIBTEX

Abstract

This note exploits back-and-forth characteristics to construct, using a single method, short proofs for ten classics of first-order and modal logic: interpolation theorems, preservation theorems, and Lindström's theorem

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1054837939

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,343

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A new modal lindström theorem.Johan van Benthem - 2007 - Logica Universalis 1 (1):125-138.
On Formalization of Model-Theoretic Proofs of Gödel's Theorems.Makoto Kikuchi & Kazuyuki Tanaka - 1994 - Notre Dame Journal of Formal Logic 35 (3):403-412.
Back and forth constructions in modal logic: An interpolation theorem for a family of modal logics.George Weaver & Jeffrey Welaish - 1986 - Journal of Symbolic Logic 51 (4):969-980.
A short proof of the preservation of the ωω‐bounding property.Chaz Schlindwein - 2004 - Mathematical Logic Quarterly 50 (1):29-32.
Cresswell M. J.. A Henkin completeness theorem for T. Notre Dame journal of formal logic, vol. 8 no. 3 , pp. 186–190.Cresswell M. J.. Alternative completeness theorems for modal systems. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 339–345.Cresswell M. J.. Some proofs of relative completeness in modal logic. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 62–66. [REVIEW]David Makinson - 1970 - Journal of Symbolic Logic 35 (4):581-582.
A Note on the Theorems of Church‐Turing and Trachtenbrot.Michael Deutsch - 1994 - Mathematical Logic Quarterly 40 (3):422-424.
Some Connections between Topological and Modal Logic.Kurt Engesser - 1995 - Mathematical Logic Quarterly 41 (1):49-64.
First-Order Modal Logic: Frame Definability and a Lindström Theorem.R. Zoghifard & M. Pourmahdian - 2018 - Studia Logica 106 (4):699-720.
Embedding Friendly First-Order Paradefinite and Connexive Logics.Norihiro Kamide - 2022 - Journal of Philosophical Logic 51 (5):1055-1102.
Syntactic Preservation Theorems for Intuitionistic Predicate Logic.Jonathan Fleischmann - 2010 - Notre Dame Journal of Formal Logic 51 (2):225-245.

Analytics

Added to PP
2010-08-24

Downloads
25 (#921,682)

6 months
6 (#572,300)

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

Add more references