A simplified form of condensed detachment

Journal of Logic, Language and Information 4 (2):169-173 (1995)
  Copy   BIBTEX


This paper gives a simple, elegant statement of the condensed detachment rule that is independent of most general unifiers and proves that this is equivalent to the longer, more usual, formulation.



    Upload a copy of this work     Papers currently archived: 89,330

External links

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

Through your library


Added to PP

36 (#378,947)

6 months
1 (#1,003,762)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The D-Completeness of T→.R. K. Meyer & M. W. Bunder - 2011 - Australasian Journal of Logic 8:1-8.
Weaker D-Complete Logics.Norman Megill & Martin Bunder - 1996 - Logic Journal of the IGPL 4 (2):215-225.

Add more citations

References found in this work

Formal Logic.Arthur N. Prior & Norman Prior - 1955 - Oxford,: Oxford University Press.
Formal Logic.A. N. Prior - 1964 - Studia Logica 15:298-301.
A Machine-Oriented Logic based on the Resolution Principle.J. A. Robinson - 1966 - Journal of Symbolic Logic 31 (3):515-516.
Principal type-schemes and condensed detachment.J. Roger Hindley & David Meredith - 1990 - Journal of Symbolic Logic 55 (1):90-105.

Add more references