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)

Other Versions

reprint Tung, Shih-Ping (1988) "Definability on Formulas With Single Quantifier". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34(2):105-108

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,448

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Consequences of neocompact quantifier elimination.Stefano Baratella & Siu-Ah Ng - 2003 - Mathematical Logic Quarterly 49 (2):150-162.
Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Arithmetic definability by formulas with two quantifiers.Shih Ping Tung - 1992 - Journal of Symbolic Logic 57 (1):1-11.
Definability by turing machines.R. M. Baer - 1969 - Mathematical Logic Quarterly 15 (20-22):325-332.
Universal First‐Order Definability in Modal Logic.R. E. Jennings, D. K. Johnston & P. K. Schotch - 1980 - Mathematical Logic Quarterly 26 (19-21):327-330.
A Quantifier for Isomorphisms.J. Ouko Väänänen - 1980 - Mathematical Logic Quarterly 26 (7-9):123-130.
The U‐Quantifier.A. H. Lachlan - 1961 - Mathematical Logic Quarterly 7 (11-14):171-174.

Analytics

Added to PP
2013-12-01

Downloads
26 (#841,117)

6 months
5 (#1,015,253)

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