Elimination problems in logic: a brief history

Synthese 164 (3):321-332 (2008)
  Copy   BIBTEX

Abstract

A common aim of elimination problems for languages of logic is to express the entire content of a set of formulas of the language, or a certain part of it, in a way that is more elementary or more informative. We want to bring out that as the languages for logic grew in expressive power and, at the same time, our knowledge of their expressive limitations also grew, elimination problems in logic underwent some change. For languages other than that for monadic second-order logic, there remain important open problems.

Categories

Keywords

Reprint years

DOI

10.1007/s11229-008-9352-4

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,654

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

Cut‐Elimination Theorem for the Logic of Constant Domains.Ryo Kashima & Tatsuya Shimura - 1994 - Mathematical Logic Quarterly 40 (2):153-172.
Strong Cut-elimination In Display Logic.Heinrich Wansing - 1995 - Reports on Mathematical Logic:117-131.
Cut Might Cautiously.Jaap van der Does - 1995 - Logic Journal of the IGPL 3 (2-3):191-202.
Cut-elimination for Weak Grzegorczyk Logic Go.Rajeev Goré & Revantha Ramanayake - 2014 - Studia Logica 102 (1):1-27.
Cut elimination for the unified logic.Jacqueline Vauzeilles - 1993 - Annals of Pure and Applied Logic 62 (1):1-16.
Sequent systems for compact bilinear logic.Wojciech Buszkowski - 2003 - Mathematical Logic Quarterly 49 (5):467.
Cut elimination for a calculus with context-dependent rules.Birgit Elbl - 2001 - Archive for Mathematical Logic 40 (3):167-188.
A cut-elimination proof in intuitionistic predicate logic.Mirjana Borisavljević - 1999 - Annals of Pure and Applied Logic 99 (1-3):105-136.
A proof-theoretic treatment of λ-reduction with cut-elimination: λ-calculus as a logic programming language.Michael Gabbay - 2011 - Journal of Symbolic Logic 76 (2):673 - 699.
Algebraic proofs of cut elimination.Jeremy Avigad - manuscript
Cut elimination for propositional dynamic logic without.Robert A. Bull - 1992 - Mathematical Logic Quarterly 38 (1):85-100.
Non-effective Quantifier Elimination.Mihai Prunescu - 2001 - Mathematical Logic Quarterly 47 (4):557-562.
Cut Elimination for GLS Using the Terminability of its Regress Process.Jude Brighton - 2016 - Journal of Philosophical Logic 45 (2):147-153.
Multi-agent Justification Logic: communication and evidence elimination. [REVIEW]Bryan Renne - 2012 - Synthese 185 (S1):43-82.
Cut-elimination Theorems of Some Infinitary Modal Logics.Yoshihito Tanaka - 2001 - Mathematical Logic Quarterly 47 (3):327-340.

Analytics

Added to PP
2009-01-28

Downloads
57 (#285,838)

6 months
6 (#566,625)

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

Introduction to mathematical logic.Alonzo Church - 1944 - Princeton,: Princeton University Press. Edited by C. Truesdell.
Introduction to mathematical logic..Alonzo Church - 1944 - Princeton,: Princeton university press: London, H. Milford, Oxford university press. Edited by C. Truesdell.
Completeness in the theory of types.Leon Henkin - 1950 - Journal of Symbolic Logic 15 (2):81-91.
An Investigation of the Laws of Thought.George Boole - 1854 - [New York]: Dover Publications.

View all 10 references / Add more references