An Open Problem In

The notation and terminology of this paper follow [2], and are dual to those of [6] and [7]. If L is a language in the narrow sense, Cn may be any consequence operation on sets of sentences of L that includes classical sentential logic. Henceforth when we talk of the language L we intend to include reference to some fixed, though unspecified, operation Cn. X is a deductive system if X = Cn(X). Sentences x, z that are logically equivalent with respect to Cn – that is x ∈ Cn({z}) and z ∈ Cn({x}) – are identified. If X and Z are systems we often write X x instead of x ∈ X and Z X instead of X ⊆ Z. If X = Cn({x}) for some sentence x, X is (finitely) axiomatizable. The set theoretical intersection of X and Z has the logical force of disjunction, and is written X ∨ Z; Cn(X ∪ Z), the smallest system to include both X and Z, is written XZ. If K is a family of systems, [K] and [K] may be defined in an analogous way. The logically strongest system S is the set of all sentences of L; the weakest system T is defined as Cn(∅). The autocomplement Z of Z is defined to be the strongest system to complement T, namely the system [{Y : Y ∨ Z = T}]. More generally we may define X − Z as [{Y : X Y ∨ Z}]. In terms of this operation to remainder, Z is identical with T − Z. The class of all deductive systems forms a distributive lattice under the operations of concatenation and ∨; and indeed a Brouverian algebra (a relatively authocomplemented lattice with unit) under concatenation, ∨ – and T.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 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
Translate to english
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,756
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

15 ( #318,118 of 2,178,142 )

Recent downloads (6 months)

1 ( #316,663 of 2,178,142 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums