Halldén-completeness in super-intuitionistic predicate logics

Studia Logica 73 (1):113 - 130 (2003)
One criterion of constructive logics is the disjunction, property (DP). The Halldén-completeness is a weak DP, and is related to the relevance principle and variable separation. This concept is well-understood in the case of propositional logics. We extend this notion to predicate logics. Then three counterparts naturally arise. We discuss relationships between these properties and meet-irreducibility in the lattice of logics.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1022941407162
 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
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,829
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

14 ( #336,952 of 2,178,232 )

Recent downloads (6 months)

1 ( #316,504 of 2,178,232 )

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