Characterizing Second Order Logic with First Order Quantifiers
✍ Scribed by David Harel
- Publisher
- John Wiley and Sons
- Year
- 1979
- Tongue
- English
- Weight
- 257 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
CHARACTERIZING SECOND ORDER LOGIC WITH FIRST ORDER QU-4NTIFIERX by DAVID HAREL in Cambridge, Massachusets (U.S.A.) l)
') The author is indebted to W. J. WALKOE, A. R. MEYER, A. SHAMIR and a rcfeiee for comments on previous versions.
📜 SIMILAR VOLUMES
## Abstract The aim of this paper is to point out the equivalence between three notions respectively issued from recursion theory, computational complexity and finite model theory. One the one hand, the rudimentary languages are known to be characterized by the linear hierarchy. On the other hand,
## Abstract We refine the constructions of Ferrante‐Rackoff and Solovay on iterated definitions in first‐order logic and their expressibility with polynomial size formulas. These constructions introduce additional quantifiers; however, we show that these extra quantifiers range over only finite set
## Abstract We study the class of Sperner spaces, a generalized version of affine spaces, as defined in the language of pointline incidence and line parallelity. We show that, although the class of Sperner spaces is a pseudo‐elementary class, it is not elementary nor even ℒ︁~∞__ω__~‐axiomatizable.
## Abstract A back and forth condition on interpretations for those second‐order languages without functional variables whose non‐logical vocabulary is finite and excludes functional constants is presented. It is shown that this condition is necessary and sufficient for the interpretations to be eq
The notion of unification for fuzzy sets in fuzzy logic programming is explored in this article from the standpoint of a theoretical framework based on first-order probabilistic modal logic. The fundamental difference between the latter perspective and other approaches described in the literature li