Journal of Symbolic Logic

Finite Automata, Real Time Processes and Counting Problems in Bounded Arithmetics

Miroslaw Kutylowski

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

In this paper we present a negative solution of counting problems for some classes slightly different from bounded arithmetic ($\triangle_0$ sets). To get the results we study properties of chains of finite automata.

Article information

Source
J. Symbolic Logic, Volume 53, Issue 1 (1988), 243-258.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183742579

Mathematical Reviews number (MathSciNet)
MR929389

Zentralblatt MATH identifier
0647.03034

JSTOR
links.jstor.org

Citation

Kutylowski, Miroslaw. Finite Automata, Real Time Processes and Counting Problems in Bounded Arithmetics. J. Symbolic Logic 53 (1988), no. 1, 243--258. https://projecteuclid.org/euclid.jsl/1183742579


Export citation