¹1-formulae on finite structures

Annals of Pure and Applied Logic 24 (1):1 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(83)90038-6

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

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

First-order definability on finite structures.M. Ajtai - 1989 - Annals of Pure and Applied Logic 45 (3):211-225.
Andersson, A., On second-order generalized quanti" ers and" finite structures.D. R. Hirschfeldt, B. Khoussainov, R. A. Shore & A. M. Slinko - 2002 - Annals of Pure and Applied Logic 115:303.
On Gödel incompleteness and finite combinatorics.Akihiro Kanamori & Kenneth McAloon - 1987 - Annals of Pure and Applied Logic 33 (C):23-41.
An existential locality theorem.Martin Grohe & Stefan Wöhrle - 2004 - Annals of Pure and Applied Logic 129 (1-3):131-148.
Locally modular theories of finite rank.Steven Buechler - 1986 - Annals of Pure and Applied Logic 30 (1):83-94.
Homogeneous finite rings in characteristic 2n.Dan Saracino & Carol Wood - 1988 - Annals of Pure and Applied Logic 40 (1):11-28.
Reverse mathematics and properties of finite character.Damir D. Dzhafarov & Carl Mummert - 2012 - Annals of Pure and Applied Logic 163 (9):1243-1251.
Pairs of computable structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Pairs of recursive structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Discrete o-minimal structures.Anand Pillay & Charles Steinhorn - 1987 - Annals of Pure and Applied Logic 34 (3):275-289.

Analytics

Added to PP
2014-01-16

Downloads
50 (#327,457)

6 months
5 (#710,311)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Notes on polynomially bounded arithmetic.Domenico Zambella - 1996 - Journal of Symbolic Logic 61 (3):942-966.
Feasibly constructive proofs of succinct weak circuit lower bounds.Moritz Müller & Ján Pich - 2020 - Annals of Pure and Applied Logic 171 (2):102735.

View all 25 citations / Add more citations

References found in this work

On sets of relations definable by addition.James F. Lynch - 1982 - Journal of Symbolic Logic 47 (3):659-668.

Add more references