Theory of completeness for logical spaces

Logica Universalis 3 (2):243-291 (2009)
  Copy   BIBTEX

Abstract

A logical space is a pair of a non-empty set A and a subset of . Since is identified with {0, 1} A and {0, 1} is a typical lattice, a pair of a non-empty set A and a subset of for a certain lattice is also called a -valued functional logical space. A deduction system on A is a pair (R, D) of a subset D of A and a relation R between A* and A. In terms of these simplest concepts, a general framework for studying the logical completeness is constructed.

Links

PhilArchive



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

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

A conjunction in closure spaces.Andrzej W. Jankowski - 1984 - Studia Logica 43 (4):341 - 351.
Three logical theories.John Corcoran - 1969 - Philosophy of Science 36 (2):153-177.
A temporal logic for sortals.Max A. Freund - 2001 - Studia Logica 69 (3):351-380.

Analytics

Added to PP
2009-08-08

Downloads
90 (#189,588)

6 months
9 (#308,642)

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

The completeness of the first-order functional calculus.Leon Henkin - 1949 - Journal of Symbolic Logic 14 (3):159-166.

Add more references