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.DOI
10.1007/bf00370372
My notes
Similar books and articles
Safe formulas in the general theory of stable models (preliminary report).Vladimir Lifschitz - unknown
Descriptive complexity of finite structures: Saving the quantifier rank.Oleg Pikhurko & Oleg Verbitsky - 2005 - Journal of Symbolic Logic 70 (2):419-450.
Predicate provability logic with non-modalized quantifiers.Giorgie Dzhaparidze - 1991 - Studia Logica 50 (1):149 - 160.
Coinductive formulas and a many-sorted interpolation theorem.Ursula Gropp - 1988 - Journal of Symbolic Logic 53 (3):937-960.
What is the problem of simplicity?Elliott Sober - 2002 - In Arnold Zellner, Hugo A. Keuzenkamp & Michael McAleer (eds.), Simplicity, Inference, and Modelling. Cambridge: Cambridge University Press. pp. 13-32.
Graceful Simplicity: Toward a Philosophy and Politics of Simple Living.Jerome M. Segal - 1999 - H. Holt & Co..
Analytics
Added to PP
2009-01-28
Downloads
25 (#465,768)
6 months
1 (#451,398)
2009-01-28
Downloads
25 (#465,768)
6 months
1 (#451,398)
Historical graph of downloads
Citations of this work
References found in this work
On a generalization of quantifiers.Andrzej Mostowski - 1957 - Fundamenta Mathematicae 44 (2):12--36.
First order predicate logic with generalized quantifiers.Per Lindström - 1966 - Theoria 32 (3):186--195.
Logic with the quantifier “there exist uncountably many”.H. Jerome Keisler - 1970 - Annals of Mathematical Logic 1 (1):1-93.
Theory of models with generalized atomic formulas.H. Jerome Keisler - 1960 - Journal of Symbolic Logic 25 (1):1-26.
Logic with the quantifier "there exist uncountably many".H. Jerome Keisler - 1970 - Annals of Mathematical Logic 1 (1):1.
