Switch to: References

Add citations

You must login to add citations.
  1. Construction of models of bounded arithmetic by restricted reduced powers.Michal Garlík - 2016 - Archive for Mathematical Logic 55 (5-6):625-648.
    We present two constructions of models of bounded arithmetic, both in the form of a generalization of the ultrapower construction, that yield nonelementary extensions but do not introduce new lengths. As an application we show, assuming the existence of a one-way permutation g hard against polynomial-size circuits, that strictR21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textit{strict}R^1_2$$\end{document} is weaker than R21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R^1_2$$\end{document}. In particular, if such a permutation can be defined by (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations