- 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
The expressive power of Malitz quantifiers for linear orderings
Annals of Pure and Applied Logic 36:53-103 (1987)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
The metamathematics of scattered linear orderings.P. Clote - 1989 - Archive for Mathematical Logic 29 (1):9-20.
Magidor-Malitz quantifiers in modules.Andreas Baudisch - 1984 - Journal of Symbolic Logic 49 (1):1-8.
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
On vectorizations of unary generalized quantifiers.Kerkko Luosto - 2012 - Archive for Mathematical Logic 51 (3):241-255.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
Countably categorical coloured linear orders.Feresiano Mwesigye & John K. Truss - 2010 - Mathematical Logic Quarterly 56 (2):159-163.
Relativized logspace and generalized quantifiers over finite ordered structures.Georg Gottlob - 1997 - Journal of Symbolic Logic 62 (2):545-574.
A coding of the countable linear orderings.Patrick Dehornoy - 1990 - Studia Logica 49 (4):585 - 590.
Theories of finitely determinate linear orderings in stationary logic.Heinrich Herre - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 89--113.
A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
Directions in Generalized Quantifier Theory.Dag Westerståhl & J. F. A. K. van Benthem - 1995 - Studia Logica 55 (3):389-419.
Review: C. Spector, Hyperarithmetical Quantifiers; Shih-Chao Liu, Recursive Linear Orderings and Hyperarithmetical Functions. [REVIEW]Gustav Hensel - 1966 - Journal of Symbolic Logic 31 (1):137-137.
Review: E. G. K. Lopez-Escobar, On Defining Well-Orderings; E. G. K. Lopez-Escobar, An Addition to "On Defining Well-Orderings.". [REVIEW]Jerome Malitz - 1968 - Journal of Symbolic Logic 33 (1):123-123.
Analytics
Added to PP
2014-01-16
Downloads
15 (#944,758)
6 months
3 (#969,763)
2014-01-16
Downloads
15 (#944,758)
6 months
3 (#969,763)
Historical graph of downloads
References found in this work
Compact extensions of L(Q).Menachem Magidor & Jerome Malitz - 1977 - Annals of Mathematical Logic 11 (2):217--261.
An Application of Games to the Completeness Problem for Formalized Theories.A. Ehrenfeucht - 1967 - Journal of Symbolic Logic 32 (2):281-282.
The monadic theory of ω2.Yuri Gurevich, Menachem Magidor & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (2):387-398.
Entscheidbarkeit von Theorien in Logiken mit verallgemeinerten Quantoren.Heinrich Herre & Helmut Wolter - 1975 - Mathematical Logic Quarterly 21 (1):229-246.
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-64dd777598-b9rvg uwo