Upper Bounds for Proof-Search in a Sequent Calculus for Relational Equations

Mathematical Logic Quarterly 28 (14-18):239-246 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19820281408

Links

PhilArchive



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

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 and proof-search for bi-intuitionistic logic using nested sequents.Rajeev Goré, Linda Postniece & Alwen Tiu - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 43-66.
The cost of a cycle is a square.A. Carbone - 2002 - Journal of Symbolic Logic 67 (1):35-60.
The deduction rule and linear and near-linear proof simulations.Maria Luisa Bonet & Samuel R. Buss - 1993 - Journal of Symbolic Logic 58 (2):688-709.
Proof complexity of propositional default logic.Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas & Heribert Vollmer - 2011 - Archive for Mathematical Logic 50 (7-8):727-742.
Canonical proof nets for classical logic.Richard McKinley - 2013 - Annals of Pure and Applied Logic 164 (6):702-732.
2-Sequent calculus: a proof theory of modalities.Andrea Masini - 1992 - Annals of Pure and Applied Logic 58 (3):229-246.
A proof-search procedure for intuitionistic propositional logic.R. Alonderis - 2013 - Archive for Mathematical Logic 52 (7-8):759-778.
Relational semantics and a relational proof system for full Lambek calculus.Wendy MacCaull - 1998 - Journal of Symbolic Logic 63 (2):623-637.
Proof Terms for Classical Derivations.Restall Greg - manuscript
Interpolation theorems, lower Bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
Classical Non-Associative Lambek Calculus.Philippe De Groote & François Lamarche - 2002 - Studia Logica 71 (3):355 - 388.
A Deterministic Terminating Sequent Calculus For Gödel-dummett Logic.R. Dyckhoff - 1999 - Logic Journal of the IGPL 7 (3):319-326.
Bunched Logics Displayed.James Brotherston - 2012 - Studia Logica 100 (6):1223-1254.
Proof nets sequentialisation in multiplicative linear logic.Paolo Di Giamberardino & Claudia Faggian - 2008 - Annals of Pure and Applied Logic 155 (3):173-182.
Translating a Suppes-Lemmon Style Natural Deduction into a Sequent Calculus.Pavlović Edi - 2015 - European Journal of Analytic Philosophy 11 (2):79--88.

Analytics

Added to PP
2014-01-16

Downloads
29 (#545,505)

6 months
1 (#1,479,630)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A sequent calculus for relation algebras.Roger Maddux - 1983 - Annals of Pure and Applied Logic 25 (1):73-101.

Add more citations

References found in this work

No references found.

Add more references