The expected complexity of analytic tableaux analyses in propositional calculus

Notre Dame Journal of Formal Logic 23 (4):409-426 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A note on propositional calculus.Shalom Rosenberg - 1972 - Notre Dame Journal of Formal Logic 13 (4):506-510.
A generalised propositional calculus.Peter Jablon - 1975 - Notre Dame Journal of Formal Logic 16 (2):295-297.
A formal system for the non-theorems of the propositional calculus.Xavier Caicedo Ferrer - 1978 - Notre Dame Journal of Formal Logic 19 (1):147-151.
Completeness of the generalized propositional calculus.Alexander Abian - 1970 - Notre Dame Journal of Formal Logic 11 (4):449-452.
Notes on the axiomatics of the propositional calculus.C. A. Meredith & A. N. Prior - 1963 - Notre Dame Journal of Formal Logic 4 (3):171-187.
Proof routines for the propositional calculus.Hugues Leblanc - 1963 - Notre Dame Journal of Formal Logic 4 (2):81-104.
Leibniz's syllogistico-propositional calculus.Hector-Neri Casta Neda - 1976 - Notre Dame Journal of Formal Logic 17 (4):481-500.

Analytics

Added to PP
2010-08-24

Downloads
12 (#1,095,505)

6 months
3 (#1,209,684)

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

No references found.

Add more references