You are not currently logged in.
Access JSTOR through your library or other institution:
Consequence Operations Based on Hypergraph Satisfiability
Studia Logica: An International Journal for Symbolic Logic
Vol. 58, No. 2 (Mar., 1997), pp. 261-272
Published by: Springer
Stable URL: http://www.jstor.org/stable/20015903
Page Count: 12
Preview not available
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.
Studia Logica: An International Journal for Symbolic Logic © 1997 Springer