Finite automata, real time processes and counting problems in bounded arithmetics
From MaRDI portal
Publication:3791138
DOI10.2307/2274442zbMath0647.03034OpenAlexW4253641400MaRDI QIDQ3791138
Publication date: 1988
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274442
counting problemsfragments of arithmeticrelative consistency.metamathematics of weak systems of arithmeticunprovability of consistencybounded arithmeticschains of finite automatacounting automaton
Automata and formal grammars in connection with logical questions (03D05) First-order arithmetic and fragments (03F30)
Related Items (1)
This page was built for publication: Finite automata, real time processes and counting problems in bounded arithmetics