Definability on Formulas With Single Quantifier

Mathematical Logic Quarterly 34 (2):105-108 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19880340203

Links

PhilArchive



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

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

Arithmetic definability by formulas with two quantifiers.Shih Ping Tung - 1992 - Journal of Symbolic Logic 57 (1):1-11.
Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
The Role of Quantifier Alternations in Cut Elimination.Philipp Gerhardy - 2005 - Notre Dame Journal of Formal Logic 46 (2):165-171.
Three quantifier sentences.Harvey Friedman - manuscript
On the quantifier complexity of Δ n+1 (T)– induction.A. Cordón-Franco, A. Fernández-Margarit & F. F. Lara-Martín - 2004 - Archive for Mathematical Logic 43 (3):371-398.
Definability and quantifier elimination for j3-theories.Ítala M. L. D'Ottaviano - 1987 - Studia Logica 46 (1):37 - 54.
Logics that define their own semantics.H. Imhof - 1999 - Archive for Mathematical Logic 38 (8):491-513.
Descriptive complexity of finite structures: Saving the quantifier rank.Oleg Pikhurko & Oleg Verbitsky - 2005 - Journal of Symbolic Logic 70 (2):419-450.
Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames.A. V. Chagrov & L. A. Chagrova - 1995 - Studia Logica 55 (3):421 - 448.
Elementary definability and completeness in general and positive modal logic.Ernst Zimmermann - 2003 - Journal of Logic, Language and Information 12 (1):99-117.
Definability and definable groups in simple theories.Anand Pillay - 1998 - Journal of Symbolic Logic 63 (3):788-796.
Review: Charles N. Delzell, Note on Quantifier Prefixes Over Diophantine Equations; J. P. Jones, H. Levitz, A. J. Wilkie, Classification of Quantifier Prefixes over Exponential Diophantine Equations. [REVIEW]Shih Ping Tung - 1988 - Journal of Symbolic Logic 53 (1):309-310.
Quantifier elimination for neocompact sets.H. Jerome Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.
Definability of polyadic lifts of generalized quantifiers.Lauri Hella, Jouko Väänänen & Dag Westerståhl - 1997 - Journal of Logic, Language and Information 6 (3):305-335.
On the definability of the quantifier “there exist uncountably many”.Žarko Mijajlović - 1985 - Studia Logica 44 (3):257 - 264.

Analytics

Added to PP
2013-12-01

Downloads
21 (#731,987)

6 months
1 (#1,469,469)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Arithmetic definability by formulas with two quantifiers.Shih Ping Tung - 1992 - Journal of Symbolic Logic 57 (1):1-11.

Add more citations

References found in this work

No references found.

Add more references