Finite automata, real time processes and counting problems in bounded arithmetics

Journal of Symbolic Logic 53 (1):243-258 (1988)
Abstract
In this paper we present a negative solution of counting problems for some classes slightly different from bounded arithmetic (▵ 0 sets). To get the results we study properties of chains of finite automata.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274442
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,150
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Automata Presenting Structures: A Survey of the Finite String Case.Sasha Rubin - 2008 - Bulletin of Symbolic Logic 14 (2):169-209.
Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non--Classical Logics 8 (1-2):107--121.
Semi-Bounded Relations in Ordered Modules.Oleg Belegradek - 2004 - Journal of Symbolic Logic 69 (2):499 - 517.
Complexity of the Two-Variable Fragment with Counting Quantifiers.Ian Pratt-Hartmann - 2005 - Journal of Logic, Language and Information 14 (3):369-395.
Theories of Arithmetics in Finite Models.M. Krynicki & K. Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
Weak Cardinality Theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861 - 878.

Monthly downloads

Added to index

2009-01-28

Total downloads

13 ( #346,751 of 2,152,218 )

Recent downloads (6 months)

1 ( #399,478 of 2,152,218 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums