Theory of completeness for logical spaces

Logica Universalis 3 (2):243-291 (2009)
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.
Keywords universal logic  abstract logic  semantics  deduction  completeness
Categories (categorize this paper)
DOI 10.1007/s11787-009-0008-z
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,201
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

50 ( #95,351 of 1,940,952 )

Recent downloads (6 months)

3 ( #272,411 of 1,940,952 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.