Reduction of the Decision Problem to Formulas Containing a Bounded Number of Quantifiers Only

Proceedings of the Tenth International Congress of Philosophy 2:759-762 (1949)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,674

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: Janos Suranyi, Reduction of the Decision Problem to Formulas Containing a Bounded Number of Quantifiers Only. [REVIEW]Andrzej Mostowski - 1949 - Journal of Symbolic Logic 14 (2):131-131.
The Complexity of Bounded Quantifiers in Some Ordered Abelian Groups.Philip Scowcroft - 2007 - Notre Dame Journal of Formal Logic 48 (4):521-550.
δ-Decidability over the Reals.Sicun Gao, Jeremy Avigad & Edmund M. Clarke - unknown
Review: Janos Suranyi, Contributions to the Reduction Theory of the Decision Problem. Second Paper. Three Universal, One Existential Quantifiers. [REVIEW]Alonzo Church - 1953 - Journal of Symbolic Logic 18 (3):264-264.
Arity and alternation in second-order logic.J. A. Makowsky & Y. B. Pnueli - 1994 - Annals of Pure and Applied Logic 78 (1-3):189-202.
Conservative reduction classes of Krom formulas.Stål O. Aanderaa, Egon Börger & Harry R. Lewis - 1982 - Journal of Symbolic Logic 47 (1):110-130.
Descriptive complexity of finite structures: Saving the quantifier rank.Oleg Pikhurko & Oleg Verbitsky - 2005 - Journal of Symbolic Logic 70 (2):419-450.
Decision Problem in Group Theory.[author unknown] - 1949 - Proceedings of the Tenth International Congress of Philosophy 2:763-766.
First-order and counting theories of ω-automatic structures.Dietrich Kuske & Markus Lohrey - 2008 - Journal of Symbolic Logic 73 (1):129-150.
Predicate provability logic with non-modalized quantifiers.Giorgie Dzhaparidze - 1991 - Studia Logica 50 (1):149 - 160.
Ways of branching quantifers.Gila Sher - 1990 - Linguistics and Philosophy 13 (4):393 - 422.
On the reduction of the decision problem.László Kalmár & János Surányi - 1947 - Journal of Symbolic Logic 12 (3):65 - 73.
The guarded fragment with transitive guards.Wiesław Szwast & Lidia Tendera - 2004 - Annals of Pure and Applied Logic 128 (1-3):227-276.
Satisfiability testing for Boolean formulas using δ-trees.G. Gutiérrez, I. P. de Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.
Satisfiability Testing for Boolean Formulas Using Δ-Trees.G. Gutiérrez, I. P. De Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.

Analytics

Added to PP
2017-01-11

Downloads
1 (#1,908,430)

6 months
1 (#1,501,709)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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