A model-theoretic characterization of constant-depth arithmetic circuits

Annals of Pure and Applied Logic 170 (9):1008-1029 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

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

A model-theoretic characterization of the weak pigeonhole principle.Neil Thapen - 2002 - Annals of Pure and Applied Logic 118 (1-2):175-195.
Model theoretic dynamics in Galois fashion.Daniel Max Hoffmann - 2019 - Annals of Pure and Applied Logic 170 (7):755-804.
Model-theoretic complexity of automatic structures.Bakhadyr Khoussainov & Mia Minnes - 2010 - Annals of Pure and Applied Logic 161 (3):416-426.
Model theoretic properties of the Urysohn sphere.Gabriel Conant & Caroline Terry - 2016 - Annals of Pure and Applied Logic 167 (1):49-72.
The model-theoretic structure of abelian group rings.Peter Pappas - 1985 - Annals of Pure and Applied Logic 28 (2):163-201.
Structures interpretable in models of bounded arithmetic.Neil Thapen - 2005 - Annals of Pure and Applied Logic 136 (3):247-266.
A recursion-theoretic approach to NP.Isabel Oitavem - 2011 - Annals of Pure and Applied Logic 162 (8):661-666.
Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.

Analytics

Added to PP
2019-04-13

Downloads
20 (#1,043,550)

6 months
6 (#869,904)

Historical graph of downloads
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