On the degree of complexity of sentential logics. A couple of examples
Studia Logica 40 (2):141 - 153 (1981)
| Abstract | The first part of the paper is a reminder of fundamental results connected with the adequacy problem for sentential logics with respect to matrix semantics. One of the main notions associated with the problem, namely that of the degree of complexity of a sentential logic, is elucidated by a couple of examples in the second part of the paper. E.g., it is shown that the minimal logic of Johansson and some of its extensions have degree of complexity 2. This is the first example of an exact estimation of the degree of natural complex logics, i.e. logics whose deducibility relation cannot be represented by a single matrix. The remaining examples of complex logics are more artificial, having been constructed for the purpose of checking some theoretical possibilities. | |||||||||
| 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,701 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesPeter Verdée (2009). Adaptive Logics Using the Minimal Abnormality Strategy Are P 1 1 \Pi^1_1 -Complex. Synthese 167 (1):93 - 104.
Peter Verdée (2009). Adaptive Logics Using the Minimal Abnormality Strategy Are 1 \Pi^11 -Complex. Synthese 167 (1):93 - 104.
Volker Weber (2009). Branching-Time Logics Repeatedly Referring to States. Journal of Logic, Language and Information 18 (4).
Janusz Czelakowski (1984). Filter Distributive Logics. Studia Logica 43 (4):353 - 377.
Steve Giambrone & Robert K. Meyer (1989). Completeness and Conservative Extension Results for Some Boolean Relevant Logics. Studia Logica 48 (1):1 - 14.
Josep Maria Font & Miquel Rius (2000). An Abstract Algebraic Logic Approach to Tetravalent Modal Logics. Journal of Symbolic Logic 65 (2):481-518.
Peter Apostoli (1997). On the Completeness of First Degree Weakly Aggregative Modal Logics. Journal of Philosophical Logic 26 (2):169-180.
Jacek Hawranek (1987). On the Degree of Complexity of Sentential Logics, III. An Example of Johansson's Minimal Logic. Studia Logica 46 (4):283 - 289.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads2 ( #232,575 of 549,124 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
