Decidability with Respect to Härtig Quantifier and Rescher Quantifier

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (36):569-576 (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19810273604

Links

PhilArchive



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

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

Non-effective Quantifier Elimination.Mihai Prunescu - 2001 - Mathematical Logic Quarterly 47 (4):557-562.
The härtig quantifier: A survey.Heinrich Herre, Michał Krynicki, Alexandr Pinus & Jouko Väänänen - 1991 - Journal of Symbolic Logic 56 (4):1153-1183.
Three quantifier sentences.Harvey Friedman - manuscript
Decidability of ∀*∀‐Sentences in Membership Theories.Eugenio G. Omodeo, Franco Parlamento & Alberto Policriti - 1996 - Mathematical Logic Quarterly 42 (1):41-58.
Hierarchies of monadic generalized quantifiers.Kerkko Luosto - 2000 - Journal of Symbolic Logic 65 (3):1241-1263.
A Remark On The Härtig Quantifier.Gebhard Fuhrken - 1972 - Mathematical Logic Quarterly 18 (13‐15):227-228.
On Some Applications of Games for Härtig Quantifier.Michal Krynicki - 1987 - Mathematical Logic Quarterly 33 (4):359-370.
The Decidability of the Class and the Axiom of Foundation.Dorella Bellè & Franco Parlamento - 2001 - Notre Dame Journal of Formal Logic 42 (1):41-53.
Quantifiers and congruence closure.Jörg Flum, Matthias Schiehlen & Jouko Väänänen - 1999 - Studia Logica 62 (3):315-340.
The Decidability of the $ \forall^*\exists$ Class and the Axiom of Foundation.Dorella Bellè & Franco Parlamento - 2001 - Notre Dame Journal of Formal Logic 42 (1):41-53.
The Role of Quantifier Alternations in Cut Elimination.Philipp Gerhardy - 2005 - Notre Dame Journal of Formal Logic 46 (2):165-171.
The Logical Form of Quantifier Phrases: Quantifier-sortalvariable.John Corcoran - 1999 - Bulletin of Symbolic Logic 5:418-419.
On the definability of the quantifier “there exist uncountably many”.Žarko Mijajlović - 1985 - Studia Logica 44 (3):257 - 264.
Neocompact quantifier elimination in structures based on Banach spaces.Stefano Baratella & Siu-Ah Ng - 2001 - Annals of Pure and Applied Logic 111 (1-2):115-143.
Computational complexity of quantifier-free negationless theory of field of rational numbers.Nikolai Kossovski - 2001 - Annals of Pure and Applied Logic 113 (1-3):175-180.

Analytics

Added to PP
2013-12-01

Downloads
23 (#680,480)

6 months
3 (#969,763)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Add more citations

References found in this work

No references found.

Add more references