Finite Partially‐Ordered Quantifiers

Mathematical Logic Quarterly 16 (8):393-397 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19700160802

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,945

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Hierarchies of Partially Ordered Connectives and Quantifiers.Michał Krynicki - 1993 - Mathematical Logic Quarterly 39 (1):287-294.
Herbert B. Enderton. A mathematical introduction to logic. Academic Press, New York and London1972, xiv + 295 pp. [REVIEW]J. R. Shoenfield - 1973 - Journal of Symbolic Logic 38 (2):340-341.
Herbert B. Enderton. A Mathematical Introduction to Logic. Harcourt/Academic Press, New York and London, 2001 , xii + 317 pp. [REVIEW]Natasha Dobrinen - 2003 - Bulletin of Symbolic Logic 9 (3):406-407.
The logic of informational independence and finite models.G. Sandu - 1997 - Logic Journal of the IGPL 5 (1):79-95.
A Formal Semantics for Some Discourse Anaphora.Jeffrey C. King - 1985 - Dissertation, University of California, San Diego
Partially ordered connectives and finite graphs.Lauri Hella & Gabriel Sandu - 1995 - In Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba, Quantifiers: Logics, Models and Computation: Volume Two: Contributions. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 79--88.
On Definitions of Cuts and Completion of Partially Ordered Sets.Alexander Abian - 1968 - Mathematical Logic Quarterly 14 (19):299-302.
The Model Completion of the Theory of All Partially Ordered Sets.G. E. Puninskij - 1989 - Mathematical Logic Quarterly 35 (6):481-481.
The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete.Anatoly P. Beltiukov - 2001 - Annals of Pure and Applied Logic 113 (1-3):53-58.
Partially ordered quantifiers vs. partially ordered ideas.Jaakko Hintikka - 1976 - Dialectica 30 (1):89--99.

Analytics

Added to PP
2013-11-02

Downloads
47 (#511,909)

6 months
8 (#499,904)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On branching quantifiers in English.Jon Barwise - 1979 - Journal of Philosophical Logic 8 (1):47 - 80.
Quantifiers vs. Quantification Theory.Jaakko Hintikka - 1973 - Dialectica 27 (3‐4):329-358.
On definability in dependence logic.Juha Kontinen & Jouko Väänänen - 2009 - Journal of Logic, Language and Information 18 (3):317-332.

View all 47 citations / Add more citations

References found in this work

Infinistic Methods.L. Henkin - 1961 - Pergamon Press.

Add more references