Deductive Argumentation by Enhanced Sequent Calculi and Dynamic Derivations

&
Electronic Notes in Theoretical Computer Science 323:21–37 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,667

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

Logical argumentation by dynamic proof systems.Ofer Arieli & Christian Straßer - forthcoming - Theoretical Computer Science.
Dynamic Derivations for Sequent-Based Logical Argumentation.Ofer Arieli & Christian Straßer - 2014 - In Simon Parsons, Nir Oren, Chris Reed & Federico Cerutti (eds.), Proceedings COMMA 2014. IOS Press. pp. 89--100.
On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems.Tim Lyon - 2013 - In Sergei Artemov & Anil Nerode (eds.), Logical Foundations of Computer Science (Lecture Notes in Computer Science 7734). Springer. pp. 177-194.
Cut Elimination in Sequent Calculi with Implicit Contraction, with a Conjecture on the Origin of Gentzen’s Altitude Line Construction.Jan von Plato & Sara Negri - 2016 - In Peter Schuster & Dieter Probst (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science. Boston: De Gruyter. pp. 269-290.
Modal Sequent Calculi Labelled with Truth Values: Cut Elimination.Paulo Mateus, João Rasga & Cristina Sernadas - 2005 - Logic Journal of the IGPL 13 (2):173-199.
Gentzen's proof systems: byproducts in a work of genius.Jan von Plato - 2012 - Bulletin of Symbolic Logic 18 (3):313-367.
Interactive Theorem Proving with Tasks.Malte Hübner, Serge Autexier, Christoph Benzmüller & Andreas Meier - 2004 - Electronic Notes in Theoretical Computer Science 103 (C):161-181.
Admissibility of structural rules for extensions of contraction-free sequent calculi.R. Dyckhoff & S. Negri - 2001 - Logic Journal of the IGPL 9 (4):541-548.
An Extended Paradefinite Logic Combining Conflation, Paraconsistent Negation, Classical Negation, and Classical Implication: How to Construct Nice Gentzen-type Sequent Calculi.Norihiro Kamide - 2022 - Logica Universalis 16 (3):389-417.
Preface: Proceedings of the 7th Workshop on User Interfaces for Theorem Provers.Autexier Serge & Benzmüller Christoph - 2007 - Electronic Notes in Theoretical Computer Science 174 (2):1-2.

Analytics

Added to PP
2020-01-31

Downloads
11 (#1,425,715)

6 months
4 (#1,264,753)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Christian Straßer
Ruhr-Universität Bochum

Citations of this work

Add more citations

References found in this work

No references found.

Add more references