The permutability of rules in the classical inferential calculus

Journal of Symbolic Logic 17 (4):245-248 (1952)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2266612

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

Inferential semantics for first-order logic : motivating rules of inference from rules of evaluation.Neil Tennant - 2010 - In T. J. Smiley, Jonathan Lear & Alex Oliver (eds.), The Force of Argument: Essays in Honor of Timothy Smiley. Routledge. pp. 223--257.
On the definition of negation by a fixed proposition in inferential calculus.Haskell B. Curry - 1952 - Journal of Symbolic Logic 17 (2):98-104.
Varieties of linear calculi.Sara Negri - 2002 - Journal of Philosophical Logic 31 (6):569-590.
Three prepositional calculi of probability.Herman Dishkant - 1980 - Studia Logica 39 (1):49 - 61.
A sequent calculus formulation of type assignment with equality rules for the \ambdaβ-calculus.Jonathan P. Seldin - 1978 - Journal of Symbolic Logic 43 (4):643-649.
Investigations into a left-structural right-substructural sequent calculus.Lloyd Humberstone - 2007 - Journal of Logic, Language and Information 16 (2):141-171.
Transformative decision rules, permutability, and non-sequential framing of decision problems.Martin Peterson - 2004 - Synthese 139 (3):387-403.

Analytics

Added to PP
2009-01-28

Downloads
42 (#368,825)

6 months
8 (#352,434)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Lambek calculus enriched with additional connectives.Makoto Kanazawa - 1992 - Journal of Logic, Language and Information 1 (2):141-171.

Add more citations

References found in this work

No references found.

Add more references