Theory of completeness for logical spaces

Logica Universalis 3 (2):243-291 (2009)
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.
Keywords universal logic  abstract logic  semantics  deduction  completeness
Categories (categorize this paper)
Options
 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: 9,357
External links
  •   Try with proxy.
  • Through your library Configure
    References found in this work BETA

    No references found.

    Citations of this work BETA

    No citations found.

    Similar books and articles
    Analytics

    Monthly downloads

    Added to index

    2009-08-08

    Total downloads

    29 ( #50,804 of 1,088,621 )

    Recent downloads (6 months)

    1 ( #69,601 of 1,088,621 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature


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