Finite quantifier equivalence

Journal of Symbolic Logic 36 (1):407--412 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271546

Links

PhilArchive



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

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: Carol R. Karp, Finite-Quantifier Equivalence. [REVIEW]H. Jerome Keisler - 1971 - Journal of Symbolic Logic 36 (1):158-158.
Quantifier-eliminable locally finite graphs.Shawn Hedman & Wai Yan Pong - 2011 - Mathematical Logic Quarterly 57 (2):180-185.
Equivalence of bar recursors in the theory of functionals of finite type.Marc Bezem - 1988 - Archive for Mathematical Logic 27 (2):149-160.
Computational complexity of some Ramsey quantifiers in finite models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
The Equivalence Principle Revisited.Fritz Rohrlich - 2000 - Foundations of Physics 30 (5):621-630.
A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids.James H. Schmerl - 2012 - Journal of Symbolic Logic 77 (4):1165-1183.
M-Zeroids: Structure and Categorical Equivalence.Joshua B. Palmatier & Fernando Guzman - 2012 - Studia Logica 100 (5):975-1000.
The quantifier complexity of polynomial‐size iterated definitions in first‐order logic.Samuel R. Buss & Alan S. Johnson - 2010 - Mathematical Logic Quarterly 56 (6):573-590.
Almost everywhere equivalence of logics in finite model theory.Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto - 1996 - Bulletin of Symbolic Logic 2 (4):422-443.
Productos de Lt-tipos para especies T.Juan Carlos Martinez - 1992 - Theoria 7 (1/2/3):105-121.
Small substructures and decidability issues for first-order logic with two variables.Emanuel Kieroński & Martin Otto - 2012 - Journal of Symbolic Logic 77 (3):729-765.
Unary quantifiers on finite models.Jouko Väänänen - 1997 - Journal of Logic, Language and Information 6 (3):275-304.
Quantifiers and congruence closure.Jörg Flum, Matthias Schiehlen & Jouko Väänänen - 1999 - Studia Logica 62 (3):315-340.

Analytics

Added to PP
2014-02-01

Downloads
27 (#572,408)

6 months
4 (#818,853)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Counting Incompossibles.Peter Fritz & Jeremy Goodman - 2017 - Mind 126 (504):1063–1108.
Modal Ontology and Generalized Quantifiers.Peter Fritz - 2013 - Journal of Philosophical Logic 42 (4):643-678.
Absolute logics and L∞ω.K. Jon Barwise - 1972 - Annals of Mathematical Logic 4 (3):309-340.
Set-theoretical Invariance Criteria for Logicality.Solomon Feferman - 2010 - Notre Dame Journal of Formal Logic 51 (1):3-20.
Definability hierarchies of general quantifiers.Lauri Hella - 1989 - Annals of Pure and Applied Logic 43 (3):235.

View all 18 citations / Add more citations

References found in this work

No references found.

Add more references