Using rewriting rules for connection graphs to prove theorems

&
Artificial Intelligence 12 (2):159-178 (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(79)90015-8

Links

PhilArchive



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

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

A general theorem on termination of rewriting.Jeremy E. Dawson - unknown
Graphs with ∏ 1 0 (K)Y-sections.Boško Živaljević - 1993 - Archive for Mathematical Logic 32 (4):259-273.
Comparing the power of games on graphs.Ronald Fagin - 1997 - Mathematical Logic Quarterly 43 (4):431-455.
Reconstituting beta graphs into an efficacious system.Sun-Joo Shin - 1999 - Journal of Logic, Language and Information 8 (3):273-295.
Peirce's Logical Graphs for Boolean Algebras and Distributive Lattices.Minghui Ma - 2018 - Transactions of the Charles S. Peirce Society 54 (3):320.
Validity in Possible Worlds.Asadollah Fallahi & Lotfollah Nabavi - 2008 - Journal of Philosophical Theological Research 9 (35):69-88.
Rules in relevant logic - I: Semantic classification.Ross T. Brady - 1994 - Journal of Philosophical Logic 23 (2):111 - 137.
A Rejection System for the First-Degree Formulae of some Relevant Logics.Ross T. Brady - 2008 - Australasian Journal of Logic 6:55-69.
Towards characterizing Markov equivalence classes for directed acyclic graphs with latent variables.Ayesha Ali, Thomas Richardson, Peter Spirtes & Jiji Zhang - unknown
Infinite graphs in systematic biology, with an application to the species problem.Samuel A. Alexander - 2013 - Acta Biotheoretica 61 (2):181--201.
Types of I -free hereditary right maximal terms.Katalin Bimbó - 2005 - Journal of Philosophical Logic 34 (5/6):607 - 620.
Some dichotomy theorems for isomorphism relations of countable models.Su Gao - 2001 - Journal of Symbolic Logic 66 (2):902-922.
Deduction theorems for weak implicational logics.M. W. Bunder - 1982 - Studia Logica 41 (2-3):95 - 108.
On the consistency of some partition theorems for continuous colorings, and the structure of ℵ1-dense real order types.Uri Abraham, Matatyahu Rubin & Saharon Shelah - 1985 - Annals of Pure and Applied Logic 29 (2):123-206.
On the Consistency of Some Partition Theorems for Continuous Colorings, and the Structure of ℵ 1 -Dense Real Order Types.J. Steprans, Uri Abraham, Matatyahu Rubin & Saharon Shelah - 2002 - Bulletin of Symbolic Logic 8 (2):303.

Analytics

Added to PP
2020-12-22

Downloads
2 (#1,804,489)

6 months
1 (#1,471,470)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

An improved proof procedure.Dag Prawitz - 1960 - Theoria 26 (2):102-139.
Refutation graphs.Robert E. Shostak - 1976 - Artificial Intelligence 7 (1):51-64.
Resolution graphs.Robert A. Yates, Bertram Raphael & Timothy P. Hart - 1970 - Artificial Intelligence 1 (3-4):257-289.

Add more references