A uniform proof procedure for SCI tautologies

Studia Logica 33 (3):299 - 310 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1007/bf02123284

Links

PhilArchive



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

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

Goal-directed proof theory.Dov M. Gabbay - 2000 - Boston: Kluwer Academic. Edited by Nicola Olivetti.
A sequence formalization for SCI.Anita Wasilewska - 1976 - Studia Logica 35 (3):213 - 217.
Reasoning processes in propositional logic.Claes Strannegård, Simon Ulfsbäcker, David Hedqvist & Tommy Gärling - 2010 - Journal of Logic, Language and Information 19 (3):283-314.
Lower Bounds for Modal Logics.Pavel Hrubeš - 2007 - Journal of Symbolic Logic 72 (3):941 - 958.
A proof–technique in uniform space theory.Douglas Bridges & Luminiţa Vîţă - 2003 - Journal of Symbolic Logic 68 (3):795-802.
Uniform self-reference.Raymond M. Smullyan - 1985 - Studia Logica 44 (4):439 - 445.
Plausibly hard combinatorial tautologies.Jeremy Avigad - manuscript
Inferentializing consequence.Jaroslav Peregrin - unknown
Complementary Logics for Classical Propositional Languages.Achille C. Varzi - 1992 - Kriterion - Journal of Philosophy 4 (1):20-24.

Analytics

Added to PP
2009-01-28

Downloads
34 (#468,159)

6 months
4 (#778,909)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A sequence formalization for SCI.Anita Wasilewska - 1976 - Studia Logica 35 (3):213 - 217.

Add more citations

References found in this work

No references found.

Add more references