Logic with Denumerably Long Formulas and Finite Strings of Quantifiers

, , &
Journal of Symbolic Logic 36 (1):157-158 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271545

Links

PhilArchive



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

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: Dana Scott, J. W. Addison, Leon Henkin, Alfred Tarski, Logic with Denumerably Long Formulas and Finite Strings of Quantifiers. [REVIEW]Perry Smith - 1971 - Journal of Symbolic Logic 36 (1):157-158.
Logic with denumerably long formulas and finite strings of quantifiers.Dana Scott - 1965 - Journal of Symbolic Logic 36 (1):1104--329.
On the model theory of denumerably long formulas with finite strings of quantifiers.M. Makkai - 1969 - Journal of Symbolic Logic 34 (3):437-459.
Review: H. Jerome Keisler, J. W. Addison, Leon Henkin, Alfred Tarski, Finite Approximations of Infinitely Long Formulas; H. Jerome Keisler, Some Applications of Infinitely Long Formulas. [REVIEW]Carol Karp - 1969 - Journal of Symbolic Logic 34 (1):129-130.
Finite Approximations of Infinitely Long Formulas.H. Jerome Keisler, J. W. Addison, Leon Henkin & Alfred Tarski - 1969 - Journal of Symbolic Logic 34 (1):129-130.
Ways of branching quantifers.Gila Sher - 1990 - Linguistics and Philosophy 13 (4):393 - 422.
Commodious axiomatization of quantifiers in multiple-valued logic.Reiner Hähnle - 1998 - Studia Logica 61 (1):101-121.
E. G. K. Lopez-Escobar. An interpolation theorem for denumerably long formulas. Fundamenta mathematicae, vol. 57 no. 3 (1965), pp. 253–257. - E. G. K. Lopez-Escobar. Universal formulas in the infinitary language L αβ. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 13 (1965), pp. 383–388. [REVIEW]E. G. K. Lopez-Escobar - 1969 - Journal of Symbolic Logic 34 (2):301-302.
Review: E. G. K. Lopez-Escobar, An Interpolation Theorem for Denumerably Long Formulas; E. G. K. Lopez-Escobar, Universal Formulas in the Infinitary Language $L_{alpha beta}$. [REVIEW]Erwin Engeler - 1969 - Journal of Symbolic Logic 34 (2):301-302.
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.
The Skolemization of existential quantifiers in intuitionistic logic.Matthias Baaz & Rosalie Iemhoff - 2006 - Annals of Pure and Applied Logic 142 (1):269-295.
Some remarks on infinitely long formulas.L. Henkin - 1961 - Journal of Symbolic Logic 30 (1):167--183.
Logical Hierarchies in PTIME.Lauri Hella - 1996 - Information And Computation 129 (1):1--19.
Relativized logspace and generalized quantifiers over finite ordered structures.Georg Gottlob - 1997 - Journal of Symbolic Logic 62 (2):545-574.
Descriptive complexity of finite structures: Saving the quantifier rank.Oleg Pikhurko & Oleg Verbitsky - 2005 - Journal of Symbolic Logic 70 (2):419-450.

Analytics

Added to PP
2017-02-21

Downloads
25 (#620,961)

6 months
7 (#416,569)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dana Scott
Carnegie Mellon University

Citations of this work

De finetti, countable additivity, consistency and coherence.Colin Howson - 2008 - British Journal for the Philosophy of Science 59 (1):1-23.
A new approach to infinitary languages.J. Hintikka - 1976 - Annals of Mathematical Logic 10 (1):95.
SAD computers and two versions of the Church–Turing thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
Scott sentences for certain groups.Julia F. Knight & Vikram Saraph - 2018 - Archive for Mathematical Logic 57 (3-4):453-472.

View all 12 citations / Add more citations

References found in this work

No references found.

Add more references