Minimally generated abstract logics
Logica Universalis 3 (2) (2009)
| Abstract | In this paper we study an alternative approach to the concept of abstract logic and to connectives in abstract logics. The notion of abstract logic was introduced by Brown and Suszko (Diss Math 102:9–42, 1973)—nevertheless, similar concepts have been investigated by various authors. Considering abstract logics as intersection structures we extend several notions to their κ -versions ( κ ≥ ω ), introduce a hierarchy of κ -prime theories, which is important for our treatment of infinite connectives, and study different concepts of κ -compactness. We are particularly interested in non-topped intersection structures viewed as semi-lattices with a minimal meet-dense subset, i.e., with a minimal generator set. We study a chain condition which is sufficient for a minimal generator set, implies compactness of the logic, and in regular logics is equivalent to ( κ -) compactness of the consequence relation together with the existence of a ( κ -)inconsistent set, where κ is the cofinality of the cardinality of the logic. Some of these results are known in a similar form in the context of closure spaces, we give extensions to (non-topped) intersection structures and to big cardinals presenting new proofs based on set-theoretical tools. The existence of a minimal generator set is crucial for our way to define connectives. Although our method can be extended to further non-classical connectives we concentrate here on intuitionistic and infinite ones. Our approach leads us to the concept of the set of complete theories which is stable under all considered connectives and gives rise to the definition of the topological space of the logic. Topological representations of (non-classical) abstract logics by means of this space remain to be further investigated. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesC. G. Fermüller (2008). Dialogue Games for Many-Valued Logics — an Overview. Studia Logica 90 (1):43 - 68.
M. E. Coniglio & W. A. Carnielli (2002). Transfers Between Logics and Their Applications. Studia Logica 72 (3):367-400.
M. Angela Weiss & Rohit Parikh (2002). Completeness of Certain Bimodal Logics for Subset Spaces. Studia Logica 71 (1):1 - 30.
Petr Cintula (2005). Two Notions of Compactness in Gödel Logics. Studia Logica 81 (1):99 - 122.
Josep Maria Font & Miquel Rius (2000). An Abstract Algebraic Logic Approach to Tetravalent Modal Logics. Journal of Symbolic Logic 65 (2):481-518.
Ramon Jansana (1995). Abstract Modal Logics. Studia Logica 55 (2):273 - 299.
Marcelo Tsuji (1998). Many-Valued Logics and Suszko's Thesis Revisited. Studia Logica 60 (2):299-309.
Daniele Mundici (1986). Inverse Topological Systems and Compactness in Abstract Model Theory. Journal of Symbolic Logic 51 (3):785-794.
Josep M. Font & Ventura Verdú (1989). A First Approach to Abstract Modal Logics. Journal of Symbolic Logic 54 (3):1042-1062.
Steffen Lewitzka (2007). Abstract Logics, Logic Maps, and Logic Homomorphisms. Logica Universalis 1 (2).
Analytics
Monthly downloads |
Added to index2009-08-17Total downloads17 ( #71,063 of 549,062 )Recent downloads (6 months)1 ( #63,185 of 549,062 )How can I increase my downloads? |
My notes
Discussion
