- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
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.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 - 2001 - In Arnold Zellner, Hugo A. Keuzenkamp & Michael McAleer (eds.), Simplicity, Inference and Modelling: Keeping It Sophisticatedly Simple. New York: Cambridge University Press. pp. 13-32.
Graceful simplicity: toward a philosophy and politics of simple living.Jerome M. Segal - 1999 - New York: H. Holt & Co..
Analytics
Added to PP
2009-01-28
Downloads
30 (#537,355)
6 months
4 (#799,214)
2009-01-28
Downloads
30 (#537,355)
6 months
4 (#799,214)
Historical graph of downloads
Citations of this work
The simplest axiom system for plane hyperbolic geometry.Victor Pambuccian - 2004 - Studia Logica 77 (3):385 - 411.
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.
Logic with the quantifier "there exist uncountably many".H. Jerome Keisler - 1970 - Annals of Mathematical Logic 1 (1):1.
Theory of models with generalized atomic formulas.H. Jerome Keisler - 1960 - Journal of Symbolic Logic 25 (1):1-26.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-5ff6c685cb-wqqkk uwo