Cut Elimination for S4C: A Case Study

Studia Logica 82 (1):121-132 (2006)
  Copy   BIBTEX

Abstract

S4C is a logic of continuous transformations of a topological space. Cut elimination for it requires new kind of rules and new kinds of reductions.

Categories

Keywords

Reprint years

DOI

10.1007/s11225-006-6608-1

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

Effective Cut-elimination for a Fragment of Modal mu-calculus.Grigori Mints - 2012 - Studia Logica 100 (1-2):279-287.
Cut elimination for a simple formulation of epsilon calculus.Grigori Mints - 2008 - Annals of Pure and Applied Logic 152 (1):148-160.
Call-by-name reduction and cut-elimination in classical logic.Kentaro Kikuchi - 2008 - Annals of Pure and Applied Logic 153 (1-3):38-65.
On the termination of russell’s description elimination algorithm.Clemens Grabmayer, Joop Leo, Vincent van Oostrom & Albert Visser - 2011 - Review of Symbolic Logic 4 (3):367-393.
Reduction, elimination, and firewalking.Colin Cheyne - 1993 - Philosophy of Science 60 (2):349-357.
Non-effective Quantifier Elimination.Mihai Prunescu - 2001 - Mathematical Logic Quarterly 47 (4):557-562.
Duplication of directed graphs and exponential blow up of proofs.A. Carbone - 1999 - Annals of Pure and Applied Logic 100 (1-3):1-67.
Finding a place for elimination in inter-level reductionist activities: Reply to Wimsatt.Pierre Poirier - 2006 - Synthese 151 (3):477 - 483.
Coscienza e soggettività. La scienza cognitiva ha eliminato le persone?Michele Di Francesco & Alfredo Tomasetta - 2013 - Rivista di Filosofia 104 (3):403-420.
The elimination argument.Andrew M. Bailey - 2014 - Philosophical Studies 168 (2):475-482.
Sufficient conditions for cut elimination with complexity analysis.João Rasga - 2007 - Annals of Pure and Applied Logic 149 (1-3):81-99.
Cut-elimination for simple type theory with an axiom of choice.G. Mints - 1999 - Journal of Symbolic Logic 64 (2):479-485.
Cut‐Elimination Theorem for the Logic of Constant Domains.Ryo Kashima & Tatsuya Shimura - 1994 - Mathematical Logic Quarterly 40 (2):153-172.
The Role of Quantifier Alternations in Cut Elimination.Philipp Gerhardy - 2005 - Notre Dame Journal of Formal Logic 46 (2):165-171.
In Case You Didn’t Know.Clyde Freeman Herreid - 2011 - Inquiry: Critical Thinking Across the Disciplines 26 (3):33-38.

Analytics

Added to PP
2009-01-28

Downloads
61 (#258,521)

6 months
8 (#342,364)

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

Dynamic topological logic.Philip Kremer & Giorgi Mints - 2005 - Annals of Pure and Applied Logic 131 (1-3):133-158.
Dynamic topological logic.Philip Kremer & Grigori Mints - 2005 - Annals of Pure and Applied Logic 131 (1-3):133-158.

Add more references