Order:
  1.  29
    Finite automata, real time processes and counting problems in bounded arithmetics.Mirosław Kutyłowski - 1988 - Journal of Symbolic Logic 53 (1):243-258.
    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.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  2.  8
    Restricted Collection and Comprehension Schemata in Weak Set Theories.Mirosław Kutyłowski - 1986 - Mathematical Logic Quarterly 32 (35‐36):545-549.
    Direct download  
     
    Export citation  
     
    Bookmark  
  3.  21
    Restricted Collection and Comprehension Schemata in Weak Set Theories.Mirosław Kutyłowski - 1986 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 32 (35-36):545-549.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark