McKinsey J. C. C.. The decision problem for some classes of sentences without quantifiers [Book Review]

Journal of Symbolic Logic 9 (1):30-31 (1944)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2267323

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,628

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

Review: J. C. C. McKinsey, The Decision Problem for Some Classes of Sentences Without Quantifiers. [REVIEW]P. Lagerström - 1944 - Journal of Symbolic Logic 9 (1):30-31.
The decision problem for some classes of sentences without quantifiers.J. C. C. McKinsey - 1943 - Journal of Symbolic Logic 8 (2):61-76.
A Remark on Henkin Sentences and Their Contraries.John P. Burgess - 2003 - Notre Dame Journal of Formal Logic 44 (3):185-188.
A note on the monotonicity of reducible quantifiers.R. Zuber - 2010 - Journal of Logic, Language and Information 19 (1):123-128.
A solution to the donkey sentence problem.Adam Morton - 2015 - Analysis 75 (4):554-557.
Wright on the McKinsey Problem.Anthony Brueckner - 2008 - Philosophy and Phenomenological Research 76 (2):385-391.
Capturing Relativized Complexity Classes without Order.Anuj Dawar, Georg Gottlob & Lauri Hella - 1998 - Mathematical Logic Quarterly 44 (1):109-122.
On second-order generalized quantifiers and finite structures.Anders Andersson - 2002 - Annals of Pure and Applied Logic 115 (1--3):1--32.
Spectra of formulae with Henkin quantifiers.Joanna Golinska-Pilarek & Konrad Zdanowski - 2003 - In A. Rojszczak, J. Cachro & G. Kurczewski (eds.), Philosophical Dimensions of Logic and Science. Kluwer Academic Publishers. pp. 29-45.
Is it logical to count on quantifiers? Dissociable neural networks underlying numerical and logical quantifiers.V. Troiani, J. Peelle, R. Clark & M. Grossman - 2009 - Neuropsychologia 47 (1):104--111.
Quantifiers determined by classes of binary relations.Michał Krynicki - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 125--138.
A solution of the decision problem for the Lewis systems s2 and s4, with an application to topology.J. C. C. McKinsey - 1941 - Journal of Symbolic Logic 6 (4):117-134.
Review: Soren Hallden, On the Decision-Problem of Lewis' Calculus S5. [REVIEW]J. C. C. McKinsey - 1950 - Journal of Symbolic Logic 15 (3):224-224.
Pre-Ordered Quantifiers in Elementary Sentences of Natural Language.Marek W. Zawadowski - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 237--253.
The problem of Quantificational Completeness and the Characterization of All Perfect Quantifiers in 3-Valued Logics.Walter A. Carnielli - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (1):19-29.

Analytics

Added to PP
2016-06-30

Downloads
7 (#1,380,763)

6 months
1 (#1,463,894)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references