On simplicity of formulas
Studia Logica 49 (3):401 - 419 (1990)
| Abstract | Simple formula should contain only few quantifiers. In the paper the methods to estimate quantity and quality of quantifiers needed to express a sentence equivalent to given one. | |||||||||
| 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,631 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesDorit Ben Shalom (2003). One Connection Between Standard Invariance Conditions on Modal Formulas and Generalized Quantifiers. Journal of Logic, Language and Information 12 (1).
Jerome M. Segal (1999). Graceful Simplicity: Toward a Philosophy and Politics of Simple Living. H. Holt & Co..
Arnold Zellner, Hugo A. Keuzenkamp & Michael McAleer (eds.) (2001). Simplicity, Inference and Modeling: Keeping It Sophisticatedly Simple. Cambridge University Press.
Nick Bezhanishvili (2008). Frame Based Formulas for Intermediate Logics. Studia Logica 90 (2):139 - 159.
Ursula Gropp (1988). Coinductive Formulas and a Many-Sorted Interpolation Theorem. Journal of Symbolic Logic 53 (3):937-960.
Giorgie Dzhaparidze (1991). Predicate Provability Logic with Non-Modalized Quantifiers. Studia Logica 50 (1):149 - 160.
Oleg Pikhurko & Oleg Verbitsky (2005). Descriptive Complexity of Finite Structures: Saving the Quantifier Rank. Journal of Symbolic Logic 70 (2):419 - 450.
Byunghan Kim (2001). Simplicity, and Stability in There. Journal of Symbolic Logic 66 (2):822-836.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,507 of 548,969 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
