A Syntactic Approach to Closure Operation

Bulletin of the Section of Logic 46 (3/4) (2017)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,991

External links

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

Through your library

Similar books and articles

Disjunctive Multiple-Conclusion Consequence Relations.Marek Nowak - 2019 - Bulletin of the Section of Logic 48 (4).
Quantum logic revisited.L. Román & B. Rumbos - 1991 - Foundations of Physics 21 (6):727-734.
A Graph-theoretic Method to Define any Boolean Operation on Partitions.David Ellerman - 2019 - The Art of Discrete and Applied Mathematics 2 (2):1-9.
Deep Fried Logic.Shay Allen Logan - 2020 - Erkenntnis 87 (1):257-286.
Language-Theoretic and Finite Relation Models for the (Full) Lambek Calculus.Christian Wurm - 2017 - Journal of Logic, Language and Information 26 (2):179-214.
Neg-Raising and Neg movement.Paul Crowley - 2019 - Natural Language Semantics 27 (1):1-17.

Analytics

Added to PP
2018-06-26

Downloads
14 (#1,018,837)

6 months
7 (#492,113)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Marek Nowak
University of Lodz

References found in this work

No references found.

Add more references