- 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
Decidability and generalized quantifiers
Andreas Baudisch (ed.)
Berlin: Akademie Verlag (1980)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Decidability and Generalized Quantifiers.John Cowles - 1982 - Journal of Symbolic Logic 47 (4):907-908.
Baudisch Andreas, Seese Detlef, Tuschik Hans-Peter, and Weese Martin. Decidability and generalized quantifiers. Mathematical research-Mathematische Forschung, vol. 3. Akademie-Verlag, Berlin 1980, XII + 235 pp. [REVIEW]John Cowles - 1982 - Journal of Symbolic Logic 47 (4):907-908.
Issues of decidability and tractability.Witold Marciszewski (ed.) - 2006 - Białystok: University of Białystok.
Decidability of some intuitionistic predicate theories.Dov M. Gabbay - 1972 - Journal of Symbolic Logic 37 (3):579-587.
Decidability and undecidability of extensions of second (first) order theory of (generalized) successor.Calvin C. Elgot & Michael O. Rabin - 1966 - Journal of Symbolic Logic 31 (2):169-181.
Aristotelian syllogisms and generalized quantifiers.Dag Westerståhl - 1989 - Studia Logica 48 (4):577-585.
A normal modal calculus between T and s4 without the finite model property.David Makinson - 1969 - Journal of Symbolic Logic 34 (1):35-38.
Andreas Baudisch, A new uncountably categorical group, Transactions of the American Mathematical Society, vol. 348 , pp. 3889–3940. [REVIEW]Gregory Cherlin - 1999 - Journal of Symbolic Logic 64 (2):905-906.
On the decidability of implicational ticket entailment.Katalin Bimbó & J. Michael Dunn - 2013 - Journal of Symbolic Logic 78 (1):214-236.
Analytics
Added to PP
2009-01-28
Downloads
33 (#689,169)
6 months
3 (#1,477,354)
2009-01-28
Downloads
33 (#689,169)
6 months
3 (#1,477,354)
Historical graph of downloads
Citations of this work
L(aa)‐Elementary Types of Well‐Orderings.Detlef Seese & Martin Weese - 1982 - Mathematical Logic Quarterly 28 (33‐38):557-564.
L-Elementary Types of Well-Orderings.Detlef Seese & Martin Weese - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (33-38):557-564.
Expressing cardinality quantifiers in monadic second-order logic over chains.Vince Bárány, Łukasz Kaiser & Alexander Rabinovich - 2011 - Journal of Symbolic Logic 76 (2):603 - 619.
The Boolean Sentence Algebra of the Theory of Linear Ordering is Atomic with Respect to Logics with a Malitz Quantifier.Hans-Joachim Goltz - 1985 - Mathematical Logic Quarterly 31 (9-12):131-162.
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-667477cd97-wmc4m dc2