Consequence Operations Based on Hypergraph Satisfiability

Studia Logica 58 (2):261-272 (1997)
  Copy   BIBTEX

Abstract

Four consequence operators based on hypergraph satisfiability are defined. Their properties are explored and interconnections are displayed. Finally their relation to the case of the Classical Propositional Calculus is shown.

Categories

Keywords

Reprint years

DOI

10.1023/a:1004923723916

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

Hypergraph Satisfiability.R. Cowen - 1991 - Reports on Mathematical Logic.
Combinatorial Analytic Tableaux.Robert Cowen - 1993 - Reports on Mathematical Logic:29-39.
Reversed Resolution in Reducing General Satisfiability Problem.Adam Kolany - 2010 - Studia Logica 95 (3):407-416.
Nonmonotonic reasoning: from finitary relations to infinitary inference operations.Michael Freund & Daniel Lehmann - 1994 - Studia Logica 53 (2):161-201.
Nonmonotonic reasoning: From finitary relations to infinitary inference operations.Michael Freund & Daniel Lehmann - 1994 - Studia Logica 53 (2):161 - 201.
Systems for Non-Reflexive Consequence.Carlo Nicolai & Lorenzo Rossi - 2023 - Studia Logica 111 (6):947-977.
Two notions of compactness in Gödel logics.Petr Cintula - 2005 - Studia Logica 81 (1):99-123.
Should Pregroup Grammars be Adorned with Additional Operations?Joachim Lambek - 2007 - Studia Logica 87 (2-3):343-358.
Should Pregroup Grammars Be Adorned with Additional Operations? To Michael Moortgat on His First Half Century.Joachim Lambek - 2007 - Studia Logica 87 (2-3):343 - 358.
Undecidability results on two-variable logics.Erich Grädel, Martin Otto & Eric Rosen - 1999 - Archive for Mathematical Logic 38 (4-5):313-354.
A sequent formulation of conditional logic based on belief change operations.Peter Roeper - 2004 - Studia Logica 77 (3):425 - 438.
Dov M. Gabbay, Sergei S. Goncharov and Michael Zakharyaschev (eds.), Mathematical problems from applied logic I.Anders Søgaard - 2007 - Studia Logica 87 (2-3):363-367.
Satisfiability testing for Boolean formulas using δ-trees.G. Gutiérrez, I. P. de Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.
The Contributions of Logic to the Foundations of Physics: Foreword. [REVIEW]Diederik Aerts, Sonja Smets & Jean P. Van Bendegem - 2010 - Studia Logica 95 (1-2):1-3.
Mathematical Fuzzy Logic – What It Can Learn from Mostowski and Rasiowa.Petr Hájek - 2006 - Studia Logica 84 (1):51-62.

Analytics

Added to PP
2009-01-28

Downloads
65 (#243,968)

6 months
6 (#522,885)

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

Satisfiability on hypergraphs.Adam Kolany - 1993 - Studia Logica 52 (3):393-404.
Hypergraph Satisfiability.R. Cowen - 1991 - Reports on Mathematical Logic.
Combinatorial Analytic Tableaux.Robert Cowen - 1993 - Reports on Mathematical Logic:29-39.

Add more references