A Syntactic Approach to Closure Operation

Marek Nowak

Bulletin of the Section of Logic (2017)

  • Volume: 46, Issue: 3/4
  • ISSN: 0138-0680

Abstract

top
In the paper, tracing the traditional Hilbert-style syntactic account of logics, a syntactic characteristic of a closure operation defined on a complete lattice follows. The approach is based on observation that the role of rule of inference for a given consequence operation may be played by an ordinary binary relation on the complete lattice on which the closure operation is defined.

How to cite

top

Marek Nowak. "A Syntactic Approach to Closure Operation." Bulletin of the Section of Logic 46.3/4 (2017): null. <http://eudml.org/doc/295585>.

@article{MarekNowak2017,
abstract = {In the paper, tracing the traditional Hilbert-style syntactic account of logics, a syntactic characteristic of a closure operation defined on a complete lattice follows. The approach is based on observation that the role of rule of inference for a given consequence operation may be played by an ordinary binary relation on the complete lattice on which the closure operation is defined.},
author = {Marek Nowak},
journal = {Bulletin of the Section of Logic},
keywords = {closure operation; closure system; rule of inference},
language = {eng},
number = {3/4},
pages = {null},
title = {A Syntactic Approach to Closure Operation},
url = {http://eudml.org/doc/295585},
volume = {46},
year = {2017},
}

TY - JOUR
AU - Marek Nowak
TI - A Syntactic Approach to Closure Operation
JO - Bulletin of the Section of Logic
PY - 2017
VL - 46
IS - 3/4
SP - null
AB - In the paper, tracing the traditional Hilbert-style syntactic account of logics, a syntactic characteristic of a closure operation defined on a complete lattice follows. The approach is based on observation that the role of rule of inference for a given consequence operation may be played by an ordinary binary relation on the complete lattice on which the closure operation is defined.
LA - eng
KW - closure operation; closure system; rule of inference
UR - http://eudml.org/doc/295585
ER -

References

top
  1. [1] T. S. Blyth, Lattices and Ordered Algebraic Structures, Springer (2005). 
  2. [2] K. Denecke, M. Erné, S. L. Wismath (eds.), Galois Connections and Applications, Kluwer (2004). 
  3. [3] F. Domenach, B. Leclerc, Biclosed binary relations and Galois connections, Order 18 (2001), pp. 89–104. 
  4. [4] M. Erné, J. Koslowski, A. Melton, G. E. Strecker, A Primer on Galois Connections, Annals of the New York Academy of Sciences, vol. 704 (1993), pp. 103–125. 
  5. [5] D. J. Shoesmith, T. J. Smiley, Multiple-conclusion Logic, Cambridge University Press (1978). 
  6. [6] R. Wójcicki, Lectures on Propositional Calculi, Ossolineum (1984). 
  7. [7] R. Wójcicki, Theory of Logical Calculi. Basic Theory of Consequence Operations, Kluwer (1988). 
  8. [8] J. Zygmunt, An Essay in Matrix Semantics for Consequence Relations, Wydawnictwo Uniwersytetu Wrocławskiego, Wrocław (1984). 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.